This chapter discusses CPU scheduling in parallel and distributed systems. CPU scheduling is part of a broader class of resource allocation problems, and is probably the most carefully studied such problem. The main motivation for multiprocessor scheduling is the desire for increased speed in the execution of a workload. Parts of the workload, called tasks, can be spread across several
|
425
|
The Network Weather Service: A Distributed Resource Performance Forecasting Service for Metacomputing
– Wolski, Spring, et al.
- 1998
|
|
195
|
A Taxonomy of Scheduling in General-purpose Distributed Computing Systems
– Casavant, Kuhl
- 1988
|
|
144
|
Utopia: A load sharing facility for large, heterogeneous distributed computing systems
– Zhou, Wang, et al.
- 1992
|
|
138
|
TheAppLeS Parameter Sweep Template: User-Level Middleware for the Grid
– Casanova, Obertelli, et al.
|
|
131
|
A Distributed Resource Management Architecture that Supports Advance Reservations and Co-Allocation
– Foster, Kesselman, et al.
- 1999
|
|
122
|
Multiprocessor Scheduling with the aid of Network Flow Algorithms
– Stone
- 1977
|
|
101
|
Legion: The next logical step toward a nationwide virtual computer
– Grimshaw, Wulf, et al.
- 1994
|
|
97
|
Heuristic Algorithms for task assignment in distributed systems
– Lo
- 1988
|
|
94
|
Using Idle Workstations in a Shared Computing Environment
– Nichols
- 1987
|
|
92
|
Stochastic scheduling
– Schopf, Berman
- 1999
|
|
88
|
Condor Technical Summary
– Bricker, Litzkow, et al.
- 1991
|
|
83
|
Finding Idle Machines in A Workstation-Based Distributed System
– Theimer, Lantz
- 1989
|
|
67
|
The Legion Resource Management System
– Chaplin, Karpovich, et al.
- 1999
|
|
66
|
Remote unix - turning idle workstations into cycle servers
– Litzkow
- 1987
|
|
57
|
A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach
– Hochbaum, Shmoys
- 1988
|
|
39
|
SUNMOS for the Intel Paragon: A brief user’s guide
– Maccabe, McCurley, et al.
- 1994
|
|
38
|
Simulation of Three Adaptive, Decentralized Controlled, Job Scheduling Algorithms
– Stankovic
- 1984
|
|
34
|
A stable distributed scheduling algorithm
– Bryant, Finkel
- 1981
|
|
31
|
Stability and distributed scheduling algorithms
– Stankovic
- 1985
|
|
30
|
Application Level Scheduling of Gene Sequence Comparison on Metacomputers
– Wolski, Spring
- 1998
|
|
30
|
The design and implementation of a decentralized scheduling facility for a workstation cluster
– Stumm
- 1988
|
|
29
|
ªPuma: An Operating System for Massively Parallel Systems,º Proc. 27th Hawaii Int'l Conf
– Wheat, Riesen, et al.
- 1994
|
|
24
|
The Greedy Load Sharing Algorithm
– Chowdhury
- 1990
|
|
22
|
Support for Implementing Scheduling Algorithms Using MESSIAHS
– Chapin, Spafford
- 1994
|
|
22
|
An adaptive bidding algorithm for processes, clusters and distributed groups
– Stankovic, Sidhu
- 1984
|
|
21
|
Load Balancing Algorithms in Homogeneous Distributed Systems
– Gao, Liu, et al.
- 1984
|
|
17
|
A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems
– Casevant, Kuhl
- 1988
|
|
17
|
A Distributed Batching System for Parallel Processing
– Gantz, Silverman, et al.
- 1989
|
|
16
|
Scheduling Support Mechanisms for Autonomous, Heterogeneous, Distributed Systems
– Chapin
- 1993
|
|
14
|
Assignment of Independent Tasks to Minimize Completion Time
– Blake
- 1992
|
|
14
|
Adding rescheduling to and integrating Condor with Smartnet
– Hensgen, Moore, et al.
- 1995
|
|
12
|
Load redistribution under failure in distributed systems
– Chou, Abraham
- 1983
|
|
11
|
Scheduling of Precedence-Constrained Tasks on Multiprocessors
– Price, Salama
- 1990
|
|
11
|
Using AppLeS to schedule simple
– Su, Berman, et al.
- 1999
|
|
9
|
Wave scheduling— decentralized scheduling of task forces in multicomputers
– Tilborg, Wittie
- 1984
|
|
9
|
Prophet: Automated scheduling of SPMD programs in workstation networks
– Weissman
- 1999
|
|
8
|
Minimization of task turnaround time for distributed systems
– Hsu, Wang, et al.
- 1989
|
|
7
|
An Efficient Model of Dynamic Task Scheduling for Distributed Systems
– Ghafoor, Ahmad
- 1990
|
|
7
|
A Close Look at Task Assignment in Distributed Systems
– Ramakrishnan, Cho, et al.
- 1991
|
|
7
|
DRUMS: A Distributed Statistical Server for STARS
– Bond, Hine
- 1991
|
|
6
|
Distributed allocation with pools of servers
– Andrews, Dobkin, et al.
- 1982
|
|
6
|
Parallelized process scheduling for a tightly-coupled MIMD machine
– Klappholz, Park
- 1984
|
|
6
|
An Operating System for Massively Parallel Systems
– Puma
|
|
5
|
Decentralised Scheduling
– Casey
- 1981
|
|
5
|
Nonpreemptive load balancing in a class of local area networks
– Ni, Abani
- 1981
|
|
4
|
Design of a loosely-coupled distributed multiprocessing network
– Casavant, Kuhl
- 1984
|
|
4
|
The Design of the Schizophrenic Workstation System
– Swanson, Stoller, et al.
- 1993
|
|
3
|
Real time resrouce allocation in distributed systems
– Reif, Spirakis
- 1982
|
|
3
|
The benefits of wide-area computing for parallel processing
– Gallop
- 1998
|
|
1
|
On Processor Allocation in Hypercube Systems
– Huang, Huang, et al.
- 1989
|
