Journal ArticleDOI
Load Sharing in Distributed Systems
Yung-Terng Wang,Morris +1 more
TLDR
A taxonomy of load sharing algorithms is proposed that draws a basic dichotomy between source- initiative and server-initiative approaches and a performance metric called the Q-factor (quality of load share) is defined which summarizes both overall efficiency and fairness of an algorithm.Abstract:
An important part of a distributed system design is the choice of a load sharing or global scheduling strategy. A comprehensive literature survey on this topic is presented. We propose a taxonomy of load sharing algorithms that draws a basic dichotomy between source-initiative and server-initiative approaches. The taxonomy enables ten representative algorithms to be selected for performance evaluation. A performance metric called the Q-factor (quality of load sharing) is defined which summarizes both overall efficiency and fairness of an algorithm and allows algorithms to be ranked by performance. We then evaluate the algorithms using both mathematical and simulation techniques. The results of the study show that: i) the choice of load sharing algorithm is a critical design decision; ii) for the same level of scheduling information exchange, server-initiative has the potential of outperforming source-initiative algorithms (whether this potential is realized depends on factors such as communication overhead); iii) the Q-factor is a useful yardstick; iv) some algorithms, which have previously received little attention, e.g., multiserver cyclic service, may provide effective solutions.read more
Citations
More filters
Journal ArticleDOI
A taxonomy of scheduling in general-purpose distributed computing systems
Thomas L. Casavant,Jon G. Kuhl +1 more
TL;DR: A taxonomy of approaches to the resource management problem is presented in an attempt to provide a common terminology and classification mechanism necessary in addressing this problem.
Peer-to-Peer Computing
Dejan Milojicic,Vana Kalogeraki,Rajan Lukose,Kiran Nagaraja,Jim Pruyne,Bruno Richard,Sami Rollins,Zhichen Xu +7 more
TL;DR: This survey reviews the field of P2P systems and applications by summarizing the key concepts and giving an overview of the most important systems, and is intended for users, developers, and information technologies maintaining systems.
Journal ArticleDOI
Strategies for dynamic load balancing on highly parallel computers
TL;DR: Five DLB strategies are presented which illustrate the tradeoff between knowledge - the accuracy of each balancing decision, and overhead - the amount of added processing and communication incurred by the balancing process.
Journal ArticleDOI
Process migration
TL;DR: In this article, the authors present a survey of the field of process migration by summarizing the key concepts and giving an overview of the most important implementations, including MOSIX, Sprite, Mach, and Load Sharing Facility.
References
More filters
Journal ArticleDOI
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
TL;DR: In this article, the contract net protocol has been developed to specify problem-solving communication and control for nodes in a distributed problem solver, where task distribution is affected by a negotiation process, a discussion carried on between nodes with tasks to be executed and nodes that may be able to execute those tasks.
Book
Theory of scheduling
TL;DR: Reading theory of scheduling as one of the reading material to finish quickly to increase the knowledge and happiness in your lonely time.
Journal ArticleDOI
The Queueing Network Analyzer
TL;DR: This paper describes the Queueing Network Analyzer (QNA), a software package developed at Bell Laboratories to calculate approximate congestion measures for a network of queues and uses two parameters to characterize the arrival processes and service times.
Related Papers (5)
A taxonomy of scheduling in general-purpose distributed computing systems
Thomas L. Casavant,Jon G. Kuhl +1 more