Time-Parallel Simulation Using Partial State Matching for Queueing Systems

Simple item page
dc.contributor.authorWang, Jain J.en
dc.contributor.authorAbrams, Marcen
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:03Zen
dc.date.available2013-06-19T14:36:03Zen
dc.date.issued1992en
dc.description.abstractThis paper describes partial state matching for approximate time-parallel simulation. The notion of degree of freedom in time-parallel simulation is introduced. Two partial state matching algorithms are proposed to simulate acyclic networks of FCFS G/G/1/K queues in which arriving customers that find the queue full are lost. The algorithms are suitable for SIMD as well as MIMD architectures. The performance of the algorithms is studied. Experiment results with M/M/1/K and M/D/1/K queueing networks show that the potential speedup and simulation accuracy of the algorithms are good. The worst performance of both algorithms occurs when traffic intensity is one. Arguments are made to explain this phenomenon.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000330/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000330/01/TR-92-50.pdfen
dc.identifier.trnumberTR-92-50en
dc.identifier.urihttp://hdl.handle.net/10919/19827en
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.titleTime-Parallel Simulation Using Partial State Matching for Queueing Systemsen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-92-50.pdf
Size:
1.3 MB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports