The PSMH: a pyramid of fractional dimension

Author

Hecquard, Jean ; Acharya, Raj

Author_Institution

Dept. of Electr. Eng., & Comput. Sci., State Univ. of New York., Amherst, NY, USA

fYear

1988

fDate

10-12 Oct 1988

Firstpage

475

Lastpage

478

Abstract

The authors present the partitionable spanning multibus hypercube (PSMH) interconnection network. The aim is to provide an architecture for applications with spatially distributed data. The data are embedded on the PSMH by hierarchical data structures, the n-dimensional binary trees. A special case of the PSMH, designed for the manipulation and display of three-dimensional objects, is discussed in detail. On the basis of PSMH features and the properties of the data structure, a routage algorithm is derived, and it is shown how data can be packed to reduce the PSMH size

Keywords

computer graphics; data structures; multiprocessor interconnection networks; parallel architectures; trees (mathematics); PSMH; fractional dimension; hierarchical data structures; interconnection network; n-dimensional binary trees; partitionable spanning multibus hypercube; pyramid; routage algorithm; spatially distributed data; three-dimensional objects; Application software; Binary trees; Computer architecture; Computer science; Data structures; Hypercubes; Image processing; Multiprocessor interconnection networks; Three dimensional displays; Tree data structures;

fLanguage

English

Publisher

ieee

Conference_Titel

Frontiers of Massively Parallel Computation, 1988. Proceedings., 2nd Symposium on the Frontiers of

Conference_Location

Fairfax, VA

Print_ISBN

0-8186-5892-4

Type

conf

DOI

10.1109/FMPC.1988.47404

Filename

47404