Abstract
This chapter analyzes pyramid algorithms for solving the problems considered in Chapter 5. All problems will be solved on a pyramid computer having a P½ × P½ base level of the pyrainid contains one-fourth as many PEs as the next lower level. All algorithms operate on N data items that are already stored in the lowest level of the pyramid. Each internal PE is connected to nine other PEs: one parent, four neighbors on its own level, and four children. Each PE has a constant number of words of memory. The pyramid computer operates in an SIMD mode with uniform addressing and weak uniform communication. Each PE has a mask register that selectively disables PEs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Spinger-Verlag New York, Inc.
About this chapter
Cite this chapter
Cypher, R., Sanz, J.L.C. (1994). Algorithms for Pyramid Machines. In: The SIMD Model of Parallel Computation. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2612-3_7
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2612-3_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7606-7
Online ISBN: 978-1-4612-2612-3
eBook Packages: Springer Book Archive