Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency

Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency

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 essential...

Full description

Bibliographic Details
Main Authors: OLivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2021-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
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]
Online Access:https://dmtcs.episciences.org/5820/pdf

Similar Items

Similar Items