Determining Initial States for Time-Parallel Simulations

Simple item page
dc.contributor.authorWang, Jain J.en
dc.contributor.authorAbrams, Marcen
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:27Zen
dc.date.available2013-06-19T14:36:27Zen
dc.date.issued1992en
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
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000333/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000333/01/TR-92-53.pdfen
dc.identifier.trnumberTR-92-53en
dc.identifier.urihttp://hdl.handle.net/10919/19786en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleDetermining Initial States for Time-Parallel Simulationsen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-92-53.pdf
Size:
774.03 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports