User:Lsalgo/Synchronous Relaxation for Parallel Discrete Event Simulations

Synchronous Relaxation for Parallel Discrete Event Simulations is a method to perform a discrete event simulation on a parallel computer. The Synchronous Relaxation (SR) method is general in that it makes no use of specifics of the simulated system and it is computationally efficient in that it typically delivers the speedup of the order of $N/\log(N)$, where ${N}$ is the number of processors in the parallel computer.

When the SR is applicable

A multi-component model of a dynamic system might avail itself for a SR simulation. The state may change in such a model only instantaneously by changing the state of a component, which is identified as a discrete event that occurs in that component. The event may affect future events in other components. Examples of such models are numerous: telephone networks models, models of Ising spins, models of collision detection of particles, to name a few.

In a circuit-switched telephone network, an event is a change of the occupancy level of a trunk (channel), when a phone call is allocated to this trunk. Allocation status of a trunk affects future allocations of this and other trunks via the logic of the allocation algorithm. The comparative behavior of various allocation algorithms is a subject of study in this simulation which was the first example of application of the SR method and wherein the term "Synchronous Relaxation" itself was introduced.

External links

• example.com