Concurrent counting is harder than queuing
type: Item
instance of: scholarly article
title: Concurrent counting is harder than queuing
zbMATH Open document ID: 1205.68503
author: Costas Busch
author: Srikanta Tirthapura
published in: Theoretical Computer Science
publication date: 2010-11-11T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 5815224
zbMATH Keywords: distributed algorithms
zbMATH Keywords: distributed data structures
zbMATH Keywords: distributed counting
zbMATH Keywords: distributed queuing
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.07.002
OpenAlex ID: W1978890639
Wikidata QID: Q60148586
cites work: Counting networks
cites work: The cost of concurrent, low-contention Read \& Modify \& Write
cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
cites work: Q4436061
cites work: Competitive concurrent distributed queuing
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
cites work: An inherent bottleneck in distributed counting
DOI: 10.1016/J.TCS.2010.07.002
Recommended article: Concurrent counting
Recommended article: Towards optimal synchronous counting
Recommended article: Deciding Which Queue to Join: Some Counterexamples
Recommended article: An inherent bottleneck in distributed counting
Recommended article: When queueing is better than push and shove
Recommended article: Competitive concurrent distributed queuing
Recommended article: Q3835043
Recommended article: Concurrent access of priority queues
description: scientific article; zbMATH DE number 5815224