article

Free access

Synchronization mechanisms for distributed event-driven computation

Editor: Richard Nance Authors:

Vijay K. Madisetti,

David A. HardakerAuthors Info & Claims

ACM Transactions on Modeling and Computer Simulation (TOMACS), Volume 2, Issue 1

Pages 12 - 50

https://doi.org/10.1145/132277.132279

Published: 02 January 1992 Publication History

PDF eReader

Abstract

We analyze distributed event-driven computation on message-passing parallel computing systems. Synchronization is the mechanism that ensures that causality in the ordering of stochastically generated events for execution during the computation is maintained. We characterize distributed event-driven computation into weakly coupled (weak interactions) and strongly coupled (strong interactions) distributed systems and propose and analyze a number of new algorithms for efficient synchronization. The analytical results for steady state performance are complemented with detailed simulations of the transient performance. We show that synchronization enforced separately from computation results in an efficient implementation. Effects of the memory hierarchy and communication delays are also incorporated.

References

[1]

ALLEN, J.Computer architecture for digital signal processing. Proc. IEEE 73, 5 (May 1985), 852-873.

Google Scholar

[2]

ATLAS, W., AND SE~TZ, C.L. Multicomputers: Message-passing concurrent computers. IEEE Comput. (Aug. 1988), 9 24.

Crossref

Google Scholar

[3]

BERSTEKAS, D., AND TSITSIKLIS, J. Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Englewood Cliffs, N.J., 1987.

Crossref

Google Scholar

[4]

CHANDY, K. M., AND MISRA, J. Distributed simulation: A case study in design and verification of distributed programs. IEEE Trans. Sofiw. Eng. SE-5, 5 (Sept. 1979), 440 452.

Google Scholar

[5]

C~D~, K. M., AND M~SRA, J. Asynchronous distributed simulation via a sequence of parallel computations. Commun. ACM 24, 4 (Apr. 1981), 198-206.

Crossref

Google Scholar

[6]

DENNIS, J.B. Data-flow supercomputers. Comput. (Nov. 1980), 48-56.

Google Scholar

[7]

FUJIMOTO, R. Performance measurements for distributed simulation strategues. Tech. Rep. UUCS-87-026a, Univ. of Utah, 1987.

Google Scholar

[8]

FUJIMOTO, R. M Parallel discrete event simulation. Commun. ACM 33, 10 (Oct. 1990), 31-53.

Crossref

Google Scholar

[9]

GAI~DIOT, J.-L.Data-driven multicomputers in digital signal processing Proc. IEEE 75, 9 (Sept 1987).

Google Scholar

[10]

HWANG, K., AND BRIGGS, F.A. Computer Archztecture and Parallel Processing. McGraw-Hill, New York, 1984.

Crossref

Google Scholar

[11]

JEFFERSON, D. Virtual time. ACM Trans. Program. Lang. Syst. 7, 3 (July 1985), 404-425.

Crossref

Google Scholar

[12]

JEFFERSON, n, AND SOWIZRAL, H. Fast concurrent simulatmn using the Time Warp mechanism: Local control. Tech. Rep. N-1906-AF, Rand Corporation, 1982.

Google Scholar

[13]

JEFFERSON, D. et al. Distributed simulation and the Time Warp operating system. In Proceedings of the 11th ACM Symposium on Operating System Principles (Nov. 1987). ACM, New York, 1987, pp. 77-93.

Crossref

Google Scholar

[14]

KUNG, S. Y., AJ~UN, K. S, GAL-EZER, R. J., ANn BHASKaR RAO, D. V. Wavefront array processor' Language, architecture, and applications. IEEE Trans. Comput. C-31, 11 (Nov. 1982), 1054-1066.

Google Scholar

[15]

LAVENBERG, S., MUNTZ, R., AND SAMADI, B. Performance analys~s of a rollback method for distributed simulation. In Performance '83. 1983, pp. 117-132.

Crossref

Google Scholar

[16]

LIN, Y.-B. Understanding the limits of optimistic and conservative parallel simulations. Ph.D. dissertatmn, Univ. of Washington, 1990.

Crossref

Google Scholar

[17]

LUBACttEVSKY, B. Efficient distributed event-driven simulation of multiple loop networks. Commun ACM 32, 3 (Mar. 1989).

Crossref

Google Scholar

[18]

MADISETTI, V. Self-synchronizing concurrent computing systems. Ph.D. thesis, Univ. of Califorma at Berkeley, 1989. ERL Memorandum M89/122.

Crossref

Google Scholar

[19]

MADISETTI, V., AND MESSERSCHMITF, n. Seismic migration algorithms on parallel computers. IEEE Trans. Signal Process. (July 1991), 1642-1654.

Google Scholar

[20]

MADISETTI, V., HARDAKER, D., AND FU,IIIvlOTO, R. The MIMDIX operating system for parallel simulation In Proceedings of 6th IEEE Workshop on Parallel and Dtstributed Slmulatzon (Anaheim, Calif., Jan. 1992). IEEE, New York, 1992

Google Scholar

[21]

MADISETTI, V., WALRAND, J., AND MESSERSCHMITT, D. Wolf: A rollback algorithm for optmlstm distributed simulation systems. In Proceedings of Winter Simldat~on Conference (San Dingo, Cahf., Dec. 1988).

Crossref

Google Scholar

[22]

MADISETTI, V., WALRAND, J., AND MESSERSCHMITT, D Some adaptive approaches to the synchronization of self-timed computing systems. In Procee&ngs of the SCS Conference on Modeling Szmulation (San Diego, Calif., Jan. 1990).

Google Scholar

[23]

MADISETTI, V., WALRAND, J., AND MESSERSCHMITT, D. Asynchronous algorithms for the parallel simulation of event-driven dynamical systems. ACM Trans. Comput. Model. Szmul. 10, 2 (July 1992).

Crossref

Google Scholar

[24]

MisaA, J. Distributed discrete-event simulation. ACM Comput. Surv 18, 1 (Mar. 1986), 39-64.

Crossref

Google Scholar

[25]

MITRA, D., AND MITRANI, I. Analysis and optimum performance of two message passing processors synchronized by rollback. In Proceedings of the lOth International Conference on Computer Performance Modeling', 1984.

Crossref

Google Scholar

[26]

NICOL, D. Performance bounds on self-initiating parallel discrete-event mmulations. Tech. Rap. 90-21, ICASE, 1990.

Google Scholar

[27]

REED, D., AND FUJiMOTO, R. Mult~computer Networks: Message-Based Parallel Processing. The MIT Press, Cambridge, Mass., 1987.

Crossref

Google Scholar

[28]

REYNOLDS, P. A spectrum of options for parallel simulation protocols. In Proceedtngs of 1988 Winter Stmulation Conference (Dec. 1988), pp. 206 209.

Crossref

Google Scholar

[29]

RIGHTER, R, AND WALRAND, J. Distributed simulation of discrete-event systems. Proc. IEEE 77, I (Jan. 1989).

Google Scholar

[30]

SCHWARTZ, D. A., AND BARNWELL, T. P., III. Cyclo-static solutions: Optimal multiprocessor realizations of recursive algorithms. In VLSI S~gnal Processing II. IEEE Press, New York, 1986.

Google Scholar

[31]

SEITZ, C.L. The cosmic cube. Commun. ACM 28, i (Jan. 1985), 22-33.

Crossref

Google Scholar

[32]

SMITH, h.J. Cache memories. ACM Comput. Surv. 14, 3 (Sept. 1982), 473 530.

Crossref

Google Scholar

[33]

SOKOL, L., AND STUCKY, B. MTW: Experimental results for a constrained optimistic scheduling paradigm. In Proceedmgs of 1990 SCS Multiconference on Distributed S~mulatton (Jan. 1990), pp. 169-173.

Google Scholar

[34]

VAN RENESSE, ~., VAN STAVEREN, J. M., AND TANENBAUM, A. S. The performance of the world's fastest distributed operating system. ACM Oper. Syst. Rev. 22, 4 (Oct. 1988), 25-34.

Crossref

Google Scholar

[35]

WAGNER, J. Conservative parallel discrete-event simulation: Principles and practice. Ph.D. dissertation, Univ. of Washington, 1989.

Crossref

Google Scholar

[36]

WALRAND, J. An Introduction to Queueing Networks. Prentice-Hall, Englewood Cliffs, N.J., 1988.

Google Scholar

[37]

Su, W.-K., AND SEITZ, C.L. Variants of the Chandy-Misra-Bryant distributed discrete-event simulation algorithm. In Distributed Simulation. Society for Computer Simulation Irternational, 1989, pp. 38-43.

Google Scholar

Cited By

View all

Post GMüller AGrötker TDewilde PRammig FMusgrave G(1998)A system-level co-verification environment for ATM hardware designProceedings of the conference on Design, automation and test in Europe10.5555/368058.368257(424-428)Online publication date: 23-Feb-1998
https://dl.acm.org/doi/10.5555/368058.368257
Post GMuller AGrotker T(1998)A system-level co-verification environment for ATM hardware designProceedings Design, Automation and Test in Europe10.1109/DATE.1998.655892(424-428)Online publication date: 1998
https://doi.org/10.1109/DATE.1998.655892
Yan YZhang XYang H(1996)A Fast Token-Chasing Mutual Exclusion Algorithm in Arbitrary Network TopologiesJournal of Parallel and Distributed Computing10.1006/jpdc.1996.007835:2(156-172)Online publication date: 15-Jun-1996
https://dl.acm.org/doi/10.1006/jpdc.1996.0078
Show More Cited By

Index Terms

Synchronization mechanisms for distributed event-driven computation
1. Computing methodologies
  1. Modeling and simulation
    1. Simulation theory
2. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Memory management
        Distributed memory
        Process management
        Process synchronization

Recommendations

Distributed source-destination synchronization using inband clock distribution

This paper presents a new distributed methodology for source destination synchronization for interactive teleconferencing. The method is based on a reference clock, which is synthesized from a distributed global clock. The global clock is generated by ...
Completeness and Consistency Analysis on Requirements of Distributed Event-Driven Systems
TASE '08: Proceedings of the 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering

For many event-driven systems, the completeness and consistency (C&C) are the most important characteristics of those software requirements. This paper presents a systematic approach to perform C&C analysis on the requirements, and an intelligent ...
Demand-Driven Weak Clock Synchronization for Distributed Applications
CSSE '08: Proceedings of the 2008 International Conference on Computer Science and Software Engineering - Volume 03

It is often required to analyze the behavior and reliability of large distributed systems before deploying them. This task relies on the existence of a dependency graph. The dependency graph can be constructed according to the blueprint of the system (...

Reviews

Reviewer: Nancy R. Mead

An analysis of distributed event-driven computation on message-passing parallel computing systems is given. The problem addressed is a dynamic computation graph (DCG) executed on a distributed computing system, when both task times and precedences are unknown. The paper extends previous results, starting with discussion of the Bernoulli clock model for dynamic computation graphs. The performance of a two-processor system is studied, and a state-space solution approach is proposed. Exact results are derived for the rate of forward computation. Next, a classification scheme is proposed for multiprocessor systems, based on frequency of interaction. The focus is on weakly coupled systems. The authors point out that weakly coupled systems are of considerable practical interest. Prior work focused on strongly coupled systems. Synchronization, which is enforced probabilistically and separate from computation, is shown to give the best performance. The paper is well written and contains 37 references. It is obviously one in a sequence of research papers on the subject. It will interest researchers and practitioners who are concerned with synchronization mechanisms.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Modeling and Computer Simulation

ACM Transactions on Modeling and Computer Simulation Volume 2, Issue 1

Jan. 1992

103 pages

ISSN:1049-3301

EISSN:1558-1195

DOI:10.1145/132277

Editor:
Richard Nance
Virginia Tech, Blacksburg

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 January 1992

Published in TOMACS Volume 2, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
687
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)5

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Post GMüller AGrötker TDewilde PRammig FMusgrave G(1998)A system-level co-verification environment for ATM hardware designProceedings of the conference on Design, automation and test in Europe10.5555/368058.368257(424-428)Online publication date: 23-Feb-1998
https://dl.acm.org/doi/10.5555/368058.368257
Post GMuller AGrotker T(1998)A system-level co-verification environment for ATM hardware designProceedings Design, Automation and Test in Europe10.1109/DATE.1998.655892(424-428)Online publication date: 1998
https://doi.org/10.1109/DATE.1998.655892
Yan YZhang XYang H(1996)A Fast Token-Chasing Mutual Exclusion Algorithm in Arbitrary Network TopologiesJournal of Parallel and Distributed Computing10.1006/jpdc.1996.007835:2(156-172)Online publication date: 15-Jun-1996
https://dl.acm.org/doi/10.1006/jpdc.1996.0078
Galluscio ADouglass JMalloy BTurner ALilegdon WGoldsman D(1995)A comparison of two methods for advancing time in parallel discrete event simulationProceedings of the 27th conference on Winter simulation10.1145/224401.224703(650-657)Online publication date: 1-Dec-1995
https://dl.acm.org/doi/10.1145/224401.224703
Galluscio ADouglass JMalloy BTurner A(1995)A comparison of two methods for advancing time in parallel discrete event simulationWinter Simulation Conference Proceedings, 1995.10.1109/WSC.1995.478840(650-657)Online publication date: 1995
https://doi.org/10.1109/WSC.1995.478840
Madisetti VEgolf T(1995)Virtual Prototyping of Embedded Microcontroller-Based DSP SystemsIEEE Micro10.1109/40.46457715:5(9-21)Online publication date: 1-Oct-1995
https://dl.acm.org/doi/10.1109/40.464577
Douglass JMalloy BSadowski DSeila A(1994)Using a shot clock to design an efficient parallel distributed simulationProceedings of the 26th conference on Winter simulation10.5555/193201.194897(1362-1369)Online publication date: 11-Dec-1994
https://dl.acm.org/doi/10.5555/193201.194897
Douglass JMalloy B(1994)Using a shot clock to design an efficient parallel distributed simulationProceedings of Winter Simulation Conference10.1109/WSC.1994.717531(1362-1369)Online publication date: 1994
https://doi.org/10.1109/WSC.1994.717531
Fujimoto R(1994)Parallel simulation of discrete event systems11th International Conference on Analysis and Optimization of Systems Discrete Event Systems10.1007/BFb0033573(419-428)Online publication date: 1994
https://doi.org/10.1007/BFb0033573
Madisetti VHardaker DFujimoto R(1993)The MIMDIX Environment for Parallel SimulationJournal of Parallel and Distributed Computing10.1006/jpdc.1993.107818:4(473-483)Online publication date: 1-Aug-1993
https://dl.acm.org/doi/10.1006/jpdc.1993.1078

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Distributed source-destination synchronization using inband clock distribution

Completeness and Consistency Analysis on Requirements of Distributed Event-Driven Systems

Demand-Driven Weak Clock Synchronization for Distributed Applications

Reviews

Access critical reviews of Computing literature here

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations