The following pages link to Linearizable counting networks (Q5137016):
Displaying 13 items.
- An efficient counting network (Q986532) (← links)
- Timing conditions for linearizability in uniform counting networks (Q1292426) (← links)
- Linearizable read/write objects (Q1292436) (← links)
- The cost of concurrent, low-contention Read \& Modify \& Write (Q1770373) (← links)
- Public data structures: counters as a special case. (Q1853535) (← links)
- The counting pyramid: an adaptive distributed counting scheme (Q1881286) (← links)
- Bounded-wait combining: constructing robust and high-throughput shared objects (Q2377268) (← links)
- Long-lived counters with polylogarithmic amortized step complexity (Q2689836) (← links)
- A Lower Bound on Wait-Free Counting (Q4349696) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Read-modify-write networks (Q5138502) (← links)
- Sequentially consistent versus linearizable counting networks (Q5919901) (← links)
- Threshold counters with increments and decrements (Q5958332) (← links)