Timing conditions for linearizability in uniform counting networks

DOI10.1016/S0304-3975(98)00237-0zbMath0916.68028MaRDI QIDQ1292426

Dan Touitou, Nir Shavit, Nancy A. Lynch, Alexander A. Schwarzmann

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

linearizabilityempirical evaluationtiming analysisdata structurecounting network

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

Read-modify-write networks ⋮ Sequentially consistent versus linearizable counting networks

Uses Software

• PROTEUS

Cites Work

• Unnamed Item
• The serializability of concurrent database updates
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Bounds on the time to reach agreement in the presence of timing uncertainty
• Are wait-free algorithms fast?
• Coins, weights and contention in balancing networks
• A combinatorial treatment of balancing networks
• On the Number of Stable States in a NOR Network

This page was built for publication: Timing conditions for linearizability in uniform counting networks