|
ABSTRACT
We present, in this paper, an algorithm which integrates flow control and dynamic load balancing in order to improve the performance and stability of Time Warp. The algorithm is intended for use in a distributed memory environment such as a cluster of workstations connected by a high speed switch. Our flow control algorithm makes use of stochastic learning automata and operates in the fashion of the leaky-bucket flow control algorithm used in computer networks. It regulates the flow of messages between processors continuously throughout the course of the simulation, while the dynamic load balancing algorithm is invoked only when a load imbalance is detected. Both algorithms make use of a space-time product metric and collect the requisite information via a snapshot-based GVT algorithm.We compare the performance of the flow control algorithm, the dynamic load balancing algorithm and the integrated algorithm with that of a simulation without any of these controls. We simulated large shuffle ring networks with and without hot spots and a PCS network on an SGI Origin 2000 system.Our results indicate that the flow control scheme alone succeeds in greatly reducing the number and length of rollbacks as well as the number of anti-messages, thereby increasing the number of non-rolled back messages processed per second. It results in a large reduction in the amount of memory used and outperforms the dynamic load balancing algorithm for these measures. The integrated scheme produces even better results for all of these measures and results in reduced execution times as well.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
Ball, D. and Hoyt, S., "The Adaptive Time-Warp Concurrency Control Algorithm", In Proceedings of the SCS Multiconference on Distributed Simulation, volume 22, pages 174- 177, 1992.
|
| |
3
|
Burdorf, C. and Marti, J., "Load Balancing Strategies for Time Warp on Multi-User Workstations", The Computer Journal, 36(2), pages 168-176, 1993.
|
 |
4
|
|
| |
5
|
Choe, M. and Tropper, C., "An Efficient GVT Computation using Snapshots", In Proceedings of the Conference on Computer Simulation Methods and Applications, The Society for the Computer Simulation, Nov. 1998.
|
 |
6
|
|
| |
7
|
Et-Khatib, K., "Dynamic Load Balancing for Clustered Time Warp", Master's thesis, School of Computer Science, McGill University, 1997.
|
| |
8
|
|
 |
9
|
|
 |
10
|
|
| |
11
|
Lin, Y-B. and Lazowska, E., "Reducing the State Saving Overhead for Time Warp Parallel Simulation", Technical Report TR 90-02-03, Dept. of Computer Science and Engineering, University of Washington, Seattle, WA., 1990.
|
| |
12
|
Mason, L. and Gu, X., "Learning Automata Models for Adaptive Flow control in Packet-Switching Networks", In Narendra, K., editor, Adaptive and Learning Systems: Theory and Applications, pages 213-228. Plenum Press, 1986.
|
| |
13
|
Narendra, K. and Thathachar, M., "Learning Automata- A Survey", IEEE 7~ansaction on System, Man and Cybernetics, smc-4(4): 323-334, 1974.
|
 |
14
|
|
 |
15
|
Rolf Schlagenhaft , Martin Ruhwandl , Christian Sporrer , Herbert Bauer, Dynamic load balancing of a multi-cluster simulator on a network of workstations, Proceedings of the ninth workshop on Parallel and distributed simulation, p.175-180, June 13-16, 1995, Lake Placid, New York, United States
|
| |
16
|
Steinman, J., "SPEEDES: Synchronous Parallel Environment for Emulation and Discrete Event Simulation", In Proceedings of the SCS Western Simulation Multi-Conference, volume 23, pages 95-103, 1991.
|
| |
17
|
Turner, J., "New Directions in Communications (or Which Way to the Information Age?)", IEEE Communication Magazine, 24(10): 8-15, 1986.
|
| |
18
|
Turner, S. and Xu, M., "Performance Evaluation of the Bounded Time Warp Algorithm", In Proceedings of Lhe SCS Multi-conference on PADS, volume 22, pages 117-126, 1992.
|
| |
19
|
Varshavskii, V. and Vorontsova, I., "On the behaviour of stochastic automata with a variable structure", Automation and Remote Control, 24: 327-333, 1963.
|
CITED BY 5
|
|
Boon Ping Gan , Yoke Hean Low , Sanjay Jain , Stephen J. Turner , Wentong Cai , Wen Jing Hsu , Shell Ying Huang, Load balancing for conservative simulation on shared memory multiprocessor systems, Proceedings of the fourteenth workshop on Parallel and distributed simulation, p.139-146, May 28-31, 2000, Bologna, Italy
|
|
|
|
|
|
|
|
|
|
|
|
|
INDEX TERMS
Primary Classification:
F.
Theory of Computation
F.2
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
F.2.2
Nonnumerical Algorithms and Problems
Subjects:
Sequencing and scheduling
Additional Classification:
F.
Theory of Computation
F.1
COMPUTATION BY ABSTRACT DEVICES
F.1.1
Models of Computation
Subjects:
Automata (e.g., finite, push-down, resource-bounded)
G.
Mathematics of Computing
G.2
DISCRETE MATHEMATICS
G.2.2
Graph Theory
Subjects:
Network problems
G.3
PROBABILITY AND STATISTICS
Subjects:
Stochastic processes
General Terms:
Algorithms,
Experimentation,
Performance,
Reliability
Keywords:
Time Warp,
GVT,
stochastic learning automata,
stability,
space-time product,
flow control,
dynamic load balancing.
|