Constructing Shared Objects That Are Both Robust and High-Throughput

DOI10.1007/11864219_30zbMATH Open1155.68333OpenAlexW1495437565MaRDI QIDQ3524323FDOQ3524323

Authors: Danny Hendler, Shay Kutten 

Publication date: 9 September 2008

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

Full work available at URL: https://doi.org/10.1007/11864219_30

Recommendations

• Bounded-wait combining: constructing robust and high-throughput shared objects
• Concurrent counting (extended abstract)
• Linearizable counting networks
• Concurrent counting
• The counting pyramid: an adaptive distributed counting scheme

Mathematics Subject Classification ID

Distributed systems (68M14)

Cited In (7)

• Title not available (Why is that?)
• The behavior of shared objects: Concept, pitfalls, and a new model
• Bounded-wait combining: constructing robust and high-throughput shared objects
• Shared-object system equilibria: delay and throughput analysis
• The counting pyramid: an adaptive distributed counting scheme
• Combining funnels: A dynamic approach to software combining
• SNZI, scalable nonzero indicators

This page was built for publication: Constructing Shared Objects That Are Both Robust and High-Throughput

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