2006•Chapman & Hall/CRC computer and information science seriesRequires access

Distributed Discrete-Event Simulation

Author information unavailable

Abstract

Traditionaldiscrete-event simulations employ an inherently sequential algorithm.In practice, simulations of large systems are limited by this sequentiality, because only a modest number of events can be simulated.Distributed discrete-event simulation (carried out on a network of processors with asynchronous message-communicating capabilities) is proposed as an alternative; it may provide better performance by partitioning the simulation among the component processors.The basic distributed simulation scheme, which uses time encoding, is described.Its major shortcoming is a possibility of deadlock.Several techniques for deadlock avoidance and deadlock detection are suggested.The focus of this work is on the theory of distributed discrete-event simulation.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 14 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Deadlock, Computer science, Asynchronous communication, Discrete event simulation, Distributed computing, Deadlock prevention algorithms, Event (particle physics), Scheme (mathematics)