Paper Info
Title
Effect of Event Orderings on Memory Requirement in Parallel Simulation
Abstract
Abstract: A new formal approach based on partial order set (poset) theory is proposed to analyze the space requirement of discrete-event parallel simulation. We divide the memory required by a simulation problem into memory to model the states of the real-world system, memory to maintain a list of future event occurrences, and memory required to implement the event synchronization protocol. We establish the relationship between poset theory and event orderings in simulation. Based on our framework, we analyze the space requirement using an open and a closed system as examples. Our analysis shows that apart from problem size and traffic intensity that affects the memory requirement, event ordering is an important factor that can be analyzed before implementation. In an open system, a weaker event ordered simulation requires more memory than strong ordering. However, the memory requirement is constant and independent of event ordering in closed systems.
Year
DOI
Venue
2001
10.1109/MASCOT.2001.948852
Cincinnati, OH
Keywords
Field
DocType
event synchronization protocol,event ordering,event orderings,closed system,simulation problem,space requirement,memory requirement,weaker event,discrete-event parallel simulation,open system,parallel simulation,future event occurrence,protocols,computer science,constraint optimization,open systems,synchronisation,computational modeling,computer simulation,discrete event simulation,memory management,partially ordered set,parallel processing
Synchronization,Parallel simulation,Computer science,Discrete event dynamic system,Traffic intensity,Real-time computing,Theoretical computer science,Simulation language,Open system (systems theory),Partially ordered set,Discrete event simulation,Distributed computing
Conference
ISSN
ISBN
Citations 
1526-7639
0-7695-1315-8
5
PageRank 
References 
Authors
0.49
9
3
Name
Order
Citations
PageRank
Y. M. Teo1172.87
B S S Onggo28214.17
Seng Chuan Tay37410.36