127 search results - page 1 / 26 » Analysis, evaluation, and comparison of algorithms for sched... |
ISPAN
1996
IEEE
1996
IEEE
Analysis, evaluation, and comparison of algorithms for scheduling task graphs on parallel processors
13 years 8 months ago
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
CJ
2008
13 years 4 months ago
2008
We evaluate the average-case performance of three approximation algorithms for online non-clairvoyant scheduling of parallel tasks with precedence constraints. We show that for a ...
TPDS
1998
13 years 4 months ago
1998
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...