540 search results - page 13 / 108 » Scheduling dynamic parallelism on accelerators |
PPAM
2005
Springer
14 years 6 days ago
2005
Springer
Abstract. The paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on t...
ISORC
2008
IEEE
14 years 1 months ago
2008
IEEE
Some emerging networked embedded real-time applications have relatively long reaction time magnitudes—e.g., milliseconds to minutes. These longer execution time magnitudes allow...
JSSPP
2010
Springer
13 years 4 months ago
2010
Springer
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...
ESIAT
2009
IEEE
13 years 4 months ago
2009
IEEE
Through analysis of present pseudo-parallel genetic algorithm, propose a new dynamic sub-population pseudo-parallel genetic algorithm. It changes the condition that the magnitude o...
PLDI
2012
ACM
11 years 9 months ago
2012
ACM
Parallel programs are known to be difficult to analyze. A key reason is that they typically have an enormous number of execution interleavings, or schedules. Static analysis over...