Efficient counting network

Costas Busch, Marios Mavronicolas

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations

Abstract

Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar to that of sorting networks. High-performance asynchronous multiprocessing requires counting networks to both have small depth and incur low contention. In order to achieve this, we relax in this work the requirement that the input width of the counting network is equal to its output width. More specifically, we present an explicit, deterministic construction of a counting network with t input width and w output width, where t≤w, t = 2k and w = p2l. This construction is practical and achieves depth O(lg2 t) which is independent from the output width w. Furthermore, by taking w to be Θ(t lg t) it incurs an amortized contention of the order O((n lg t)/t), where n is the concurrency, which improves by a logarithmic factor over all previously known practical counting networks constructions of width t.

Original languageEnglish (US)
Title of host publicationProceedings of the International Parallel Processing Symposium, IPPS
Editors Anon
Pages380-384
Number of pages5
DOIs
StatePublished - 1998
Externally publishedYes
EventProceedings of the 1998 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing - Orlando, FL, USA
Duration: Mar 30 1998Apr 3 1998

Publication series

NameProceedings of the International Parallel Processing Symposium, IPPS
ISSN (Print)1063-7133

Conference

ConferenceProceedings of the 1998 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing
CityOrlando, FL, USA
Period3/30/984/3/98

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Efficient counting network'. Together they form a unique fingerprint.

Cite this