Atomic data access in distributed hash tables

DOI10.1007/3-540-45748-8_28MaRDI QIDQ4709174zbMATH OpenFDO

Authors Dahlia Malkhi, David Ratajczak, Nancy Lynch

Publication date 20 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2429/24290295.htm

Mathematics Subject Classification ID

Distributed systems (68M14) Computing methodologies and applications (68U99)

Recommendations

• Fast access to distributed atomic memory
• RAMBO: A reconfigurable atomic memory service for dynamic networks
• Towards a scalable and robust DHT
• Dynamic atomic storage without consensus
• Efficient semantic search on DHT overlays

Cited in

(6)

• Concurrent maintenance of rings
• D2B: A de Bruijn based content-addressable network
• Dynamic atomic storage without consensus
• Partially ordered knowledge sharing and fractionated systems in the context of other models for distributed computing
• How fast can a distributed atomic read be?
• Maintaining the Ranch topology

This page was built for publication: Atomic data access in distributed hash tables

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