1095 search results - page 23 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
IPPS
1998
IEEE
15 years 2 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...
ISPAN
1999
IEEE
15 years 2 months ago
1999
IEEE
We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approac...
115
click to vote
RTCSA
1998
IEEE
15 years 2 months ago
1998
IEEE
Snap-shot mechanisms are used to read a globally consistent set of variable values. Such a mechanism can be used to solve a variety of communication and synchronization problems, ...
DAC
2009
ACM
15 years 10 months ago
2009
ACM
Heterogeneous multicore processors promise high execution
efficiency under diverse workloads, and program scheduling is
critical in exploiting this efficiency. This paper present...
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of job scheduling on a variable voltage processor with d discrete voltage/speed levels. We give an algorithm which constructs a minimum energy schedule for ...