Electrical & Computer Engineering Faculty Publications

Document Type

Article

Publication Date

4-25-2006

Abstract

In many distributed computing systems that are prone to either induced or spontaneous node failures, the number of available computing resources is dynamically changing in a random fashion. A load-balancing (LB) policy for such systems should therefore be robust, in terms of workload re-allocation and effectiveness in task completion, with respect to the random absence and re-emergence of nodes as well as random delays in the transfer of workloads among nodes. In this paper two LB policies for such computing environments are presented: The first policy takes an initial LB action to preemptively counteract the consequences of random failure and recovery of nodes. The second policy compensates for the occurrence of node failure dynamically by transferring loads only at the actual failure instants. A probabilistic model, based on the concept of regenerative processes, is presented to assess the overall performance of the system under these policies. Optimal performance of both policies is evaluated using analytical, experimental and simulation-based results. The interplay between node-failure/recovery rates and the mean load-transfer delay are highlighted.

Publisher

IEEE

Publication Title

20th International Parallel and Distributed Processing Symposium

ISSN

1-4244-0054-6

DOI

10.1109/IPDPS.2006.1639293

Language (ISO)

English

Sponsorship

IEEE

Keywords

Computational modeling, Chaos

Download

Share

COinS