Global synchronization for optimistic parallel discrete event simulation

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A number of optimistic synchronization schemes for parallel simulation rely upon a global synchronization. The problem is to determine when every processor has completed all its work, and there are no messages in transit in the system that will cause more work. Most previous solutions to the problem have used distributed termination algorithms, which are inherently serial; other parallel mechanisms may be inefficient. In this paper we describe an efficient parallel algorithm derived from a common `barrier' synchronization algorithm used in parallel processing. The algorithm's principle attraction is speed, and generality - it is designed to be used in contexts more general than parallel discrete-event simulation. To establish our claim to speed, we compare our algorithm's performance with the standard barrier algorithm, and find that its additional costs are not excessive. Our experiments are conducted using up to 256 processors on the Intel Touchstone Delta.

Original languageEnglish (US)
Title of host publicationProc 7 Workshop Parallel Distrib Simul
PublisherPubl by ACM
Pages27-34
Number of pages8
ISBN (Print)1565550552, 9781565550551
DOIs
StatePublished - 1993
Externally publishedYes
EventProceedings of the 7th Workshop on Parallel and Distributed Simulation - San Diego, CA, USA
Duration: May 16 1993May 19 1993

Publication series

NameProc 7 Workshop Parallel Distrib Simul

Other

OtherProceedings of the 7th Workshop on Parallel and Distributed Simulation
CitySan Diego, CA, USA
Period5/16/935/19/93

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'Global synchronization for optimistic parallel discrete event simulation'. Together they form a unique fingerprint.

Cite this