Read-modify-write networks

DOI10.1007/S00446-003-0097-5MaRDI QIDQ5138502zbMATH OpenOpenAlexFDO

Authors Panagiota Fatourou, Maurice Herlihy

Publication date 4 December 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-003-0097-5

zbMATH Keywords

algebraic propertydistributed data structurehigh latency

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• The cost of concurrent, low-contention Read \& Modify \& Write
• scientific article; zbMATH DE number 2006662
• An efficient counting network
• Linearizable counting networks
• Counting networks

Cites work

• A combinatorial treatment of balancing networks
• A Lower Bound on Wait-Free Counting
• An efficient counting network
• An inherent bottleneck in distributed counting
• Combining funnels: A dynamic approach to software combining
• Contention in shared memory algorithms
• Counting networks
• Efficient synchronization of multiprocessors with shared memory
• Elimination trees and the construction of pools and stacks
• scientific article; zbMATH DE number 742955 (Why is no real title available?)
• Linearizable counting networks
• Sequentially consistent versus linearizable counting networks
• Sorting and counting networks of arbitrary width and small depth
• Supporting increment and decrement operations in balancing networks
• Timing conditions for linearizability in uniform counting networks

Cited in

(3)

• The cost of concurrent, low-contention Read \& Modify \& Write
• scientific article; zbMATH DE number 2006662 (Why is no real title available?)
• An efficient counting network

This page was built for publication: Read-modify-write networks

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