239 search results - page 8 / 48 » On-line scheduling of parallel jobs on two machines |
149
click to vote
SIAMCOMP
2010
15 years 24 days ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
158
click to vote
IPPS
2008
IEEE
16 years 14 days 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...
155
click to vote
PPOPP
2006
ACM
16 years 20 hour ago
2006
ACM
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. In many cases, users wishi...
165
click to vote
JSSPP
2007
Springer
16 years 6 days ago
2007
Springer
Heterogeneous clusters and grid infrastructures are becoming increasingly popular. In these computing infrastructures, machines have different resources, including memory sizes, d...
161
click to vote
SAGT
2009
Springer
16 years 18 days ago
2009
Springer
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...