Acceleration of perfect sampling by skipping events - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Acceleration of perfect sampling by skipping events

(1) , (1) , (2)
1
2
Ana Bušić
Bruno Gaujal

Abstract

This paper presents a new method to speed up perfect sampling of Markov chains by skipping passive events during the simulation. We show that this can be done without altering the distribution of the samples. This technique is particularly efficient for the simulation of Markov chains with different time scales such as queueing networks where certain servers are much faster than others. In such cases, the coupling time of the Markov chain can be arbitrarily large while the runtime of the skipping algorithm remains bounded. This is further illustrated by several experiments that also show the role played by the entropy of the system in the performance of our algorithm.
Not file

Dates and versions

hal-00788799 , version 1 (15-02-2013)

Identifiers

  • HAL Id : hal-00788799 , version 1

Cite

Furcy Pin, Ana Bušić, Bruno Gaujal. Acceleration of perfect sampling by skipping events. VALUETOOLS '11 - 5th International ICST Conference on Performance Evaluation Methodologies and Tools, May 2011, Paris, France. pp.207-216. ⟨hal-00788799⟩
291 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More