Skip to main content
SpringerLink
Log in

The distributed simulation of clustered processes

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

An efficient method for use in the discrete-event distributed simulation of large systems is presented. A conservative distributed simulation as well as the mapping of several simulated processes onto the same processor is assumed. The method consits of two algorithms: an algorithm for computing the lower bounds on times of future events, and a distributed algorithm that resolves deadlocks. The performance of the method is demonstrated by comparing it to the Chandy-Misra-Bryant simulation and by presenting some experimental results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bracha G, Toueg S: Distributed Deadlock Detection. Distrib Comput 2:127–138 (1987)

    Google Scholar 

  2. Bryant RE: Simulation of packet communication architecture computer systems. MIT/LCS/TR-188. MIT, Cambridge, Mass. 1977

    Google Scholar 

  3. Chandy KM, Lamport L: Distributed snapshots: determining global states of distributed systems. ACM Trans Comput Syst 3(1):63–75 (1985)

    Google Scholar 

  4. Chandy KM, Misra J: Distributed simulation: a case study in design and verification of distributed programs. IEEE Trans Softw Eng SE-5:440–452 (1979)

    Google Scholar 

  5. Chandy KM, Misra J: Asynchronous distributed simulation via a sequence of parallel computations. Commun ACM 24:198–206 (1981)

    Google Scholar 

  6. Chandy KM, Misra J: Distributed computation on graphs: shortest path algorithms. Commun ACM 25(11):833–837 (1982)

    Google Scholar 

  7. Chandy KM, Misra J: Parallel program design: a foundation. Addison-Wesley, Reading, Mass. 1988

    Google Scholar 

  8. Chandy KM, Misra J, Haas LM: Distributed deadlock detection. ACM Trans Comput Syst 1:144–156 (1983)

    Google Scholar 

  9. Cidon I, Jaffe JM, Sidi M: Local distributed deadlock detection by cycle detection and clustering. IEEE Trans Softw Eng SE 13:3–14 (1987)

    Google Scholar 

  10. Dijkstra EW, Scholten CS: Termination detection for diffusing computations. Inf Process Lett 11:1–11 (1980)

    Google Scholar 

  11. Grošelj B: Pseudosimulation and the distributed simulation of clustered processes. PhD Thesis, McGill University, School of Computer Science 1988

  12. Grošelj B: Cocktail Party Simulation and its performance on a network of workstations. In: Nicol D (ed) Proc 1990 SCS Western Multiconf, SCS Simulation Series. San Diego, CA:70–73 (1990)

  13. Grošelj B, Tropper C: Pseudosimulation: an algorithm for distributed simulation with limited memory. Int J Parallel Program 15:413–456 (1987)

    Google Scholar 

  14. Jefferson DR: Virtual time. ACM Trans Program Lang Syst 7:404–425 (1985)

    Google Scholar 

  15. Johnson DB: Efficient algorithms for shortest paths in sparse networks. J ACM 24:1–13 (1977)

    Google Scholar 

  16. Lubachevsky B: Bounded lag distributed discrete event simulation. In: Unger B, Jefferson D (eds) Proc 1988 Distrib Simul Conf, SCS Simulation Series, vol 19, no 3, San Diego, CA: 183–191 (1988)

  17. Natarajan N: A distributed scheme for detecting communication deadlocks. IEEE Trans Softw Eng SE-12:531–537 (1986)

    Google Scholar 

  18. Nicol DM: Parallel discrete-event simulation of FCFS stochastic queuing networks. In: Proc ACM SIGPLAN Symp on Parallel Programming, Environments, Applications, and Languages, Yale University 1988

  19. Peacock JK, Wong JW, Manning EG: Distributed simulation using a network of processors. Comput Networks 3:44–56 (1979)

    Google Scholar 

  20. Reed DA, Malony AD, McCredie BD: Parallel discrete event simulation: a shared memory approach. ACM Perf Eval Rev 15:36–38 (1987)

    Google Scholar 

  21. Seitz CL, Seizovic J, Su W-K: The C programmer's abbreviated guide to multicomputer programming. Caltech CS-TR-88-1 (1988)

Download references

Author information

Authors and Affiliations

  1. The Center for Advanced Computer Studies, University of Southwestern Louisiana, 70504, Lafayette, LA, USA

    Bojan Grošelj

  2. School of Computer Science, McGill University, H3A 2A7, Montreal, PQ, Canada

    Carl Tropper

Authors
  1. Bojan Grošelj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carl Tropper
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Bojan Grošelj received his B.EE. and M.EE. degrees from the University of Ljubljana, Slovenia (Yugoslavia), in 1978 and 1981, respectively. His Ph.D. degree in Computer Science is from McGill University, Montreal, Canada (1988). In 1988, he joined the Center for Advanced Computer Studies, University of Southwestern Louisiana, where he is currently an Assistant Professor. His current research interests include distributed simulation, distributed computing in general, program proving, and sorting. For the last two years, the author has been proving a distributed deadlock-detection algorithm using the UNITY approach.

Carl Tropper is an Associate Professor of Computer Science at McGill University, Montreal, Canada. His major area of research at present is distributed discrete-event simulation. He has also worked in the area of performance evaluation of computer networks. Formerly, he was with BBN Communications Corporation, Cambridge, Mass., where he contributed to the design and evaluation of various widearea network protocols.

This research was supported in part by the National Science Foundation under Grant CCR-8909098. An extended version of this work will appear in Progress in Simulation, vol. II, Ablex Publishing Corporation

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grošelj, B., Tropper, C. The distributed simulation of clustered processes. Distrib Comput 4, 111–121 (1991). https://doi.org/10.1007/BF01798958

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01798958

Key words

Search

Navigation