✦ LIBER ✦

Hypercube Algorithms for Parallel Processing of Pointer-Based Quadtrees

✍ Scribed by Frank Dehne; Andrew Rau-Chaplin; Afonso G. Ferreira

Book ID: 112241381
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 558 KB
Volume: 62
Category: Article
ISSN: 1077-3142
DOI: 10.1006/cviu.1995.1037

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quadtree traversal algorithms for pointe

Quadtree traversal algorithms for pointer-based and depth-first representations

✍ Fuhrmann, D.R. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 733 KB

A Model for the Analysis of Neighbor Fin

A Model for the Analysis of Neighbor Finding in Pointer-Based Quadtrees

✍ Samet, Hanan; Shaffer, Clifford A. 📂 Article 📅 1985 🏛 IEEE 🌐 English ⚖ 988 KB

Design of parallel algorithms for a dist

Design of parallel algorithms for a distributed memory hypercube

✍ EL Zapata; OG Plata; FF Rivera 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 852 KB

An efficient permutation-based parallel

An efficient permutation-based parallel algorithm for range-join in hypercubes

✍ Hong Shen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 731 KB

[Lecture Notes in Computer Science] Vect

[Lecture Notes in Computer Science] Vector and Parallel Processing – VECPAR’98 Volume 1573 || Parallel Genetic Algorithms for Hypercube Machines

✍ Hernández, Vicente; Palma, José M. L. M.; Dongarra, Jack J. 📂 Article 📅 1999 🏛 Springer Berlin Heidelberg ⚖ 270 KB

Fast Parallel Algorithms for Solving Tri

Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the Hypercube

✍ O.H. Ibarra; M.H. Kim 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 864 KB

This paper presents efficient hypercube algorithms for solving triangular systems of linear equations by using various matrix partitioning and mapping schemes. Recently, several parallel algorithms have been developed for this problem. In these algorithms, the triangular solver is treated as the sec