✦ LIBER ✦

Architectural differences of efficient sequential and parallel computers

✍ Scribed by Martti J. Forsell

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 852 KB
Volume: 47
Category: Article
ISSN: 1383-7621
DOI: 10.1016/s1383-7621(02)00064-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of Multigrid Algorithms on Mass

Analysis of Multigrid Algorithms on Massively Parallel Computers: Architectural Implications

✍ Lesley R. Matheson; Robert E. Tarjan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 234 KB

We study the potential performance of multigrid algorithms running on massively parallel computers with the intent of discovering whether currently envisioned machines will provide an efficient platform for such algorithms. These algorithms substantially improve the performance of iterative methods

Performance characteristics for OpenMP c

Performance characteristics for OpenMP constructs on different parallel computer architectures

✍ Berrendorf, Rudolf ;Nieken, Guido 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB

OpenMP is emerging as a quasi-standard for shared memory parallel programming on small SMP-systems. To serve as a common programming interface in shared memory parallel programming, scalability to a larger number of nodes and support for different shared memory architectures has to be proven. In thi

Architectural specification for massivel

Architectural specification for massively parallel computers: an experience and measurement-based approach

✍ Ron Brightwell; William Camp; Benjamin Cole; Erik DeBenedictis; Robert Leland; J 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 593 KB

Aspects of parallelism in computer archi

Aspects of parallelism in computer architecture

✍ Wolfgang Händler 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 558 KB

Efficient Gram-Schmidt orthonormalisatio

Efficient Gram-Schmidt orthonormalisation on parallel computers

✍ Lingen, F. J. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

This paper compares the parallel e ciency of three Gram-Schmidt orthonormalization algorithms: modiÿed Gram-Schmidt, classical Gram-Schmidt, and iterated classical Gram-Schmidt. The paper shows how these algorithms can be implemented on a parallel computer, and how their communication overhead can b

Architecture of highly parallel ap1000 c

Architecture of highly parallel ap1000 computer

✍ Hiroaki Ishihata; Toshiyuki Shimizu; Morio Ikesaka; Satoshi Inano; Morio Ikesaka 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 835 KB

## Abstract This paper describes the architectural features of the AP1000 message‐passing computer. The architecture is designed to speed up barrier synchronization, data distribution and collection, broadcasting, and message handling. In recent message‐passing computers, the most significant commu