Timing conditions for linearizability in uniform counting networks

DOI10.1016/S0304-3975(98)00237-0zbMATH Open0916.68028MaRDI QIDQ1292426FDOQ1292426

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

Publication date: 21 June 1999

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

Recommendations

• Linearizable counting networks
• Reachability in timed counter systems
• Sequentially consistent versus linearizable counting networks
• Verification of a class of self-timed computational networks
• Counting Models of Linear-Time Temporal Logic
• Liveness of parameterized timed networks
• Reducing quasi-equal clocks in networks of timed automata
• scientific article; zbMATH DE number 1955911
• scientific article; zbMATH DE number 791802
• Towards optimal synchronous counting

zbMATH Keywords

data structuretiming analysislinearizabilityempirical evaluationcounting network

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

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

Cited In (4)

• Linearizable counting networks
• Read-modify-write networks
• Counting networks
• Sequentially consistent versus linearizable counting networks

Uses Software

• PROTEUS

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

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