Algorithms for unboundedly parallel simulations
ACM Transactions on Computer Systems (TOCS)
Time-segmentation parallel simulation of networks of queues with loss or communication blocking
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Exact sampling with coupled Markov chains and applications to statistical mechanics
Proceedings of the seventh international conference on Random structures and algorithms
Parallel and Distribution Simulation Systems
Parallel and Distribution Simulation Systems
Massively Parallel Algorithms for Trace-Driven Cache Simulations
IEEE Transactions on Parallel and Distributed Systems
An Algorithmic Approach to Stochastic Bounds
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Speedup-Precision Tradeoffs in Time-Parallel Simulation of Wireless Ad hoc Networks
DS-RT '06 Proceedings of the 10th IEEE international symposium on Distributed Simulation and Real-Time Applications
Modeling Fiber Delay Loops in an All Optical Switch
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Challenges and benefits of time-parallel simulation of wireless ad hoc networks
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Monotone queuing networks and time parallel simulation
ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications
Monotonicity and efficient computation of bounds with time parallel simulation
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
Tradeoff between accuracy and efficiency in the time-parallel simulation of monotone systems
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
Tradeoff between accuracy and efficiency in the time-parallel simulation of monotone systems
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
Hi-index | 0.00 |
We improve the efficiency of time parallel simulation using some concepts of monotonicity of simulation models. The time parallel simulation technique partitions the simulation timespan into simulation periods which are independently executed. Such a technique relies on strong stochastic assumptions: regeneration or short influence of the initial point a on sample path. If these assumptions are not satisfied, we only obtain an approximation. We prove that if the model is monotone we can increase the parallelization of the simulations and we can prove some bounds on the result.