An efficient counting network

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 @Q(lg^2w), 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(nlgw/w), which improves by a logarithmic factor of w over all previously known networks with w wires.

[1]  E. Szemerédi,et al.  O(n LOG n) SORTING NETWORK. , 1983 .

[2]  E. Szemerédi,et al.  Sorting inc logn parallel steps , 1983 .

[3]  Nir Shavit,et al.  Diffracting trees , 1996, TOCS.

[4]  Maurice Herlihy,et al.  Contention in shared memory algorithms , 1993, JACM.

[5]  Nikolaos Hardavellas,et al.  Contention in counting networks , 1994, PODC '94.

[6]  Eli Upfal,et al.  A Steady State Analysis of Diffracting Trees , 1998, Theory of Computing Systems.

[7]  Hagit Attiya,et al.  Counting networks with arbitrary fan-out , 1992, SODA '92.

[8]  Nikolaos Hardavellas,et al.  Notes on Sorting and Counting Networks (Extended Abstract) , 1993, WDAG.

[9]  Maurice Herlihy,et al.  Linearizable counting networks , 1996, Distributed Computing.

[10]  Michael Klugerman,et al.  Small-depth counting networks and related topics , 1994 .

[11]  Maurice Herlihy,et al.  Self-stabilizing smoothing and balancing networks , 2006, Distributed Computing.

[12]  R. Ladner,et al.  Building Counting Networks from Larger Balancers Technical Report # 93-04-09 , 1993 .

[13]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[14]  Maurice Herlihy,et al.  Supporting Increment and Decrement Operations in Balancing Networks , 1999, Chic. J. Theor. Comput. Sci..

[15]  Maurice Herlihy,et al.  Sorting and Counting Networks of Arbitrary Width and Small Depth , 2001, Theory of Computing Systems.

[16]  Marios Mavronicolas,et al.  A combinatorial treatment of balancing networks , 1994, PODC '94.

[17]  Maurice Herlihy,et al.  Counting networks , 1994, JACM.

[18]  Paul G. Spirakis,et al.  The cost of concurrent, low-contention Read&Modify&Write , 2003, Theor. Comput. Sci..

[19]  Thomas Sauerwald,et al.  The impact of randomization in smoothing networks , 2008, PODC '08.

[20]  Srikanta Tirthapura,et al.  Adaptive Counting Networks , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[21]  C. Greg Plaxton,et al.  Small-depth counting networks , 1992, STOC '92.

[22]  Eric N. Klein.  A GENERIC SIMULATION OF COUNTING NETWORKS , 2003 .

[23]  Moti Yung,et al.  Coins, weights and contention in balancing networks , 1994, PODC '94.

[24]  Maurice Herlihy,et al.  Read-modify-write networks , 2003, Distributed Computing.

[25]  Maurice Herlihy,et al.  Randomized smoothing networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[26]  Nikolaos Hardavellas,et al.  Notes on Sorting and Counting Networks , 1993 .

[27]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.