Skip to main content
SpringerLink
Log in

Hypercube sandwich approach to conferencing

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

This paper presents a novel cascaded conference network that provides distributed processing and signal transmission among members of disjoint sets of generic send/receive devices called conferees. It assumes an online request model in which idle groups of conferees may request the formation of a conference interconnection. Once a conference is established, all conferees remain connected until the entire conference is dissolved. The Hypercube Sandwich Network (HSN) consists of two components. A bidirectional permutation network is used for routing purposes to and from a hypercube of special processing elements for the purpose of conference formation. The HSN achieves strictly nonblocking performance for N conferees using O(N√log N) processing elements, and this is shown to be tight to within a log 1/4 N factor. Previous constructions required a quadratic number of processing elements for strictly nonblocking performance or could only provide wide-sense nonblocking conferencing. If the stronger requirement is made that the communication delay is logarithmic in the conference size, a simple algorithm is presented for wide-sense nonblocking conferencing in an HSN with O(N log N) processing elements.

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. H. L. Abbott and M. Katchalski. On the snake in the box problem. Journal of Combinatorial Theory, Series B, 45: 13–24, 1988.

    Google Scholar 

  2. R. Ahlswede and K.U. Koschnick. Note on an extremal problem arising for unreliable networks in parallel computing. Discrete Mathematics, 47: 137–152, 1983.

    Google Scholar 

  3. B. Becker and H.-U. Simon. How robust is the n-cube?Information and Computation, 77: 162–178, 1988.

    Google Scholar 

  4. V.E. Beneš. Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, 1965.

  5. J. Bruck, R. Cypher, and D. Soroker. Tolerating faults in hypercubes using subcube partitioning. IEEE Transactions on Computers, 41(5): 599–605, 1992.

    Google Scholar 

  6. D.G. Cantor. On non-blocking switching networks. Networks, 1: 367–377, 1972.

    Google Scholar 

  7. P. Feldman, J. Friedman, and N. Pippenger. Wide-sense nonblocking networks. SIAM Journal of Discrete Mathematics, 1(2): 158–173, 1988.

    Google Scholar 

  8. J.F. Houlahan, L.J. Cowen, and G.M. Masson. Hypercube sandwich approach to conferencing. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications '95, pp. 481–490, 1995.

  9. J. F. Houlahan. Sandwich networks for conferencing. Ph.D. Thesis. Johns Hopkins University, Department of Computer Science, 1996.

  10. F.K. Hwang. Rearrangeability of multi-connection three-stage Clos networks. Networks, 2: 301–306, 1972.

    Google Scholar 

  11. F.K. Hwang. Three-stage multiconnection networks which are nonblocking in the wide sense. Bell System Technical Journal, 58(10): 2183–2187, 1979.

    Google Scholar 

  12. F.K. Hwang and A. Jajszczyk. On nonblocking multiconnection networks. IEEE Transactions on Communications, COM-34(10): 1038–1041, 1986.

    Google Scholar 

  13. A. Jajszczyk. Comments on “Three-stage multiconnection networks which are nonblocking in the wide sense”. Bell System Technical Journal, 62: 2113–2114, 1983.

    Google Scholar 

  14. D.J. Kleitman. On a problem of Yuzvinsky on separating the n-cube. Discrete Mathematics, 60: 207–213, 1986.

    Google Scholar 

  15. F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufman, 1992.

  16. J.S. Turner. Practical wide-sense non-blocking generalized connectors. Washington University Technical Report WUCS-88-29, 1988.

  17. J. Wojciechowski. A new lower bound for snake-in-the-box codes. Combinatorica, 9(1): 91–99, 1989.

    Google Scholar 

  18. D.R. Woodall. The Bay Restaurant—A linear storage problem. American Math. Monthly: 240–246, March 1974.

  19. Y. Yang and G.M. Masson. Rearrangeable broadcast ring sandwich networks. IEEE Transactions on Computers, 44 (10): 1169–1180, 1995.

    Google Scholar 

  20. E. W. Zegura. Analysis of switching networks for multiport and multivariate communication. Ph.D. Thesis, Washington University, 1993.

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, The Johns Hopkins University, 21218, Baltimore, MD, USA

    Joanne F. Houlahan, Lenore J. Cowen & Gerald M. Masson

Authors
  1. Joanne F. Houlahan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lenore J. Cowen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gerald M. Masson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Houlahan, J.F., Cowen, L.J. & Masson, G.M. Hypercube sandwich approach to conferencing. J Supercomput 10, 271–283 (1996). https://doi.org/10.1007/BF00130110

Download citation

  • Issue Date:

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

Keywords

Search

Navigation