Parallel Discrete Event Simulation in Star Networks with Application to Telecommunications

Authors:
Sajal K. Das;Falguni Sarkar;Kalyan Basu;Seshu Madhavapeddy
Affiliations:
-;-;-;-
Venue:
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Year:
1995

Citing 4
Cited 4

Virtual time

ACM Transactions on Programming Languages and Systems (TOPLAS)
A sweep algorithm for massively parallel simulation of circuit-switched networks

Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
Parallel simulation using conservative time windows

WSC '92 Proceedings of the 24th conference on Winter simulation
Asynchronous distributed simulation via a sequence of parallel computations

Communications of the ACM - Special issue on simulation modeling and statistical computing

Predictability of event occurrences in partially-observed discrete-event systems

Automatica (Journal of IFAC)
DNA sites buried in nucleosome become accessible at room temperature: a discrete-event-simulation based modeling approach

ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
Stochastic modeling of cytoplasmic reactions in complex biological systems

ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Exploring spatial partition for parallel simulation of DEVS-FIRE

SCSC '09 Proceedings of the 2009 Summer Computer Simulation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new conservative, time-window protocol for parallel discrete event simulation where the simulation system and the physical system used can both be modeled as a star network, in which one central node is connected to every other node. The success of our algorithm is also dependent of the lookahead predictability of the system to be simulated. The entire approach is designed keeping telecommunication applications in mind. The synchronization algorithm presented in this paper is deadlock free and will not lead to any erroneous computation. We have also computed critical system parameters such as queue length at individual nodes, approximate service times, waiting times and the rate of progress of simulation.