Skip to main content
SpringerLink
Log in
Book cover

International Conference on Vector and Parallel Processing

International Conference on Parallel Processing

VAPP 1992, CONPAR 1992: Parallel Processing: CONPAR 92—VAPP V pp 31–36Cite as

Connection Machine results for pyramid embedding algorithms

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 634))

Abstract

A comparative analysis for four algorithms that embed pyramids into hypercubes is presented in this paper. Relevant results for a Connection Machine system CM-2 with 16,384 processors are included.

This work was supported by the National Science Foundation under Grant CCR-9109084.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Stout, Q.F., “Hypercubes and Pyramids,” in Pyramidal Systems for Computer Vision, Cantoni and S. Levialdi (Eds.), Spring-Verlag, Berlin, Heidelberg, Germany (1986), pp. 74–89.

    Google Scholar 

  2. Lai, T.-H. and White, W.,“Mapping Pyramid Algorithms into Hypercubes,” Journal Parallel Distributed Computing, Vol. 9 (1990), pp. 42–54.

    Google Scholar 

  3. Ziavras, S.G., “Techniques for Mapping Deterministic Algorithms onto Multi-Level Systems,” in Proc. Intern. Conf. Parallel Processing, Vol. I, Chicago, IL (Aug. 1990), pp. 226–233.

    Google Scholar 

  4. Ziavras, S.G., “Efficient Mapping Algorithms for a Class of Hierarchical Systems,” IEEE Trans. Parallel Distributed Systems, Accepted for Publication.

    Google Scholar 

  5. Patel, S.C. and Ziavras, S.G., “Comparative Analysis of Techniques that Map Hierarchical Structures into Hypercubes,” in Proc. Parallel Distributed Computing Systems Conf., Washington, D.C. (Oct. 1991), pp. 295–299.

    Google Scholar 

  6. Ziavras, S.G., “On the Problem of Expanding Hypercube-Based Systems,” Journal Parallel Distributed Computing, Accepted for Publication.

    Google Scholar 

  7. Burt, P.J., Hong, T.-H., and Rosenfeld, A., “Segmentation and Estimation of Image Region Properties Through Cooperative Hierarchical Computation,” IEEE Trans. Systems Man Cybernetics, Vol. 11, No. 12 (Dec. 1981), pp. 802–809.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, New Jersey Institute of Technology, 07102, Newark, New Jersey, USA

    Sotirios G. Ziavras

Authors
  1. Sotirios G. Ziavras
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luc Bougé Michel Cosnard Yves Robert Denis Trystram

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ziavras, S.G. (1992). Connection Machine results for pyramid embedding algorithms. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_394

Download citation

  • DOI: https://doi.org/10.1007/3-540-55895-0_394

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55895-8

  • Online ISBN: 978-3-540-47306-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation