Abstract
This chapter will study how several problems in image processing and scientific computing can be solved on hypercube computers. All of the problems will be solved using a plain hypercube computer (see Chapter 10) and the hypercube-derived computers (see Chapter 9). Unless stated otherwise, it will be assumed that N = P and that each processor has a constant number of words of memory, each consisting of O(log N) bits. Many of the algorithms in this chapter will make extensive use of the communication primitives given in the previous chapter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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 Hypercube Computers. In: The SIMD Model of Parallel Computation. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2612-3_11
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2612-3_11
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