ACM Transactions on Programming Languages and Systems (TOPLAS)
Rollback sometimes works...if filtered
WSC '89 Proceedings of the 21st conference on Winter simulation
Limitation of optimism in the time warp operating system
WSC '89 Proceedings of the 21st conference on Winter simulation
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
Investigations in adaptive distributed simulation
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
ATM networks (2nd ed.): concepts, protocols, applications
ATM networks (2nd ed.): concepts, protocols, applications
NPSI adaptive synchronization algorithms for PDES
WSC '95 Proceedings of the 27th conference on Winter simulation
Adaptive algorithms vs. Time Warp: an analytical comparison
WSC '95 Proceedings of the 27th conference on Winter simulation
ANSS '91 Proceedings of the 24th annual symposium on Simulation
A spectrum of options for parallel simulation
WSC '88 Proceedings of the 20th conference on Winter simulation
The Statistically Correct Approach to Distributed Simulation of ATM Networks
Proceedings of the Sixth IFIP WG6.3 Conference on Performance of Computer Networks: Data Communications and their Performance
A shared resource algorithm for distributed simulation
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Estimating rollback overhead for optimism control in Time Warp
SS '95 Proceedings of the 28th Annual Simulation Symposium
Distributed Simulation: A Case Study in Design and Verification of Distributed Programs
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
This work investigates the use of a preventive length-based blocking strategy associated with local estimations. A logical process must block until the length of its input queue becomes greater than a threshold Lmin. By blocking one can reduce the number of time errors in order to allow the local estimations to handle more efficiently the remaining time errors. In a first time, we seek for an empirical optimal trade-off between the initial blocking length, the speedup relative to a conservative simulation and the accuracy of the results. Then an automatic tuning is performed to adjust the initial blocking length to a desired time error ratio. We apply this method to simulate an ATM network and the results show that the length blocking strategy succeed in reducing the number of causality violations with a very small blocking overhead. Also both accuracy and speedup can be achieved.