✦ LIBER ✦

Ring, torus and hypercube architectures/algorithms for parallel computing

✍ Scribed by S. Lakshmivarahan; Sudarshan K. Dhall

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 371 KB
Volume: 25
Category: Article
ISSN: 0167-8191
DOI: 10.1016/s0167-8191(99)00069-1

No coin nor oath required. For personal study only.

✦ Synopsis

This paper provides a survey of both architectural and algorithmic aspects of solving problems using parallel processors with ring, torus and hypercube interconnection.

📜 SIMILAR VOLUMES

A parallel architecture and algorithms f

A parallel architecture and algorithms for optical computing

✍ Ahmed Louri 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 626 KB

The Flexible Hypercube: A New Fault-Tole

The Flexible Hypercube: A New Fault-Tolerant Architecture for Parallel Computing

✍ Tom Hameenanttila; Xin-Li Guan; Jo Dale Carothers; Jian-Xin Chen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 265 KB

This paper presents the new Flexible Hypercube architecture. The Flexible Hypercube is a fault-tolerant network topology that can be constructed for an arbitrary number of nodes and is incrementally expandable. This topology maintains the strong features of the Hypercube while overcoming deficiencie

Parallel algorithms and architectures fo

Parallel algorithms and architectures for matrix multiplication

✍ C. Puglisi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 648 KB

Towards Structured Parallel Computing on

Towards Structured Parallel Computing on Architecture-Independent Parallel Algorithm Design for Distributed-Memory Architectures

✍ Feng Gao 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 403 KB

This paper introduces an architecture-independent, hierarchical approach to algorithm design on distributed-memory architectures, in contrast to the current trend of tailoring algorithms towards specific architectures. We show that, rather surprisingly, this new approach can achieve uniformity witho

General Algorithm for Improved Lattice A

General Algorithm for Improved Lattice Actions on Parallel Computing Architectures

✍ Frédéric D.R. Bonnet; Derek B. Leinweber; Anthony G. Williams 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Quantum field theories underlie all of our understanding of the fundamental forces of nature. There are relatively few first-principles approaches to the study of quantum field theories (such as quantum chromodynamics [QCD] relevant to the strong interaction) apart from the perturbative (i.e., weak-

Architectures and message-passing algori

Architectures and message-passing algorithms for cluster computing: Design and performance

✍ Edward K. Blum; Xin Wang; Patrick Leung 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 239 KB

This paper considers the architecture of clusters and related message-passing (MP) software algorithms and their eect on performance (speedup and eciency) of cluster computing (CC). We present new architectures for multi-segment Ethernet clusters and new MP algorithms which ®t these architectures. T