Abstract
In this paper we introduce a new conservative and non blocking algorithm for discrete event simulation on parallel computers with distributed memory. The new approach, called critical process first (CPF) algorithm, is especially well suited for simulating complex VLSI designs consisting of many logical processes. The algorithm avoids deadlocks by repeatedly sending lookahead information about critical processes to other computation nodes. Processes are called critical if they may directly influence processes of another computation node. To hide the communication latency of the parallel computer the CPF method gives priority to the execution of events which may affect critical processes. Simulation results show the superiority of the CPF algorithm over approaches without priority handling.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Ayani and H. Rajaei, Parallel Simulation Based on Conservative Time Windows: a Performance Study, Concurrency: Practice and Experience, vol. 6(2), pp. 119–142, April 1994
L.J. Barriga, A Enhanced Parallel Simulation Algorithm Based on Distances between Threaded Objects, Fourth Swedish Workshop on Computer System Architecture (DSA-92) Linköping, January 1992
K.M. Chandy and J. Misra, Asynchronous Distributed Simulation via a Sequence of Parallel Computations, Communications of the ACM, vol. 24, no.11, pp. 198–206, April 1981
R.M. Fujimoto, Parallel Discrete Event Simulation, Communication of the ACM, vol. 33, no.10, pp. 30–53, October 1990
D.R. Jefferson, Virtual Time, ACM Transaction on Programming Languages and Systems, vol. 7, no.3, pp. 404–425, July 1985
B.D. Lubachevsky, Efficient Distributed Event-Driven Simulations of Multiple-Loop Networks, Communication of the ACM, vol. 32, no.1, pp. 111–123, January 1989
J. Misra, Distributed Discrete-Event Simulation, Computing Surveys, vol. 18, no.1, pp. 39–65, March 1986
D. Nicol, Parallel Discrete-Event Simulation of FCFS Stochastic Queuing Networks, SIGPLAN Not., pp.124–137, September 1988
L. Soulé and A. Gupta, An Evaluation of the Chandy-Misra-Bryant Algorithm for Digital Logic Simulation, ACM Transaction on Modeling and Computer Simulation, vol. 1, no.4, pp. 308–347, October 1991
R.C. de Vries, Reducing Null Messages in Misra's Distributed Discrete Event Simulation Method, IEEE Transaction on Software Engineering, vol. 16, no. 1, pp. 82–91, January 1990
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Naroska, E., Schwiegelshohn, U. (1996). A new scheduling method for parallel discrete-event simulation. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024752
Download citation
DOI: https://doi.org/10.1007/BFb0024752
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61627-6
Online ISBN: 978-3-540-70636-6
eBook Packages: Springer Book Archive