254 search results - page 34 / 51 » Approximation Algorithms for Scheduling Parallel Jobs |
106
click to vote
JCO
2010
14 years 9 months ago
2010
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
101
click to vote
RTCSA
2003
IEEE
15 years 4 months ago
2003
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
FSTTCS
2007
Springer
15 years 5 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
ESA
2009
Springer
15 years 3 months ago
2009
Springer
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
104
click to vote
GPC
2009
Springer
15 years 2 months ago
2009
Springer
The emerging Grid is extending the scope of resources to mobile devices and sensors that are connected through unreliable networks. Nowadays the number of mobile device users is in...