An 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 tles/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 Theta/(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 network constructions of width t.

Original languageEnglish (US)
Title of host publicationProceedings of the 1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, IPPS/SPDP 1998
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages380-384
Number of pages5
ISBN (Electronic)0818684038, 9780818684036
DOIs
StatePublished - 1998
Externally publishedYes
Event1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, IPPS/SPDP 1998 - Orlando, United States
Duration: Mar 30 1998Apr 3 1998

Publication series

NameProceedings of the 1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, IPPS/SPDP 1998
Volume1998-March

Conference

Conference1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, IPPS/SPDP 1998
CountryUnited States
CityOrlando
Period3/30/984/3/98

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications

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

Cite this