The Combinatorics of Barrier Synchronization

DOI10.1007/978-3-030-21571-2_21arXiv1907.04243MaRDI QIDQ6144224

Matthieu Dien, Olivier Bodini, Frédéric Peschanski, Antoine Genitrini

Publication date: 29 January 2024

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.04243

zbMATH Keywords

uniform random generationbarrier synchronization

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• A quantitative study of pure parallel processes
• Two poset polytopes
• Two algorithms for barrier synchronization
• A calculus for the random generation of labelled combinatorial structures
• Fast perfect sampling from linear extensions
• Entropic uniform sampling of linear extensions in series-parallel posets
• Uniform Generation in Trace Monoids
• The Combinatorics of Non-determinism
• Beyond series-parallel concurrent systems: the case of arch processes
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: The Combinatorics of Barrier Synchronization