Abstract | ||
---|---|---|
Approximate Time (AT) has been proposed as a means for expressing temporal uncertainty in distributed simulation applications in order to enhance parallel performance. This is accomplished by specifying time intervals rather than precise values to indicate when an event might occur. This paper describes a case study in applying AT to a queueing simulation application in order to assess the performance and accuracy that can be obtained using this technique. Up to an order of magnitude speedup was obtained, with error in throughput statistics less than 3%, although somewhat larger error was reported in delay statistics. |
Year | DOI | Venue |
---|---|---|
2004 | 10.1109/ICPP.2004.6 | ICPP |
Keywords | Field | DocType |
parallel simulations,parallel performance,temporal uncertainty,delay statistic,approximate time,magnitude speedup,simulation application,exploiting temporal uncertainty,case study,larger error,queueing simulation application,precise value,parallel processing,queueing theory,statistical analysis | Computer science,Parallel processing,Parallel computing,Queueing theory,Throughput,Order of magnitude,Uncertainty handling,Statistical analysis,Distributed computing,Speedup | Conference |
ISBN | Citations | PageRank |
0-7695-2197-5 | 8 | 0.63 |
References | Authors | |
8 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Margaret L. Loper | 1 | 38 | 6.21 |
Richard M. Fujimoto | 2 | 3570 | 372.88 |