68 search results - page 1 / 14 » Improving Parallel Job Scheduling by Combining Gang Scheduli... |
IPPS
2000
IEEE
13 years 8 months ago
2000
IEEE
IPPS
2000
IEEE
13 years 8 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...
JSSPP
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. Buffered coscheduling is a new methodology that can substantially increase resource utilization, improve response time, and simplify the development of the run-time suppo...
JSSPP
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. We present a new scheduling method for batch jobs on massively parallel processor architectures. This method is based on the First
IPPS
1999
IEEE
13 years 8 months ago
1999
IEEE
On many computers, a request to run a job is not serviced immediately but instead is placed in a queue and serviced only when resources are released by preceding jobs. In this pape...