We present a parallel algorithm for the construction of the hyperoctree representing a \(d\)-dimensional object from a set of \(n\) (d - 1)-dimensional hyperoctrees, representing adjacent cross sections of this object. On a \(p\)-processor SIMD hypercube the time complexity of our algorithm is \(O((
Design and implementation of a hypercube multiprocessor
β Scribed by SR Das; NH Vaidya; LM Patnaik
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 633 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0141-9331
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The inherent structure of cellular automata is trivially parallelizable and can directly benefit from massively parallel machines in computationally intensive problems. This paper presents both block synchronous and block pipeline (with asynchronous message passing) parallel implementations of cellu
This paper presents the results obtained with a new type of spatiotemporal topological dimension implemented within a hypercube, i.e., within a multidimensional database (MDDB) structure formed by the conjunction of several thematic, spatial and temporal dimensions. Our goal is to support efficient