8 search results - page 1 / 2 » Power-aware scheduling for makespan and flow |
SAMOS
2010
Springer
13 years 2 months ago
2010
Springer
A new heterogeneous multiprocessor system with dynamic memory and power management for improved performance and power consumption is presented. Increased data locality is automatic...
SPAA
2006
ACM
13 years 10 months ago
2006
ACM
MP
2002
13 years 4 months ago
2002
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
ICALP
2009
Springer
14 years 4 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
IPPS
1997
IEEE
13 years 8 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...