Efficient distributed simulation of a communication switch with bursty sources and losses

Authors:
A. S. McGough;I. Mitrani
Affiliations:
Computing Science Department, University of Newcastle, Newcastle upon Tyne, NE1 7RU;Computing Science Department, University of Newcastle, Newcastle upon Tyne, NE1 7RU
Venue:
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Year:
2000

Citing 8
Cited 2

Algorithms for unboundedly parallel simulations

ACM Transactions on Computer Systems (TOCS)
Parallel simulation of stochastic Petri nets using recurrence equations

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Approximate time-parallel simulation of queueing systems with losses

WSC '92 Proceedings of the 24th conference on Winter simulation
Time-parallel simulation of cascaded statistical multiplexers

SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Time-segmentation parallel simulation of networks of queues with loss or communication blocking

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Scheduling critical channels in conservative parallel discrete event simulation

PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
Efficient optimistic parallel simulations using reverse computation

PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
Parallel simulation by multi-instruction, longest-path algorithms

Queueing Systems: Theory and Applications

Genesis: a system for large-scale parallel network simulation

Proceedings of the sixteenth workshop on Parallel and distributed simulation
Progressive Time-Parallel Simulation

Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Algorithms for simulating an ATM switch on a distributed memory multiprocessor are described. These include parallel generation of bursty arrival streams, along with the marking and deleting of lost cells due to buffer overflows. These algorithms increase the amount of computation carried out independently by each processor, and reduce the communication between the processors. When the number of cells lost is relatively small, the run time of the simulation is approximately O(N/P), where N is the total number of cells simulated and P is the number of processors. The cells are processed in intervals of fixed length; that length affects the structure and the performance of the algorithms.