Fragmented objects: boosting concurrency of shared large objects

DOI10.1007/978-3-030-79527-6_7MaRDI QIDQ2117716zbMATH OpenOpenAlexFDO

Authors Antonio Fernández Anta, Chryssis Georgiou, Theophanis Hadjistasi, Nicolas Nicolaou, Efstathios Stavrakis, Andria Trigeorgi

Publication date 22 March 2022

Full work available at URL https://arxiv.org/abs/2102.12786

zbMATH Keywords

linearizabilitydistributed storagecoverabilitylarge objects

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• A coded shared atomic memory algorithm for message passing architectures
• Brief announcement: Collect in the presence of continuous churn with application to snapshots and lattice agreement
• Computationally light ``multi-speed atomic memory
• Efficient replication of large data objects
• How fast can a distributed atomic read be?
• Optimistic Erasure-Coded Distributed Storage
• Radon: repairable atomic data object in networks
• Sharing memory robustly in message-passing systems

Cited in

(1)

• Relative Store Fragments for Singleton Abstraction

This page was built for publication: Fragmented objects: boosting concurrency of shared large objects

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