1609 search results - page 45 / 322 » A Microeconomic Scheduler for Parallel Computers |
150
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Heterogeneity has been considered in scheduling, but without taking into account the temporal variation of completion times of the sub-tasks for a divisible, independent task. In ...
176
Voted
ISPAN
2002
IEEE
15 years 9 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
184
click to vote
ICDCS
1996
IEEE
15 years 8 months ago
1996
IEEE
Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, ...
117
click to vote
SPAA
2009
ACM
16 years 5 months ago
2009
ACM
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...