Show simple item record

dc.contributor.authorWang, Jain J.en_US
dc.contributor.authorAbrams, Marcen_US
dc.date.accessioned2013-06-19T14:36:27Z
dc.date.available2013-06-19T14:36:27Z
dc.date.issued1992
dc.identifierhttp://eprints.cs.vt.edu/archive/00000333/en_US
dc.identifier.urihttp://hdl.handle.net/10919/19786
dc.description.abstractIn this paper, we propose a time-parallel simulation method which uses a pre-simulation to identify recurrent states. Also, an approximation technique is suggested for approximate Markovian modeling for queueing networks to extend the class of simulation models which can be simulated efficiently using our time-parallel simulation. A central server system and a virtual circuit of a packet-switched data communication network modeled by closed queueing networks are experimented with the proposed time-parallel simulation. Experiment results suggest that the proposed approach can exploit massive parallelism while yielding accurate results.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.titleDetermining Initial States for Time-Parallel Simulationsen_US
dc.typeTechnical reporten_US
dc.contributor.departmentComputer Scienceen_US
dc.identifier.trnumberTR-92-53en_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000333/01/TR-92-53.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record