Fragmented objects: boosting concurrency of shared large objects

DOI10.1007/978-3-030-79527-6_7OpenAlexW3173423538MaRDI QIDQ2117716FDOQ2117716

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

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

• Title not available (Why is that?)
• Sharing memory robustly in message-passing systems
• Optimistic Erasure-Coded Distributed Storage
• A coded shared atomic memory algorithm for message passing architectures
• Distributed Computing
• How fast can a distributed atomic read be?
• RADON: Repairable Atomic Data Object in Networks
• Title not available (Why is that?)
• Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement

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)