Skip to main content
SpringerLink
Log in

Counting networks with arbitrary fan-out

  • Published:
Distributed Computing Aims and scope Submit manuscript

Summary

It is shown that an acyclic smoothing network (and hence counting network) with fan-outn cannot be constructed from balancers of fan-outb 1,...,b k , if there exists a prime factorp ofn, such thatp does not divideb i , for alli, 1≦i≦k. This holds regardless of the depth, fan-in or size of the network, as long as they are finite. On the positive side, a simple construction ofcyclic counting networks with fan-outn, for arbitraryn, is presented. An acyclic counting network with fan-in and fan-outp2k, for any integerk≧0, is constructed out of 2-balancers andp-balancers.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Anderson TE: The performance implications of spin-waiting alternatives for shared-memory multiprocessors. IEEE Trans Parallel Distrib Syst 1(1): 6–16 (1990)

    Google Scholar 

  2. Aspnes, J, Herlihy MP, Shavit N: Counting networks and multiprocessor coordination. J ACM 41(5): 1020–1048 (1994)

    Google Scholar 

  3. Ajtai M, Komlos J, Szemeredi E. AnO(n logn) sorting network. Proceedings of the 15th ACM Symposium on the Theory of Computing, 1983, pp 1–9

  4. Batcher KE: Sorting networks and their applications. Proceedings of AFIPS Joint Computer Conference, 1968, vol 32, pp 334–338

    Google Scholar 

  5. Busch C, Mavronicolas M: A combinatorial treatment of balancing networks. Proceedings of the 13th ACM Symposium on Principles of Distributed Computing, 1994, pp 206–215

  6. Cormen TH, Leiserson CE, Rivest RL: Introduction to algorithms. MIT Press, Cambridge MA, 1990

    Google Scholar 

  7. Dowd M, Perl Y, Rudolph L, Saks M: The periodic balanced sorting network. J ACM 36(4): 738–757 (1989)

    Google Scholar 

  8. Felten E, LaMarca A, Ladner R: Building counting networks from larger balancers. Technical Report #93-04-09, Department of Computer Science and Engineering, University of Washington, April 1993

  9. Hardavellas N, Karakos D, Mavronicolas M: Notes on sorting and counting networks. In: Schiper A (ed) Proceedings of the 7th International Workshop on Distributed Algorithms, Lausanne, Switzerland September 1993. Lect Notes Comput Sci vol 725, pp 234–248, Springer, Berlin Heidelberg New York

  10. Herlihy MP, Shavit N, Waarts O: Low contention linearizable counting networks. Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, 1991, pp 526–535

  11. Herlihy MP, Lim B-H, Shavit N: Low contention load balancing on large scale multiprocessors. Proceedings of the 4th ACM Symposium on Parallel Algorithms and Architectures, June 1992. Also: Technical Report CRL 92/6, Digital Equipment Corporation, Cambridge Research Laboratory, May 1992

  12. Klugerman M: Lecture #17, MIT/LCS/RSS-15, 1991, pp 153–161

  13. Klugerman M, Plaxton G: Small-depth counting networks. Proceedings of the 24th ACM Symposium on Theory of Computing, 1992, pp 417–428

  14. Moran S, Taubenfeld G: A lower bound on wait-free counting. Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, Ithaca, New-York, August 1993, pp 251–259

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Technion, 32000, Haifa, Israel

    Eran Aharonson & Hagit Attiya

Authors
  1. Eran Aharonson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hagit Attiya
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Eran Aharonson received the B.A. and M.Sc. degrees in Computer Science from the Technion, Israel Institute of Technology (Haifa, Israel) in 1989 and 1992, respectively. He is currently vice president for research and development at ART-Advanced Recognition Technolgies Ltd., a company dedicated to handwriting and voice recognition. His general research interests are distributed computation, theoretical computer science and pattern recognition.

Hagit Attiya received the B.Sc. degree in Mathematics and Computer Science from the Hebrew University of Jerusalem, in 1981, the M.Sc. and Ph.D. degrees in Computer Science from the Hebrew University of Jerusalem, in 1983 and 1987, respectively. She is presently a senior lecturer at the department of Computer Science at the Technion, Israel Institute of Technology. Prior to this, she has been a post-doctoral research associate at the Laboratory for Computer Science at M.I.T. Her general research interests are distributed computation and theoretical computer science. More specific interests include fault-tolerance, timing-based and asynchronous algorithms.

A preliminary version of this paper appears in proceedings of the3rd Annual ACM-SIAM Symposium on Discrete Algorithms, January 1992, pp. 104–113. This research was supported by Technion V.P.R.-B. and G. Greenberg Research Fund (Ottawa)

Supported by Rashi Enterprise graduate fellowship

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aharonson, E., Attiya, H. Counting networks with arbitrary fan-out. Distrib Comput 8, 163–169 (1995). https://doi.org/10.1007/BF02242734

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02242734

Key words

Search

Navigation