Timing conditions for linearizability in uniform counting networks
type: Item
instance of: scholarly article
title: Timing conditions for linearizability in uniform counting networks
zbMATH Open document ID: 0916.68028
DOI: 10.1016/S0304-3975(98)00237-0
author: Dan Touitou
author: Nancy Lynch
author: Nir Shavit
author: Alexander A. Schwarzmann
published in: Theoretical Computer Science
publication date: 1999-06-21T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 1306149
zbMATH Keywords: counting network
zbMATH Keywords: timing analysis
zbMATH Keywords: linearizability
zbMATH Keywords: data structure
zbMATH Keywords: empirical evaluation
describes a project that uses: PROTEUS
MaRDI profile type: Publication
cites work: Coins, weights and contention in balancing networks
cites work: Bounds on the time to reach agreement in the presence of timing uncertainty
cites work: Are wait-free algorithms fast?
cites work: On the Number of Stable States in a NOR Network
cites work: A combinatorial treatment of balancing networks
cites work: Q3619797
cites work: How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
cites work: The serializability of concurrent database updates
Recommended article: Linearizable counting networks
Recommended article: Reachability in Timed Counter Systems
Recommended article: Sequentially consistent versus linearizable counting networks
Recommended article: Verification of a class of self-timed computational networks
Recommended article: Counting Models of Linear-Time Temporal Logic
Recommended article: Liveness of Parameterized Timed Networks
Recommended article: Reducing Quasi-Equal Clocks in Networks of Timed Automata
Recommended article: Q4417609
Recommended article: Q4845010
Recommended article: Towards optimal synchronous counting
description: scientific article; zbMATH DE number 1306149