Distributed match-making

DOI10.1007/BF01762123zbMath0652.68053MaRDI QIDQ1107317

Paul M. B. Vitányi, Sape J. Mullender

Publication date: 1988

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

distributed controlcomputer networkcommunication complexitydistributed algorithmdistributed match-makingstorage complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of software (68N99)

Related Items (12)

Optimal availability quorum systems: theory and practice ⋮ Load balancing in quorum systems ⋮ A note on weighted distributed match-making ⋮ Randomized leader election ⋮ Crumbling walls: a class of practical and efficient quorum systems ⋮ Synchronous Byzantine quorum systems ⋮ Compact and localized distributed data structures ⋮ The availability of crumbling wall quorum systems ⋮ Linear election in pancake graphs ⋮ A class of deadlock-free Maekawa-type algorithms for mutual exclusion in distributed systems ⋮ Resource finding in store-and-forward networks ⋮ Planar quorums

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Scheme for Fast Parallel Communication
• Reverse path forwarding of broadcast packets
• The mutual exclusion problem

This page was built for publication: Distributed match-making