TY - JOUR

T1 - An efficient counting network

AU - Busch, Costas

AU - Mavronicolas, Marios

N1 - Funding Information:
We are indebted to the anonymous referee for providing very useful comments and corrections that helped to improve the paper significantly. We are also indebted to Maurice Herlihy for providing invaluable comments on an earlier version of this paper. The second author was supported by funds for the promotion of research at University of Cyprus.

PY - 2010/7/17

Y1 - 2010/7/17

N2 - We present a novel counting network construction, where the number of input wires w is smaller than or equal to the number of output wires t. The depth of our network is Θ(lg2w), which depends only on w. In contrast, the amortized contention of the network depends on the number of concurrent processes n and the parameters w and t. This offers more flexibility than all previously known networks, with the same number w of input and output wires, whose contention depends only on two parameters, w and n. In case n>wlgw, by choosing t>wlgw the contention of our network is O(nlgww), which improves by a logarithmic factor of w over all previously known networks with w wires.

AB - We present a novel counting network construction, where the number of input wires w is smaller than or equal to the number of output wires t. The depth of our network is Θ(lg2w), which depends only on w. In contrast, the amortized contention of the network depends on the number of concurrent processes n and the parameters w and t. This offers more flexibility than all previously known networks, with the same number w of input and output wires, whose contention depends only on two parameters, w and n. In case n>wlgw, by choosing t>wlgw the contention of our network is O(nlgww), which improves by a logarithmic factor of w over all previously known networks with w wires.

KW - Balancing network

KW - Contention

KW - Counting network

KW - Distributed data structure

KW - Shared memory

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

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

U2 - 10.1016/j.tcs.2010.04.023

DO - 10.1016/j.tcs.2010.04.023

M3 - Article

AN - SCOPUS:77955419583

VL - 411

SP - 3001

EP - 3030

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 34-36

ER -