✦ LIBER ✦

Construction of d-Dimensional Hyperoctrees on a Hypercube Multiprocessor

✍ Scribed by F. Dehne; A. Fabri; M. Nassar; A. Rauchaplin; R. Valiveti

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 541 KB
Volume: 23
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1994.1137

No coin nor oath required. For personal study only.

✦ Synopsis

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((m / p) \log p \log n)), where (m) is the maximum of input and output size. 1994 Academic Press, Inc.

📜 SIMILAR VOLUMES

A Construction of C1-Wavelets on the Two

A Construction of C1-Wavelets on the Two-Dimensional Sphere

✍ Ilona Weinreich 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 204 KB

In this paper a construction of C 1 -wavelets on the two-dimensional sphere is presented. First, we focus on the construction of a multiresolution analysis leading to C 1 -functions on S 2 . We show refinability of the constructed tensor product generators. Second, for the wavelet construction we em

FORTRAN code for the cluster Monte Carlo

FORTRAN code for the cluster Monte Carlo study of the q-state Potts model on D-dimensional hypercubic lattices

✍ Li-Jen Chen; Chin-Kun Hu; Kit-Sing Mak 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 483 KB

An Efficient Implementation of Batcher′s

An Efficient Implementation of Batcher′s Odd-Even Merge on a SIMD Hypercube

✍ D. Nassimi; Y.D. Tsai 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 469 KB

We present an efficient \(\theta(\log N)\) implementation of Batcher's odd-even merge on a SIMD hypercube. (The hypercube model assumes that all communications are restricted to one fixed dimension at a time.) The best previously known implementation of odd-even merge on a SIMD hypercube requires \(

Two methods for the solution of the dyna

Two methods for the solution of the dynamic programming algorithm on a multiprocessor cluster

✍ D. Al-Dabass 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 598 KB

Nearly Logarithmic-Time Parallel Algorit

Nearly Logarithmic-Time Parallel Algorithms for the Class of ±2b ASCEND Computations on a SIMD Hypercube

✍ D. Nassimi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 979 KB

A stochastic approach to the constructio

A stochastic approach to the construction of one-dimensional chaotic maps with prescribed statistical properties

✍ F.K. Diakonos; D. Pingel; P. Schmelcher 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 142 KB

We use a recently found parametrization of the solutions of the inverse Frobenius-Perron problem within the class of complete unimodal maps to develop a Monte Carlo approach for the construction of one-dimensional chaotic dynamical laws with given statistical properties, i.e. invariant density and a