By Topic

Load Sharing in Soft Real-Time Distributed Computer Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kurose, J.F. ; Department of Computer and Information Science, University of Massachusetts, Amherst, MA 01003. ; Chipalkatti, Renu

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.

Published in:

Computers, IEEE Transactions on  (Volume:C-36 ,  Issue: 8 )