Competitive concurrent distributed queuing

DOI10.1145/383962.384001zbMath1333.68062OpenAlexW1969588170MaRDI QIDQ2787673

Roger Wattenhofer, Srikanta Tirthapura, Maurice P. Herlihy

Publication date: 4 March 2016

Published in: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/383962.384001

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Network protocols (68M12)

Related Items (9)

Euclidean Steiner Spanners: Light and Sparse ⋮ Online graph exploration on trees, unicyclic graphs and cactus graphs ⋮ Concurrent counting is harder than queuing ⋮ Spanners of bounded degree graphs ⋮ Online Spanners in Metric Spaces ⋮ Distributed transactional memory for metric-space networks ⋮ Spanners in sparse graphs ⋮ Distributed transactional memory for general networks ⋮ A tight bound on approximating arbitrary metrics by tree metrics

This page was built for publication: Competitive concurrent distributed queuing