Download:
|
by Zhou B. B, Brent R. P, Qu X
ftp://nimbus.anu.edu.au/pub/Brent/rpb169.ps.gz
Add To MetaCart
Abstract:
In conventional coscheduling, or gang scheduling of parallel workloads a round-robin queueing algorithm is adopted and the length of scheduling slots is fixed. However, the characteristics of parallel workloads can be quite different from sequential workloads. The system may not perform effectively using the simple round-robin algorithm. In this paper we introduce a new queueing algorithm. Our new system consists of two queues, a service queue which can hold more than one processes and a waiting queue which has multiple levels. This system has several potential advantages over some conventional queueing systems in scheduling parallel workloads. For example, it may achieve a higher system throughput and also a higher cache hit ratio, so the problems encountered in conventional coscheduling are alleviated. The issue of implementation of our algorithm is also discussed.
Citations
|
240
|
Scheduling Techniques for Concurrent Systems
– Ousterhout
- 1982
|
|
217
|
Queueing Systems, volume II. Computer Applications
– Kleinrock
- 1976
|
|
205
|
Process Control and Scheduling Issues for Multiprogrammed SharedMemory Multiprocessors
– Tucker, Gupta
- 1989
|
|
138
|
The Effect of Context Switches on Cache Performance
– Mogul, Borg
- 1991
|
|
137
|
The impact of operating system scheduling policies and synchronization methods of performance of parallel applications
– Gupta, Tucker, et al.
- 1991
|
|
111
|
The Interaction of Parallel and Sequential Workloads on a Network of Workstations
– Arpaci, Dusseau, et al.
- 1995
|
|
106
|
Gang Scheduling Performance Benefits for Fine-Grained Synchronization
– Feitelson, Rudolph
- 1992
|
|
101
|
Effective Distributed Scheduling of Parallel Workloads
– Dusseau, Arpaci, et al.
- 1996
|
|
44
|
Multiprogramming on Multiprocessors
– Crovella, Das, et al.
- 1991
|
|
41
|
Spinning versus blocking in parallel systems with uncertainty
– Zahorjan, Lazowska, et al.
- 1988
|
|
24
|
A comparative analysis of multiprocessor scheduling algorithms
– Lo, Gligor
- 1987
|
|
5
|
Multilevel processor-sharing queueing models for timeshared models
– Kleinrock, Muntz, et al.
- 1971
|
|
5
|
Effective scheduling in a mixed parallel and sequential computing environment, submitted to The
– Zhou, Qu, et al.
- 1997
|
|
2
|
Deitel, An Introduction to Operating Systems
– M
- 1984
|
|
1
|
A continuum of computer processor-sharing queueing models
– Kleinrock, Hsu
- 1973
|
