Sciweavers

1156 search results - page 179 / 232
» Optimal scheduling of task graphs on parallel systems
Sort
View
FCCM
2002
IEEE
127views VLSI» more  FCCM 2002»
15 years 9 months ago
Hardware-Assisted Fast Routing
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
André DeHon, Randy Huang, John Wawrzynek
SPAA
2009
ACM
16 years 5 months ago
Brief announcement: selfishness in transactional memory
In order to be efficient with selfish programmers, a multicore transactional memory (TM) system must be designed such that it is compatible with good programming incentives (GPI),...
Raphael Eidenbenz, Roger Wattenhofer
ATAL
2010
Springer
15 years 5 months ago
Coalition formation with spatial and temporal constraints
The coordination of emergency responders and robots to undertake a number of tasks in disaster scenarios is a grand challenge for multi-agent systems. Central to this endeavour is...
Sarvapali D. Ramchurn, Maria Polukarov, Alessandro...
ITNG
2008
IEEE
15 years 11 months ago
Parallel FFT Algorithms on Network-on-Chips
This paper presents several parallel FFT algorithms with different degree of communication overhead for multiprocessors in Network-on-Chip(NoC) environment. Three different method...
Jun Ho Bahn, Jungsook Yang, Nader Bagherzadeh
NC
1998
138views Neural Networks» more  NC 1998»
15 years 5 months ago
Parallel Adaptive Genetic Algorithm
In this paper we introduce an efficient implementation of asynchronously parallel genetic algorithm with adaptive genetic operators. The classic genetic algorithm paradigm is exte...
Leo Budin, Marin Golub, Domagoj Jakobovic