Skip Navigation

The Computer Journal 1990 33(3):204-214; doi:10.1093/comjnl/33.3.204
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Gulati, S.
Right arrow Articles by Barhen, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The Pebble-Crunching Model for Fault-tolerant Load Balancing in Hyercube Ensembles

S. Gulati1,2 * §, S. S. Iyengar1 * and J. Barhen2 §

1 Department of Computer Science, Louisiana State University, Baton Rouge, LA 70803, USA, 2 Jet Propulsion Laboratory, California Institute of Technology, Pasadena, California 91109, USA

The successful development of fifth-generation systems requires enormous computational capability and flexibility, necessitating the ability to achieve operational responses in hard real-time through optimal resource utilisation and introduction of adaptive control. This necessitates dynamically balancing the computational load among all the processing nodes in the system. In this paper we propose a graph-theoretic, receiver-initiated, distributed protocol for dynamic load balancing protocol in large-scale hypercube ensembles. Using attributed hypergraphs as the primary data structure for constraint modelling and dynamic optimisation, we consider systems running precedence-constrained heterogeneous tasks. Fault Tolerance is ensured by incorporating a dynamic integrity check for the decision nodes and their subsequent re-election if needed. Simulation studies are used to analyse the algorithm performance and correctness.

Received May 1988. revised September 1988.

* Department of Computer Science, Louisiana State University, Baton Rouge, LA 70803

§ Jet Propulsion Laboratory, California Institute of Technology, Pasadena, California 91109


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.