Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability

DOI10.1016/S0304-3975(98)00224-2zbMath0944.68195OpenAlexW2164096633WikidataQ127942801 ScholiaQ127942801MaRDI QIDQ1575646

N. Delaunay

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00224-2

zbMATH Keywords

randomized algorithmmultiparty interactionstrong interaction fairnessweak interaction fairness

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) General topics in the theory of software (68N01)

Related Items (2)

Generating non-conspiratorial executions ⋮ Hundreds of impossibility results for distributed computing

Uses Software

• Ada95
• LOTOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A distributed synchronization scheme for fair multi-process handshakes
• Calculi for synchrony and asynchrony
• Script: A communication abstraction mechanism and its verification
• Appraising fairness in languages for distributed programming
• A calculus of mobile processes. I
• A calculus of mobile processes. II
• Some impossibility results in interprocess synchronization
• Real-Time Synchronization of Interprocess Communications
• An Effective Implementation for the Generalized Input-Output Construct of CSP
• Distributed cooperation with action systems
• Communicating sequential processes
• A comprehensive study of the complexity of multiparty interaction

This page was built for publication: Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability