Massively Time-Parallel, Approximate Simulation of Loss QueueingSystems
| dc.contributor.author | Wang, Jain J. | en |
| dc.contributor.author | Abrams, Marc | en |
| dc.contributor.department | Computer Science | en |
| dc.date.accessioned | 2013-06-19T14:37:16Z | en |
| dc.date.available | 2013-06-19T14:37:16Z | en |
| dc.date.issued | 1994-02-01 | en |
| dc.description.abstract | A time-parallel simulation obtains parallelism by partitioning the time domain of the simulation. An approximate time-parallel simulation algorithm named GG1K is developed for acyclic networks of loss FCFS G/G/1/K queues. In the first phase, a similar system (i.e., a G/G/1/infinity queue) is simulated using the GLM algorithm. Then the resultant trajectory is transformed into an approximate G/G/1/K trajectory in the second phase. The closeness of the approximation is investigated theoretically and experimentally. Our results show that the approximation is highly accurate except when K is very small (e.g., 5) in certain models. The algorithm exploits unbounded parallelism and can achieve near-linear speedup when the number of arrivals simulated is sufficiently large. | en |
| dc.format.mimetype | application/postscript | en |
| dc.identifier | http://eprints.cs.vt.edu/archive/00000391/ | en |
| dc.identifier.sourceurl | http://eprints.cs.vt.edu/archive/00000391/01/TR-94-09.ps | en |
| dc.identifier.trnumber | TR-94-09 | en |
| dc.identifier.uri | http://hdl.handle.net/10919/19875 | en |
| dc.language.iso | en | en |
| dc.publisher | Department of Computer Science, Virginia Polytechnic Institute & State University | en |
| dc.relation.ispartof | Historical Collection(Till Dec 2001) | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.title | Massively Time-Parallel, Approximate Simulation of Loss QueueingSystems | en |
| dc.type | Technical report | en |
| dc.type.dcmitype | Text | en |
Files
Original bundle
1 - 1 of 1