✦ LIBER ✦

An algorithm paradigm for incomplete hypercubes

✍ Scribed by Gen-Huey Chen; Dyi-Rong Duh; Cheng-Chung Hsu

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 327 KB
Volume: 22
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(91)90005-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An effective routing algorithm in incomp

An effective routing algorithm in incomplete hypercubes

✍ Shu-Hua Hu; Hsing-Lung Chen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 940 KB

An incomplete factorization algorithm fo

An incomplete factorization algorithm for adaptive filtering

✍ P Comon; D Trystram 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 477 KB

An Efficient Algorithm for Gray-to-Binar

An Efficient Algorithm for Gray-to-Binary Permutation on Hypercubes

✍ C.T. Ho; M.T. Raghunath; S.L. Johnsson 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 539 KB

Both Gray code and binary code are frequently used in mapping arrays into hypercube architectures. While the former is preferred when communication between adjacent array elements is needed, the latter is preferred for FFT-type communication. When different phases of computations have different type

Multicast Algorithms for Hypercube Multi

Multicast Algorithms for Hypercube Multiprocessors

✍ Shih-Hsien Sheu; Chang-Biau Yang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 266 KB

Depending on different switching technologies, the multicast communication problem has been formulated as three different graph theoretical problems: the Steiner tree problem, the multicast tree problem, and the multicast path problem. Our efforts in this paper are to reduce the communication traffi

Vision algorithms for hypercube machines

✍ T.N. Mudge; T.S. Abdel-Rahman 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 926 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