1095 search results - page 80 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
100
Voted
EUROPAR
2010
Springer
14 years 11 months ago
2010
Springer
In the age of Grid, Cloud, volunteer computing, massively parallel applications are deployed over tens or hundreds of thousands of resources over short periods of times to complete...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
— There are many grid-based applications where a timely response to an important event is needed. Often such response can require a significant computation and possibly communic...
IPPS
2010
IEEE
14 years 8 months ago
2010
IEEE
In this paper we present the venture of porting two different algorithms for solving the two-dimensional advection PDE on the CBE platform, an in-place and an outof-place one, and ...
IPCO
1998
14 years 11 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...