Competitive concurrent distributed queuing
From MaRDI portal
Publication:2787673
DOI10.1145/383962.384001zbMath1333.68062MaRDI 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
68R10: Graph theory (including graph drawing) in computer science
90C59: Approximation methods and heuristics in mathematical programming
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68M14: Distributed systems
68M12: Network protocols
Related Items
Euclidean Steiner Spanners: Light and Sparse, A tight bound on approximating arbitrary metrics by tree metrics, Online Spanners in Metric Spaces, Concurrent counting is harder than queuing, Spanners in sparse graphs, Spanners of bounded degree graphs, Distributed transactional memory for metric-space networks, Distributed transactional memory for general networks, Online graph exploration on trees, unicyclic graphs and cactus graphs