Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency

Abstract

In this paper we address the problem of understanding Concurrency Theory from a combinatorial point of view. We are interested in quantitative results and algorithmic tools to refine our understanding of the classical combinatorial explosion phenomenon arising in concurrency. This paper is essentially focusing on the the notion of synchronization from the point of view of combinatorics. As a first step, we address the quantitative problem of counting the number of executions of simple processes interacting with synchronization barriers. We elaborate a systematic decomposition of processes that produces a symbolic integral formula to solve the problem. Based on this procedure, we develop a generic algorithm to generate process executions uniformly at random. For some interesting sub-classes of processes we propose very efficient counting and random sampling algorithms. All these algorithms have one important characteristic in common: they work on the control graph of processes and thus do not require the explicit construction of the state-space.

Keywords

• uniform random generation
• fork-join processes
• promises
• partial order theory
• barrier synchronization
• combinatorics
• [info.info-dm]computer science [cs]/discrete mathematics [cs.dm]
• [info.info-ds]computer science [cs]/data structures and algorithms [cs.ds]