Dynamic analysis of the arrow distributed protocol

DOI10.1007/s00224-006-1251-9zbMath1113.68025OpenAlexW2015077309WikidataQ56610575 ScholiaQ56610575MaRDI QIDQ863197

Srikanta Tirthapura, Fabian Kuhn, Roger Wattenhofer, Maurice P. Herlihy

Publication date: 25 January 2007

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://doc.rero.ch/record/319995/files/224_2006_Article_1251.pdf

zbMATH Keywords

distributed queuing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Network protocols (68M12)

Related Items (6)

Pathlength of outerplanar graphs ⋮ A fast distributed approximation algorithm for minimum spanning trees ⋮ An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs ⋮ Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences ⋮ Distributed transactional memory for general networks ⋮ An analysis framework for distributed hierarchical directories

This page was built for publication: Dynamic analysis of the arrow distributed protocol