TY - GEN
T1 - A FIFO queue class library as a state variable of time warp logical processes
AU - Hidaka, Soichiro
AU - Aoki, Terumasa
AU - Aida, Hitoshi
AU - Saito, Tadao
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.
PY - 1998
Y1 - 1998
N2 - We describe SsQueue(SnapshotQueue), an implementation for an efficient and user-friendly class library for FIFO queue that can be used for state vectors in simulated queuing network constructs under Time Warp parallel discrete event simulation (PDES) protocol. There exists a general purpose Time Warp simulation kernel warped, where users have only to define a state vector and do not have to care about rollback and state recovery. However, since the state vector should be defined as an inlined data structure, it is not suitable for dynamic data structures such as FIFO queue. This class can also serve as an element of such a state vector, then both libraries and users can handle each instance as snapshot of the queue. Taking advantages of FCFS nature of the above data structure, operation histories rather than all contained items can be safely stored and restored using this class library with virtually minimum overhead. When the kernel deletes instances in the simulated past, corresponding methods perform garbage collections transparently.
AB - We describe SsQueue(SnapshotQueue), an implementation for an efficient and user-friendly class library for FIFO queue that can be used for state vectors in simulated queuing network constructs under Time Warp parallel discrete event simulation (PDES) protocol. There exists a general purpose Time Warp simulation kernel warped, where users have only to define a state vector and do not have to care about rollback and state recovery. However, since the state vector should be defined as an inlined data structure, it is not suitable for dynamic data structures such as FIFO queue. This class can also serve as an element of such a state vector, then both libraries and users can handle each instance as snapshot of the queue. Taking advantages of FCFS nature of the above data structure, operation histories rather than all contained items can be safely stored and restored using this class library with virtually minimum overhead. When the kernel deletes instances in the simulated past, corresponding methods perform garbage collections transparently.
UR - http://www.scopus.com/inward/record.url?scp=84947601410&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84947601410&partnerID=8YFLogxK
U2 - 10.1007/3-540-49372-7_15
DO - 10.1007/3-540-49372-7_15
M3 - Conference contribution
AN - SCOPUS:84947601410
SN - 3540653872
SN - 9783540653875
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 151
EP - 158
BT - Computing in Object-Oriented Parallel Environments - 2nd International Symposium, ISCOPE 1998, Proceedings
A2 - Caromel, Denis
A2 - Oldehoeft, Rodney R.
A2 - Tholburn, Marydell
PB - Springer Verlag
T2 - 2nd International Symposium on Computing in Object-Oriented Parallel Environments, ISCOPE 1998
Y2 - 8 December 1998 through 11 December 1998
ER -