Abstract
The Time Wrap algorithm [3] offers a run time recovery mechanism that deals with the causality errors. These run time recovery mechanisms consists of rollback, anti-message, and Global Virtual Time (GVT) techniques. For rollback, there is a need to compute GVT which is used in discrete-event simulation to reclaim the memory, commit the output, detect the termination, and handle the errors. However, the computation of GVT requires dealing with transient message problem and the simultaneous reporting problem. These problems can be dealt in an efficient manner by the Samadi’s algorithm [8] which works fine in the presence of causality errors. However, the performance of both Time Wrap and Samadi’s algorithms depends on the latency involve in GVT computation. Both algorithms give poor latency for large simulation systems especially in the presence of causality errors. To improve the latency and reduce the processor ideal time, we implement tree and butterflies barriers with the optimistic algorithm. Our analysis shows that the use of synchronous barriers such as tree and butterfly with the optimistic algorithm not only minimizes the GVT latency but also minimizes the processor idle time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Bauer, G. Yaun, C. Carothers, S. Kalyanaraman, “Seven-O’ Clock: A new Distributed GVT Algorithm using Network Atomic Operations,” 19th Workshop on Principles of Advanced and Distributed Simulation (PADS’05), PP 39-48, 2005.
[2] F. Mattern, H. Mehl, A. Schoone, Tel, G. Global Virtual Time Approximation with Distributed Termination Detection Algorithms. Tech. Rep. RUU-CS-91-32, Department of Computer Science, University of Utrecht, The Netherlands, 1991.
[3] F. Mattern. Efficient algorithms for distributed snapshots and global virtual time approximations. Journal of Parallel and Distributed Computing, 18:423–434, 1993
R. Fujimoto, “Distributed Simulation system,” proceeding of the 2003 winter simulation conference. College of Computing, Georgia Institute of Technology, Atlanta.
[5] S. Rizvi, K. Elleithy, and A. Riasat, “Trees and Butterflies Barriers in Mattern’s GVT: A Better Approach to Improve the Latency and the Processor Idle Time for Wide Range Parallel and Distributed Systems”, IEEE International Conference on Information and Emerging Technologies (ICIET-2007), July 06-07, 2007, Karachi, Pakistan.
F. Mattern, “Efficient Algorithms for Distributed Snapshots and Global virtual Time Approximation,” Journal of Parallel and Distributed Computing, Vol.18, No.4, 1993.
[7] R. Fujimoto, Parallel discrete event simulation, Communications of the ACM, v.33 n.10, p.30-53, Oct. 1990.
B. Samadi, Distributed simulation, algorithms and performance analysis (load balancing, distributed processing), Computer Science Department, PhD Thesis, University of California, Los Angeles, 1985.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media B.V.
About this paper
Cite this paper
Rizvi, S.S., Shah, D., Riasat, A. (2010). Implementation of Tree and Butterfly Barriers with Optimistic Time Management Algorithms for Discrete Event Simulation. In: Elleithy, K. (eds) Advanced Techniques in Computing Sciences and Software Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-3660-5_78
Download citation
DOI: https://doi.org/10.1007/978-90-481-3660-5_78
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-3659-9
Online ISBN: 978-90-481-3660-5
eBook Packages: Computer ScienceComputer Science (R0)