Enumeration and Random Generation of Concurrent Computations

Abstract : In this paper, we study the shuffle operator on concurrent processes (represented as trees) using analytic combinatorics tools. As a first result, we show that the mean width of shuffle trees is exponentially smaller than the worst case upper-bound. We also study the expected size (in total number of nodes) of shuffle trees. We notice, rather unexpectedly, that only a small ratio of all nodes do not belong to the last two levels. We also provide a precise characterization of what ``exponential growth'' means in the case of the shuffle on trees. Two practical outcomes of our quantitative study are presented: (1) a linear-time algorithm to compute the probability of a concurrent run prefix, and (2) an efficient algorithm for uniform random generation of concurrent runs.
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01197236
Contributor : Coordination Episciences Iam <>
Submitted on : Friday, September 11, 2015 - 12:54:57 PM
Last modification on : Thursday, March 21, 2019 - 2:46:14 PM
Long-term archiving on : Tuesday, December 29, 2015 - 12:34:44 AM

File

dmAQ0108.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01197236, version 1

Citation

Olivier Bodini, Antoine Genitrini, Frédéric Peschanski. Enumeration and Random Generation of Concurrent Computations. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), Jun 2012, Montreal, Canada. pp.83-96. ⟨hal-01197236⟩

Share

Metrics

Record views

533

Files downloads

247