Adaptive load sharing in homogeneous distributed systems

Rather than proposing a specific load sharing policy for implementation, the authors address the more fundamental question of the appropriate level of complexity for load sharing policies. It is shown that extremely simple adaptive load sharing policies, which collect very small amounts of system st...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on software engineering 1986-05, Vol.SE-12 (5), p.662-675
Main Authors: Eager, D. L., Lazowska, E. D., Zahorjan, J.
Format: Article
Language:English
Subjects:
Adaptation models
Adaptive systems
Analytical models
Applied sciences
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Design
Distributed processing
Exact sciences and technology
Information processing
Load modeling
load sharing
Local area networks
Probes
Program processors
queueing models
Queuing
Queuing theory
Software
threshold policies
Time factors
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Rather than proposing a specific load sharing policy for implementation, the authors address the more fundamental question of the appropriate level of complexity for load sharing policies. It is shown that extremely simple adaptive load sharing policies, which collect very small amounts of system state information and which use this information in very simple ways, yield dramatic performance improvements. These policies in fact yield performance close to that expected from more complex policies whose viability is questionable. It is concluded that simple policies offer the greatest promise in practice, because of their combination of nearly optimal performance and inherent stability.
ISSN:0098-5589
1939-3520
DOI:10.1109/TSE.1986.6312961