155 search results - page 3 / 31 » Online Scheduling of Equal-Length Jobs on Parallel Machines |
95
Voted
IPPS
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper addresses nonclairvoyant and nonpreemptive online job scheduling in Grids. In the applied basic model, the Grid system consists of a large number of identical processor...
114
click to vote
STOC
1997
ACM
15 years 3 months ago
1997
ACM
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
102
click to vote
HPCC
2007
Springer
15 years 5 months ago
2007
Springer
Advance Reservations(AR) make it possible to guarantee the QoS of Grid applications by reserving a particular resource capability over a defined time interval on local resources. H...
DAGSTUHL
2006
15 years 1 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 ...
105
click to vote
HPDC
2008
IEEE
14 years 11 months ago
2008
IEEE
This paper describes the study conducted to design and evaluate a two-level on-line scheduler to dynamically schedule a stream of sequential and multi-threaded batch jobs on large...