An Efficient Gvt Computation Using Snapshots

We describe, in this paper, a snapshot-based algorithm which makes use of distributed control. The algorithm is an extension of Mattern's snapshot algorithm and employs a leader election algorithm to pick a GVT ini-tiator. The leader election algorithm executes concurrently with the GVT algorithm. We prove the cor-rectness of the algorithm and compare its performance to several algorithms-Samadi's, Bellenot's, and Mat-tern's original algorithm. In the performance comparison , we make use of a Shuue Exchange Network and a PCS network, evaluating the simulation time, peak memory consumption, and the (control) message complexity of the algorithms. The performance of our algorithm in all three categories is far superior to Bel-lenot and Samadi's algorithms. It also provides a (less dramatic) improvement over Mattern's algorithm.

[1]  Valmir Carneiro Barbosa,et al.  An introduction to distributed algorithms , 1996 .

[2]  Victor O. K. Li,et al.  Personal communication systems (PCS) , 1995, Proc. IEEE.

[3]  B. R. Preiss.  THE YADDES DISTRIBUTED DISCRETE EVENT SIMULATION SPECIFICATION LANGUAGE AND EXECUTION ENVIRONMENTS , 1989 .

[4]  Friedemann Mattern,et al.  Efficient Algorithms for Distributed Snapshots and Global Virtual Time Approximation , 1993, J. Parallel Distributed Comput..

[5]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[6]  Ernest J. H. Chang,et al.  An improved algorithm for decentralized extrema-finding in circular configurations of processes , 1979, CACM.

[7]  LamportLeslie.  Time, clocks, and the ordering of events in a distributed system , 1978 .

[8]  Friedemann Mattern.  Message complexity of simple ring-based election algorithms-an empirical analysis , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.

[9]  Carl Tropper,et al.  Distributed channel allocation simulation , 1997 .

[10]  Carl Tropper,et al.  Clustered time warp and logic simulation , 1995, PADS.

[11]  Ten-Hwang Lai,et al.  On Distributed Snapshots , 1987, Inf. Process. Lett..

[12]  Gerard Tel,et al.  Introduction to Distributed Algorithms: Contents , 2000 .

[13]  Nicholas F. Maxemchuk,et al.  Comparison of deflection and store-and-forward techniques in the Manhattan Street and Shuffle-Exchange Networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[14]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[15]  Yi-Bing Lin,et al.  Eliminating the boundary effect of a large-scale personal communication service network simulation , 1994, TOMC.

[16]  Behrokh Samadi.  Distributed simulation, algorithms and performance analysis (load balancing, distributed processing) , 1985 .

[17]  Thomas G. Robertazzi.  Performance Evaluation and High Speed Switching Fabrics and Networks , 1993 .

[18]  Gilles-Y. Delisle.  Personal communication systems , 1997, Canadian Journal of Electrical and Computer Engineering.