Load Sharing in Soft Real-Time Distributed Computer Systems

in soft real-time distributed computer stems, a job submitted at a node in the network must complete execution within a specified time constraint, otherwise it is considered lost. When a single node occasionally experiences an overload of jobs, it may still be possible to execute some of the otherwi...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 1987-08, Vol.C-36 (8), p.993-1000
Main Authors: Kurose, James F., Chipalkatti, Renu
Format: Article
Language:English
Subjects:
Analytical models
Applied sciences
Computational modeling
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Distributed algorithms
distributed systems
Equations
Exact sciences and technology
Load modeling
load sharing
Mathematical model
performance evaluation
Real time systems
Software
Time factors
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:in soft real-time distributed computer stems, a job submitted at a node in the network must complete execution within a specified time constraint, otherwise it is considered lost. When a single node occasionally experiences an overload of jobs, it may still be possible to execute some of the otherwise lost jobs by invoking a load sharingnode algorithm to distribute the local overload to other system nodes. We examine several relatively simple approaches to load sharing and show that these simple real-time load sharing algorithms may often perform as well as their more complex counterparts. Approximate analytic performance models are developed and validated through simulation. The performance results suggest that, over a relatively wide range of system parameters, the performance of these simple approaches is substantially better than the case of no load sharing and often close to that of a theoretically optimum algorithm.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.1987.5009522