40 search results - page 2 / 8 » New hardness results for congestion minimization and machine... |
BIRTHDAY
2009
Springer
13 years 9 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
SC
2003
ACM
13 years 11 months ago
2003
ACM
Buffered CoScheduled MPI (BCS-MPI) introduces a new approach to design the communication layer for largescale parallel machines. The emphasis of BCS-MPI is on the global coordinat...
CLOUD
2010
ACM
13 years 11 months ago
2010
ACM
This paper investigates what it entails to provide I/O service differentiation and performance isolation for virtual machines on individual multicore nodes in cloud platforms. Sh...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
DAGSTUHL
2006
13 years 7 months ago
2006
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...