Coordination languages for parallel discrete event simulation

We investigate coordination languages as support for the implementation of parallel discrete event simulators. In particular, we show that the computational model provided by coordination languages and based on the shared space abstraction is a suitable environment for the implementation of a new, event-based, methodology we call ActE (Active Events). ActE naturally solves the state sharing problem, and is able to fully exploit the causal concurrency among events. We also outline features of an ideal coordination language with respect to parallel simulation.

[1]  David Gelernter,et al.  Supercomputing out of recycled garbage: preliminary experience with Piranha , 1992, ICS '92.

[2]  K. Mani Chandy,et al.  Distributed Simulation: A Case Study in Design and Verification of Distributed Programs , 1979, IEEE Transactions on Software Engineering.

[3]  Nicholas Carriero,et al.  Coordination languages and their significance , 1992, CACM.

[4]  Lorenzo Donatiello,et al.  Performance Evaluation of Computer and Communication Systems , 1993, Lecture Notes in Computer Science.

[5]  Robert G. Sargent,et al.  A New Process to Processor Assignment Criterion for Reducing Rollbacks in Optimistic Simulation , 1993, J. Parallel Distributed Comput..

[6]  Isi Mitrani.  Simulation techniques for discrete event systems , 1982, Cambridge computer science texts.

[7]  Peter Wegner,et al.  Coordination as Comstrainted Interaction (Extended Abstract) , 1996, International Conference on Coordination Models and Languages.

[8]  Jack Dongarra,et al.  Pvm 3 user's guide and reference manual , 1993 .

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

[10]  Richard M. Fujimoto,et al.  Parallel discrete event simulation , 1990, CACM.

[11]  David R. Jefferson,et al.  Virtual time , 1985, ICPP.

[12]  David Jefferson,et al.  Fast Concurrent Simulation Using the Time Warp Mechanism. Part I. Local Control. , 1982 .

[13]  Yehoshua Sagiv.  Concurrent Operations on B*-Trees with Overtaking , 1986, J. Comput. Syst. Sci..

[14]  Richard M. Fujimoto,et al.  The virtual time machine , 1989, SPAA '89.

[15]  Nicholas Carriero,et al.  Linda in context , 1989, CACM.

[16]  Bill Nitzberg,et al.  Distributed shared memory: a survey of issues and algorithms , 1991, Computer.

[17]  Richard M. Fujimoto,et al.  Feature Article - Parallel Discrete Event Simulation: Will the Field Survive? , 1993, INFORMS J. Comput..

[18]  David Gelernter,et al.  The Linda® Alternative to Message-Passing Systems , 1994, Parallel Comput..

[19]  Rassul Ayani,et al.  Parallel Simulation , 1993, Performance/SIGMETRICS Tutorials.