Paper Info
Title
Performance Trade-Off in Distributed Simulation
Abstract
This paper extends our previous work on formalizing even orderings using partial order set and its application in space analysis in distributed simulation.We focus on the time and space trade-off in exploiting event parallelism. Even parallelism is divided into inherent (problem) parallelism, event ordering parallelism and effective event parallelism.Firstly, we analyze the performance cost of varying even ordering parallelism on memory requirement in open and closed systems.Secondly, we study the effects of interconnection topology of a physical system on exploitable event ordering parallelism.Measurements were obtained from a time-space analyzer that we have developed.
Year
DOI
Venue
2002
10.1109/DISRTA.2002.1166892
DS-RT
Keywords
Field
DocType
discrete event simulation,distributed processing,software performance evaluation,synchronisation,discrete-event simulation,distributed simulation,effective event parallelism,event ordering parallelism,event parallelism,interconnection topology,memory requirement,partial order set,performance trade-off,space analysis,synchronization,time-space trade-off
Instruction-level parallelism,Synchronization,Computer science,Physical system,Task parallelism,Spacetime,Parallel computing,Real-time computing,Data parallelism,Scalable parallelism,Discrete event simulation,Distributed computing
Conference
ISSN
ISBN
Citations 
1530-1990
0-7695-1853-2
2
PageRank 
References 
Authors
0.38
0
2
Name
Order
Citations
PageRank
B S S Onggo18214.17
Y. M. Teo2172.87