Skip Navigation

The Computer Journal 1993 36(2):168-176; doi:10.1093/comjnl/36.2.168
© 1993 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 (9)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Burdorf, C.
Right arrow Articles by Marti, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Load Balancing Strategies for Time Warp on Multi-User Workstations

C. Burdorf1 * and J. Marti2 §

1 School of Mathematics Sciences, University of Bath, Claverton Down, Bath, BA2 7AY, USA, 2 The RAND Corporation, Santa Monica, California, USA

This paper describes load balancing techniques for the Time Warp distributed synchronization technique for object-oriented simulation. The Time Warp system distributes objects across nodes and provides optimistic concurrency control. Our implementation is Lisp-based and executes on a network of UNIX-based workstations, where system load varies depending on the number of users and processes. This technique achieves a balanced load by first determining if the load is unbalanced. Then if it is unbalanced, the system must determine which machine is the most underloaded and migrate an object to that machine. Several object-migration techniques were attempted before arriving at a method efficient enough to make dynamic load balancing viable. We discuss a static balancing technique to start the system with a balanced load, but variance in object behavior and individual workstation load require a dynamic load monitor. Time Warp simulations executed under dynamic balancing versus static load balancing are five to 10 times faster.

Received April 1991. revised July 1992.

* School of Mathematics Sciences, University of Bath, Claverton Down, Bath, BA2 7AY, UK

§ The RAND Corporation, Santa Monica, California, USA


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.