Sciweavers

534 search results - page 29 / 107
» On Scheduling Parallel Tasks at Twilight
Sort
View
121
Voted
IPPS
2008
IEEE
15 years 10 months ago
Fault-tolerant static scheduling for grids
While fault-tolerance is desirable for grid applications because of the distributed and dynamic nature of grid resources, it has seldom been considered in static scheduling. We pr...
Bernhard Fechner, Udo Hönig, Jörg Keller...
IPPS
1996
IEEE
15 years 8 months ago
Efficient Run-Time Support for Irregular Task Computations with Mixed Granularities
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...
Cong Fu, Tao Yang
107
Voted
ICMCS
2007
IEEE
123views Multimedia» more  ICMCS 2007»
15 years 10 months ago
Efficient Parallelization of H.264 Decoding with Macro Block Level Scheduling
The H.264 decoder has a sequential, control intensive front end that makes it difficult to leverage the potential performance of emerging manycore processors. Preparsing is a fun...
Jike Chong, Nadathur Satish, Bryan C. Catanzaro, K...
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 9 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
137
Voted
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
15 years 7 months ago
Comparison of genetic representation schemes for scheduling soft real-time parallel applications
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
Yoginder S. Dandass, Amit C. Bugde