Show simple item record

dc.contributor.authorAbrams, Marcen_US
dc.contributor.authorSanjeevan, Vasanten_US
dc.contributor.authorRichardson, Debra S.en_US
dc.date.accessioned2013-06-19T14:36:15Z
dc.date.available2013-06-19T14:36:15Z
dc.date.issued1992
dc.identifierhttp://eprints.cs.vt.edu/archive/00000319/en_US
dc.identifier.urihttp://hdl.handle.net/10919/19759
dc.description.abstractThis paper proposes algorithms to stop parallel discrete event simulations using arbitrary termination conditions and to collect output measures. We show that the time complexity of termination can be higher than that of the underlying simulation; therefore termination can reduce or even preclude speed-up. We propose simulation protocol independent algorithms solving the termination and generation problems. Implementations of the algorithms for conservative-synchronous and optimistic protocols are presented. The predicted and measured increase in real time required to execute a time warp and a bounded lag simulation equipped with our termination algorithms is presented. The chief conclusion is that when the time required for each evaluation of the termination condition exceeds the mean time to execute an event, termination can dominate the simulation running time.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen_US
dc.relation.ispartofHistorical Collection(Till Dec 2001)en_US
dc.titleTermination and Output Measure Generation in Optimistic and Conservative-Synchronous Parallel Simulationsen_US
dc.typeTechnical reporten_US
dc.contributor.departmentComputer Scienceen_US
dc.identifier.trnumberTR-92-39en_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000319/01/TR-92-39.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record