An inherent bottleneck in distributed counting
type: Item
instance of: scholarly article
title: An inherent bottleneck in distributed counting
zbMATH Open document ID: 0983.68043
author: Roger Wattenhofer
author: Peter Widmayer
published in: Journal of Parallel and Distributed Computing
publication date: 1998-08-20T00:00:00Z
full work available at URL: http://hdl.handle.net/20.500.11850/68791
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 1192559
zbMATH Keywords: distributed data structures
zbMATH Keywords: distributed counting
zbMATH Keywords: hot-spot
zbMATH Keywords: distributed algorithm
MaRDI profile type: Publication
OpenAlex ID: W2086282679
DOI: 10.1006/JPDC.1998.1431
Recommended article: Distributed counting along lossy paths without feedback
Recommended article: The counting pyramid: an adaptive distributed counting scheme
Recommended article: Towards optimal synchronous counting
Recommended article: On Local Distributed Sampling and Counting
Recommended article: Efficient decentralized algorithms for the distributed trigger counting problem
Recommended article: Scalable eventually consistent counters over unreliable networks
Recommended article: Data structures for distributed counting
Recommended article: A construction of distributed reference counting
Recommended article: Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed Computing
description: scientific article; zbMATH DE number 1192559