f -arrays
From MaRDI portal
Publication:5170887
DOI10.1145/571825.571875zbMath1292.68028OpenAlexW2030333832MaRDI QIDQ5170887
Publication date: 25 July 2014
Published in: Proceedings of the twenty-first annual symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/571825.571875
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Distributed systems (68M14)
Related Items (9)
Lower and upper bounds for single-scanner snapshot implementations ⋮ Recoverable mutual exclusion with abortability ⋮ A time complexity lower bound for adaptive mutual exclusion ⋮ The RedBlue family of universal constructions ⋮ Closing the complexity gap between FCFS mutual exclusion and mutual exclusion ⋮ The complexity of updating snapshot objects ⋮ Recoverable mutual exclusion ⋮ The F-Snapshot Problem ⋮ Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity
This page was built for publication: f -arrays
