TY - GEN

T1 - Efficient counting network

AU - Busch, Costas

AU - Mavronicolas, Marios

N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031672633&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031672633&partnerID=8YFLogxK

U2 - 10.1109/IPPS.1998.669944

DO - 10.1109/IPPS.1998.669944

M3 - Conference contribution

AN - SCOPUS:0031672633

SN - 0818684046

T3 - Proceedings of the International Parallel Processing Symposium, IPPS

SP - 380

EP - 384

BT - Proceedings of the International Parallel Processing Symposium, IPPS

A2 - Anon, null

T2 - Proceedings of the 1998 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing

Y2 - 30 March 1998 through 3 April 1998

ER -