306 search results - page 42 / 62 » Parallel approximation algorithms for facility-location prob... |
177
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
144
click to vote
HPCC
2005
Springer
15 years 11 months ago
2005
Springer
This study concerns a threshold-based matching algorithm for Clos (t-MAC) network switches. The studied Clos network uses a central photonic switch fabric for transporting high-spe...
163
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
179
click to vote
APPROX
2009
Springer
16 years 14 days ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
175
click to vote
ANOR
2010
15 years 3 months ago
2010
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...