169 search results - page 2 / 34 » New Challenges of Parallel Job Scheduling |
IPPS
2000
IEEE
14 years 2 months ago
2000
IEEE
In this paper we propose a new class of scheduling policies, dubbed Concurrent Gang, that combines the advantages of gang scheduling for communication and synchronization intensiv...
COR
2011
13 years 4 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
IPPS
2000
IEEE
14 years 2 months ago
2000
IEEE
Buffered coscheduling is a scheduling methodology for time-sharing communicating processes in parallel and distributed systems. The methodology has two primary features: communica...
ANSS
2002
IEEE
14 years 2 months ago
2002
IEEE
Efficient scheduling of jobs on parallel processors is essential for good performance. However, design of such schedulers is challenging because of the complex interaction between...
EPS
1997
Springer
14 years 1 months ago
1997
Springer
This paper describes a GA for job shop scheduling problems. Using the Giffler and Thompson algorithm, we created two new operators, THX crossover and mutation, which better trans...