Competitive concurrent distributed queuing

DOI10.1145/383962.384001MaRDI QIDQ2787673zbMATH OpenOpenAlexFDO

Authors Srikanta Tirthapura, Roger Wattenhofer, Maurice 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

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

Recommendations

• Dynamic analysis of the arrow distributed protocol
• Dynamic analysis of the Arrow distributed directory protocol in general networks
• Concurrent counting is harder than queuing
• scientific article; zbMATH DE number 2006654
• The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms

Cited in

(18)

• 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
• scientific article; zbMATH DE number 1696666 (Why is no real title available?)
• scientific article; zbMATH DE number 2006654 (Why is no real title available?)
• Distributed queuing in dynamic networks
• Compositional competitiveness for distributed algorithms
• Euclidean Steiner spanners: light and sparse
• A tight bound on approximating arbitrary metrics by tree metrics
• Concurrent counting is harder than queuing
• Online Spanners in Metric Spaces
• Dynamic analysis of the Arrow distributed directory protocol in general networks
• Concurrent expandable AMQs on the basis of quotient filters
• Spanners in sparse graphs
• Online spanners in metric spaces
• On euclidean Steiner (1+)-spanners
• Light Euclidean Steiner spanners in the plane

This page was built for publication: Competitive concurrent distributed queuing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2787673)