## A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems (1988)

### Cached

### Download Links

- [www.cs.umanitoba.ca]
- [www.cs.virginia.edu]
- [www.cs.virginia.edu]
- [www.eng.uiowa.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | IEEE Transactions on Software Engineering |

Citations: | 250 - 0 self |

### BibTeX

@ARTICLE{Casavant88ataxonomy,

author = {Thomas L. Casavant and Jon and G. Kuhl},

title = {A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems},

journal = {IEEE Transactions on Software Engineering},

year = {1988},

volume = {14},

pages = {141--154}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract-One measure of usefulness of a general-purpose distrib-uted computing system is the system’s ability to provide a level of per-formance commensurate to the degree of multiplicity of resources pres-ent in the system. Many different approaches and metrics of performance have been proposed in an attempt to achieve this goal in existing systems. In addition, analogous problem formulations exist in other fields such as control theory, operations research, and produc-tion management. However, due to the wide variety of approaches to this problem, it is difficult to meaningfully compare different systems since there is no uniform means for qualitatively or quantitatively eval-uating them. It is difficult to successfully build upon existing work or identify areas worthy of additional effort without some understanding of the relationships between past efforts. In this paper, a taxonomy of approaches to the resource management problem is presented in an attempt to provide a common terminology and classification mecha-nism necessary in addressing this problem. The taxonomy, while pre-sented and discussed in terms of distributed scheduling, is also appli-cable to most types of resource management. As an illustration of the usefulness of the taxonomy an annotated bibliography is given which classifies a large number of distributed scheduling approaches accord-ing to the taxonomy. Index Terms-Distributed operating systems, distributed resource management, general-purpose distributed computing systems, sched-uling, task allocation, taxonomy. T I.

### Citations

1067 |
Computation Networks
- Tanenbaum
- 1989
(Show Context)
Citation Context ...system are homogeneous since this allows all nodes to know a great deal about the structure of the other nodes. Normally, information would be passed about the network periodically or on demand [ 11, =-=[60]-=- in order to allow all nodes to obtain a local estimate concerning the global state of the system. Then the nodes act together in order to remove work from heavily loaded nodes and place it at lightly... |

1003 |
The contract net protocol: high-level communication and control in a distributed problem solver
- Smith
- 1980
(Show Context)
Citation Context ...sks) so that an assignment of tasks to processors can be made which is beneficial to all nodes in the system as a whole. To illustrate the basic mechanism of bidding, the framework and terminology of =-=[49]-=- will be used. Each node in the network is responsible for two roles with respect to the bidding process: manager and contractor. The manager represents the task in need of a location to execute, and ... |

558 | Principles of Artificial Intelligence - Nilsson - 1980 |

204 | Theory of Scheduling - Conway, Maxwell, et al. - 1967 |

188 |
Operating Systems Theory
- Coffman, Denning
- 1973
(Show Context)
Citation Context ..., no. 5, pp. 354-361, May 1979. Global, dynamic, physically distributed, cooperative, suboptimal, heuristic, load-balancing, (part of the heuristic approach is based on results from queueing theory). =-=[12]-=- W. W. Chu et al., “Task allocation in distributed data processing,” Computer, vol. 13, no. 11, pp. 57-69, Nov. 1980. Global, static, optimal, suboptimal, heuristic, heuristic approached based on grap... |

147 |
Very high-speed computing systems
- Flynn
- 1966
(Show Context)
Citation Context ...s describing the same general mechanism, but described from different viewpoints. A. The Classijication Scheme The usefulness of the four-category taxonomy of computer architecture presented by Flynn =-=[20]-=- has been well demonstrated by the ability to compare systems through their relation to that taxonomy. The goal of the taxonomy given here is to provide a commonly accepted set of terms and to provide... |

124 |
Load Sharing in Distributed Systems
- WANG, MORRIS
- 1985
(Show Context)
Citation Context ...ailed and complete look at the basic issues addressed in that work. Such detail is deemed necessary to allow meaningful comparisons of different approaches. In contrast to the taxonomy of Casey, Wang =-=[65]-=- provides a taxonomy of load-sharing schemes. Wang’s taxonomy succinctly describes the range of approaches to the load-sharing problem. The categorization presented describes solutions as being either... |

121 |
Allocating independent subtasks on parallel processors
- Kruskal, Weiss
- 1985
(Show Context)
Citation Context ...cation algorithms which can be used to arrive at an assignment of processes to processors. 1) Solution Space Enumeration and Search[48].s- 9 - 2) Graph Theoretic[4, 57, 58].3) Mathematical Programming=-=[5, 14, 21, 35, 40]-=-. 4) Queuing Theoretic[10, 28, 29]. Dynamic Solutions In the dynamic scheduling problem, the more realistic assumption is made that very little a priori knowledgesissavailablesaboutsthesresourcesneeds... |

120 |
Heuristic algorithms for task assignment in distributed systems
- Lo
- 1988
(Show Context)
Citation Context ...etion time, maximizing utilization of resources in the system, or maximizing system throughput. In the event that these problems are computationally infeasible, suboptimal solutions may be tried [2], =-=[34]-=-, [47]. Within the realm of suboptimal solutions to the scheduling problem, we may think of two general categories. d) Approximate Versus Heuristic: The first is to use the same formal computational m... |

65 |
Queuing Systems” Vol. 2: Computer Applications
- Kleinrock
- 1975
(Show Context)
Citation Context ...nt of processes to processors. 1) Solution space enumeration and search [48]. 2) Graph theoretic [4], [57], [58]. 3) Mathematical programming [5], [ 141, [21], [35], [401. 4) Queueing theoretic [lo], =-=[28]-=-, [29]. f) Dynamic Solutions: In the dynamic scheduling problem, the more realistic assumption is made that very little a priori knowledge is available about the resource needs of a process. It is als... |

61 |
A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minmax Criterion
- Shen, Tsai
- 1985
(Show Context)
Citation Context ...sComputers,sVol.sC-31,sNo.s1,sJan.s1982, pp. 41-47. [36]sR. Manner, Hardware Task/ProcessorsSchedulingsinsasPolyprocessorsEnviron-ment, IEEE Trans. on Comp., Vol. C-33, No. 7, Jul. 1984, pp. 626-636. =-=[37]-=-sP.L. McEntire, J.G. O'Reilly, R.E. Larson, Distributed Computing: Concepts andImplementations, 1984, IEEE Press, New York. [38]sE. Mishkin,sL.sBraunsJr., AdaptivesControlsSystems, 1961,sMcGraw-Hill,s... |

53 |
Team decision theory and information structures
- Ho
- 1980
(Show Context)
Citation Context ...osing to allow a good solution to get into the randomly chosen set. An alternative view of probabilistic schedulers are those which employ the principles of decision theory in the form of team theory =-=[24]-=-. These would be classified as probabilistic since suboptimal decisions are influenced by prior probabilities derived from best-guesses to the actual states of nature. In addition, these prior probabi... |

51 |
A Shortest Tree Algorithm for Optimal Assignment Across Space and Time
- Bokhari
- 1981
(Show Context)
Citation Context ...cation algorithms which can be used to arrive at an assignment of processes to processors. 1) Solution Space Enumeration and Search[48].s- 9 - 2) Graph Theoretic[4, 57, 58].3) Mathematical Programming=-=[5, 14, 21, 35, 40]-=-. 4) Queuing Theoretic[10, 28, 29]. Dynamic Solutions In the dynamic scheduling problem, the more realistic assumption is made that very little a priori knowledgesissavailablesaboutsthesresourcesneeds... |

50 |
Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System
- CHOW, KOHLER
- 1979
(Show Context)
Citation Context ...chsalways weighs its inputs in the same way regardless of the history of the system's behavior. 2.1.2.2.sLoad Balancing Thisscategorysofspolicies,swhichshassreceived a greatsdealsofsattentionsrecently=-=[10, 11, 36, 40, 41, 42, 46, 53]-=-, approaches the problem with the philosophy that being fair to the hardware resources of the system is good for the users of that system. The basic idea isstosattemptstosbalance(inssomessense)stheslo... |

50 |
Heuristic Models of Task Assignment Scheduling in Distributed Systems
- EFE
- 1982
(Show Context)
Citation Context ...ng to some metric the value of an optimal solution. 4) Availability of a mechanism for intelligently pruning the solution space. The second branch beneath the suboptimal category isslabeled heuristic =-=[15]-=-, [30], [66]. This branch represents the category of static algorithms which make the most realistic assumptions about a priori knowledge concerning process and system loading characteristics. It also... |

47 |
Dynamic task scheduling in distributed hard real-time system
- Ramamritham, Stankovic
- 1984
(Show Context)
Citation Context ...dsgroups seemed to have had little impact on the overall performance of the system. The final example to be discussed here[55] is based on a heuristic derived from the area of Bayesian decision theory=-=[33]-=-. The algorithm uses no a priori knowledge regardingstaskscharacteristics,sandsissdynamicsinsthessensesthatsthesprobabilitysdistributions whichsallow maximizing decisionsstosbesmadesbasedson thesmosts... |

44 |
Task allocation in fault-tolerant distributed systems
- Bannister, Trivedi
- 1983
(Show Context)
Citation Context ...onsofssystemsresources,sthe approach in this paper is consumer oriented. An interesting approximate mathematical programming solution, motivated from the viewpoint of fault-tolerance, is presented in =-=[2]-=-. The algorithm is suggested by the computational complexity of the optimal solution to the same problem. In the basic solution to a mathematical programming problem, the state space is either implici... |

42 |
A Task Allocation Model for Distributed Computing Systems
- MA, E
- 1982
(Show Context)
Citation Context ...oosing to allow a good solution to get into the randomly chosen set. Ansalternative view of probabilisticsschedulerssaresthoseswhichsemploy thesprinciplessofsdecisionstheorysinsthesformsofsteamstheory=-=[24]-=-. Theseswouldsbesclassifiedsas probabilisticssincessub-optimalsdecisionssaresinfluencedsbyspriorsprobabilitiessderived from best-guesses to the actual states of nature. In addition, these prior probab... |

41 |
Load Balancing in Distributed Systems
- CHOU, A
- 1982
(Show Context)
Citation Context ...signment of processes to processors. 1) Solution space enumeration and search [48]. 2) Graph theoretic [4], [57], [58]. 3) Mathematical programming [5], [ 141, [21], [35], [401. 4) Queueing theoretic =-=[lo]-=-, [28], [29]. f) Dynamic Solutions: In the dynamic scheduling problem, the more realistic assumption is made that very little a priori knowledge is available about the resource needs of a process. It ... |

40 |
On mapping parallel algorithms into parallel architectures
- Berman, Snyder
- 1987
(Show Context)
Citation Context ... Eng., Vol. SE-8, No. 1, Jan. 1982, pp. 76-81. [2]sJ.A. Bannister, K.S.sTrivedi, TasksAllocationsinsFault-TolerantsDistributedsSys-tems, Acta Informatica, Vol. 20, 1983, pp. 261-281, Springer-Verlag. =-=[3]-=-sJ.F. Bartlett, A NonStopsKernel, Proc.s8thsSymp.sonsO.S.sPrinciples,sDec.s1981,pp. 22-29. [4]sS.H. Bokhari, DualsProcessorsSchedulingswithsDynamicsReassignment, IEEETrans. on Software Eng., Vol. SE-5... |

37 |
A Stable Distributed Scheduling Algorithm
- Bryant, Finkel
- 1981
(Show Context)
Citation Context ...ually automatically balanced as a side effect of heavy loading. The remainder of the paper focuses on simulation results to reveal the impact of modifying the biasing parameters. The work reported in =-=[6]-=- is an example of an algorithm which employs the heuristic of load-balancing, and probabilistically estimates the remaining processing times of processes in the system. The remaining processing time f... |

37 |
Deterministic processor scheduling
- Gonzalez
(Show Context)
Citation Context ...xisting systems. II. THE SCHEDULING PROBLEM AND DESCRIBING ITS SOLUTIONS The general scheduling problem has been described a number of times and in a number of different ways in the literature [ 121, =-=[22]-=-, [63] and is usually a restatement of the classical notions of job sequencing [ 131 in the study of production management [7]. For the purposes of distributed process scheduling, we take a broader vi... |

35 |
Medusa - An Experiment in Distributed Operating System Structure
- Ousterhout, Scelza, et al.
- 1980
(Show Context)
Citation Context ...rive at an assignment of processes to processors. 1) Solution Space Enumeration and Search[48].s- 9 - 2) Graph Theoretic[4, 57, 58].3) Mathematical Programming[5, 14, 21, 35, 40]. 4) Queuing Theoretic=-=[10, 28, 29]-=-. Dynamic Solutions In the dynamic scheduling problem, the more realistic assumption is made that very little a priori knowledgesissavailablesaboutsthesresourcesneedssofsasprocess. Itsissalso unknowns... |

32 |
Stability and Distributed Scheduling Algorithms
- Stankovic
- 1985
(Show Context)
Citation Context ...assignments are then transformed to a type of graph matching known as weak homomorphisms.sThe optimalssearchsofsthisssolutionsspacescansthensbesdonesusingsthe A* algorithm from artificial intelligence=-=[43]-=-. The solution also achieves a certain degree of processor load balancing as well. [4] gives a good demonstration of the usefulness of the taxonomy in that the paper describessthesalgorithmsgiven as a... |

31 |
Simulation of the three Adaptive Decentralized Controlled Job Scheduling algorithms. Computer Networks
- STANKOVIC
- 1984
(Show Context)
Citation Context ...chsalways weighs its inputs in the same way regardless of the history of the system's behavior. 2.1.2.2.sLoad Balancing Thisscategorysofspolicies,swhichshassreceived a greatsdealsofsattentionsrecently=-=[10, 11, 36, 40, 41, 42, 46, 53]-=-, approaches the problem with the philosophy that being fair to the hardware resources of the system is good for the users of that system. The basic idea isstosattemptstosbalance(inssomessense)stheslo... |

26 |
An application of bayesian decision theory to decentralized control of job sceduling
- Stankovic
- 1985
(Show Context)
Citation Context ...chsalways weighs its inputs in the same way regardless of the history of the system's behavior. 2.1.2.2.sLoad Balancing Thisscategorysofspolicies,swhichshassreceived a greatsdealsofsattentionsrecently=-=[10, 11, 36, 40, 41, 42, 46, 53]-=-, approaches the problem with the philosophy that being fair to the hardware resources of the system is good for the users of that system. The basic idea isstosattemptstosbalance(inssomessense)stheslo... |

26 |
Critical Load Factors in TwoProcessor Distributed Systems
- STONE
- 1978
(Show Context)
Citation Context ... assignment decisions are made. In the case of static scheduling, information regarding the total mix of processes in the system as well as all the independent subtasks involved in a job or task force=-=[26, 44]-=-s- 7 - issassumedstosbesavailablesbysthestimesthesprogramsobjectsmodulessareslinkedsintosload modules.sHence, each executable image in a system has a static assignment to a particular processor, and e... |

26 |
Learning automata--a survey
- Narendra, Thathachar
- 1974
(Show Context)
Citation Context ...observed. A second exCASAVANT AND KUHL: TAXONOMY OF SCHEDULING IN DISTRIBUTED COMPUTING SYSTEMS 145 ample of adaptive scheduling would be one which is based on the stochastic learning automata model =-=[39]-=-. An analogy may be drawn here between the notion of an adaptive scheduler and adaptive control [38], although the usefulness of such an analogy for purposes of performance analysis and implementation... |

23 |
Control of distributed processes
- Stone, Bokhari
- 1978
(Show Context)
Citation Context ...ur basic categories of task allocation algorithms which can be used to arrive at an assignment of processes to processors. 1) Solution space enumeration and search [48]. 2) Graph theoretic [4], [57], =-=[58]-=-. 3) Mathematical programming [5], [ 141, [21], [35], [401. 4) Queueing theoretic [lo], [28], [29]. f) Dynamic Solutions: In the dynamic scheduling problem, the more realistic assumption is made that ... |

21 |
An adaptive bidding algorithm for processes, clusters and distributed groups
- Stankovic, Sidhu
- 1984
(Show Context)
Citation Context ...h simpler to monitor or calculate. For example, clustering groups of processes which communicate heavily on the same processor and physically separating processes which would benefit from parallelism =-=[52]-=- directly decreases the overhead involved in passing information between processors, while reducing the interference among processes which may run without synchronization with one another. This result... |

18 |
Dual Processor Scheduling with Dynamic Reassignment
- BOKHARI
- 1979
(Show Context)
Citation Context ... are four basic categories of task allocation algorithms which can be used to arrive at an assignment of processes to processors. 1) Solution Space Enumeration and Search[48].s- 9 - 2) Graph Theoretic=-=[4, 57, 58]-=-.3) Mathematical Programming[5, 14, 21, 35, 40]. 4) Queuing Theoretic[10, 28, 29]. Dynamic Solutions In the dynamic scheduling problem, the more realistic assumption is made that very little a priori ... |

17 | The Roscoe Distributed Operating System - Finkel, A - 1979 |

16 |
Load Redistribution under Failure in Distributed Systems
- CHOU, A
- 1983
(Show Context)
Citation Context ...rive at an assignment of processes to processors. 1) Solution Space Enumeration and Search[48].s- 9 - 2) Graph Theoretic[4, 57, 58].3) Mathematical Programming[5, 14, 21, 35, 40]. 4) Queuing Theoretic=-=[10, 28, 29]-=-. Dynamic Solutions In the dynamic scheduling problem, the more realistic assumption is made that very little a priori knowledgesissavailablesaboutsthesresourcesneedssofsasprocess. Itsissalso unknowns... |

15 | Process migration - Powell, Miller - 1983 |

13 |
Software allocation models for distributed computing systems
- Price, Krishnaprasad
- 1984
(Show Context)
Citation Context ...l. 28, No. 3, Jul. 1981, pp. 477-486. [30]sC.P. Kruskal,sA.sWeiss, AllocatingsIndependentsSubtaskssonsParallelsProcessorsExtended Abstract, 1984 Intl. Conf. on Parallel Proc., Aug. 1984, pp. 236-240. =-=[31]-=-sR.E. Larsen, Tutorial: Distributed Control, 1979, IEEE Press, New York. [32]sG. LesLann, Motivations,sObjectivessandsCharacterizationssofsDistributedsSys-tems, Lecture Notes in Computer Science - 105... |

12 |
Optimal linear schedules for the parallel execution of algoeithms
- Fortes, Parisi-Presicce
- 1984
(Show Context)
Citation Context ...ing to some metric the value of an optimal solution.4) Availability of a mechanism for intelligently pruning the solution space. The second branch beneath the sub-optimal category is labeled heuristic=-=[15, 30, 66]-=-. Thissbranchsrepresentssthescategorysofsstaticsalgorithmsswhichsmake thesmostsrealistic assumptions about a priori knowledge concerning process and system loading characteristics.sIt also represents ... |

10 |
Audio Systems
- Bernstein
- 1966
(Show Context)
Citation Context ...en local and global scheduling. Local scheduling is involved with the assignment of processes to the time-slices of a single processor. Since the area of scheduling on single-processor systems [ 121, =-=[62]-=- as well as the area of sequencing or job-shop scheduling [ 131, [ 181 has been actively studied for a number of years, this taxonomy will focus on global scheduling. Global scheduling is the problem ... |

9 |
Dynamic Load Balancing Algorithms
- Hsu, Liu
- 1986
(Show Context)
Citation Context ...ynamic scheduling should physically reside in a single processor[44] (physically non-distributed) or whether the work involved in making decisions should be physicallysdistributed amongsthesprocessors=-=[17]-=-. Heresthesconcernesisswithstheslogical authority of the decision-making process. Cooperative vs. Non-Cooperative Within the realm of distributed dynamic global scheduling, we may also distinguish bet... |

7 |
Heuristic Models of Task Assignment Scheduling
- Efe
- 1982
(Show Context)
Citation Context ...cation algorithms which can be used to arrive at an assignment of processes to processors. 1) Solution Space Enumeration and Search[48].s- 9 - 2) Graph Theoretic[4, 57, 58].3) Mathematical Programming=-=[5, 14, 21, 35, 40]-=-. 4) Queuing Theoretic[10, 28, 29]. Dynamic Solutions In the dynamic scheduling problem, the more realistic assumption is made that very little a priori knowledgesissavailablesaboutsthesresourcesneeds... |

7 |
The Analysis of a Decentralized Control Algorithm for Job Scheduling Utilizing Bayesian Decision Theory
- Stankovic
(Show Context)
Citation Context ... example of adaptive scheduling would be one which is based on the stochastic learning automata model[39]. An analogy may be drawn here between the notion of an adaptive scheduler and adaptive control=-=[38]-=-, although the usefulness of such an analogy for purposes of performance analysis and implementation are questionable[51].sIn contraststosansadaptive scheduler, a non-adaptive schedulerswouldsbesone w... |

6 |
Optimal object allocation in distributed computer systems
- GABRIELIAN, TYLER
- 1984
(Show Context)
Citation Context ...ionsinsasDistributedsCom-puter System, IEEE InfoCom, 1982, pp. 33-38. [15]sK. Efe, HeuristicsModelssofsTasksAssignmentsSchedulingsinsDistributedsSystemsComputer, Vol. 15, Jun. 1982, pp. 50-56.s- 27 - =-=[16]-=-sC.S. Ellis, J.A. Feldman, J.E. Heliotis, Language Constructs and Support Systemsfor Distributed Computing, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Aug. 1982, pp. 1-9. [17]... |

6 |
Parallelized process scheduling for a tightly-coupled MIMD machine
- Klappholz, Park
- 1984
(Show Context)
Citation Context ... describing the same general mechanism, but described from different viewpoints. 2.1.sThe Classification Scheme The usefulness of the four-category taxonomy of computer architecture presented by Flynn=-=[20]-=-shassbeenswellsdemonstratedsbysthesabilitystoscomparessystemssthroughstheir relation to that taxonomy. The goal of the taxonomy given here is to provide a commonly acceptedssetsofstermssandstosprovide... |

6 |
Heliotis .. 'Language Constructs and Support Systems for Distributed Computing
- Feldman, E
(Show Context)
Citation Context ...anagement, general-purpose distributed computing systems, scheduling, task allocation, taxonomy. T I. INTRODUCTION HE study of distributed computing clude a large range of applications has grown to in=-=[16]-=-, [17], [31], [32], [37], [54], [%I. However, at the core of all the efforts to exploit the potential power of distributed computation are issues related to the management and allocation of system res... |

6 | On optimal scheduling algorithms for time-shared systems
- Kleinrock, Nilsson
- 1981
(Show Context)
Citation Context ...processes to processors. 1) Solution space enumeration and search [48]. 2) Graph theoretic [4], [57], [58]. 3) Mathematical programming [5], [ 141, [21], [35], [401. 4) Queueing theoretic [lo], [28], =-=[29]-=-. f) Dynamic Solutions: In the dynamic scheduling problem, the more realistic assumption is made that very little a priori knowledge is available about the resource needs of a process. It is also unkn... |

5 |
Nonpreemptive load balancing in a class of local area networks
- Ni, Abani
- 1981
(Show Context)
Citation Context ...rive at an assignment of processes to processors. 1) Solution Space Enumeration and Search[48].s- 9 - 2) Graph Theoretic[4, 57, 58].3) Mathematical Programming[5, 14, 21, 35, 40]. 4) Queuing Theoretic=-=[10, 28, 29]-=-. Dynamic Solutions In the dynamic scheduling problem, the more realistic assumption is made that very little a priori knowledgesissavailablesaboutsthesresourcesneedssofsasprocess. Itsissalso unknowns... |

5 |
Enslow Jr. What is a “distributed” data processing system? Computer
- H
- 1978
(Show Context)
Citation Context ...ent, general-purpose distributed computing systems, scheduling, task allocation, taxonomy. T I. INTRODUCTION HE study of distributed computing clude a large range of applications has grown to in[16], =-=[17]-=-, [31], [32], [37], [54], [%I. However, at the core of all the efforts to exploit the potential power of distributed computation are issues related to the management and allocation of system resources... |

5 |
Adaptive Control Systems
- MISHKIN, BRAUN
- 1961
(Show Context)
Citation Context ... ample of adaptive scheduling would be one which is based on the stochastic learning automata model [39]. An analogy may be drawn here between the notion of an adaptive scheduler and adaptive control =-=[38]-=-, although the usefulness of such an analogy for purposes of performance analysis and implementation are questionable [5 11. In contrast to an adaptive scheduler, a nonadaptive scheduler would be one ... |

4 |
Design of a loosely-coupled distributed multiprocessing network
- Casavant, Kuhl
- 1984
(Show Context)
Citation Context ...ibedsasnumbersofstimessandsinsa number of different ways in the literature[12, 22, 63] and is usually a restatement of the classicalsnotionssofsjobssequencing[13]sinsthesstudysofsproductionsmanagement=-=[7]-=-. For the purposes of distributed process scheduling, we take a broader view of the scheduling functionsassa resourcesmanagementsresource. Thissmanagementsresourcesissbasicallysa mechanism or policy u... |

4 |
Real time resource allocation in distributed systems
- Reif, Spirakis
- 1982
(Show Context)
Citation Context ...sCharacterizationssofsDistributedsSys-tems, Lecture Notes in Computer Science - 105, 1981, pp. 1-9, Springer-Verlag.s- 28 - [33]sB.W. Lindgren, Elements of Decision Theory, 1971, MacMillan, New York. =-=[34]-=-sV.M. Lo, Heuristic Algorithms for Task Assignment in Distributed Systems, Proc.4th Intl. Conf. on Dist. Comp. Systems, May 1984, pp. 30-39. [35]sP.Y.R. Ma, E.Y.S. Lee, J. Tsuchiya, A Task Allocation ... |

4 |
Scheduling multipipeline and multiprocessor computers
- Sahni
- 1984
(Show Context)
Citation Context |