๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A memory organization for parallel computers

โœ Scribed by F. A. Murzin; V. A. Sluev

Book ID
112976869
Publisher
Springer
Year
1988
Tongue
English
Weight
632 KB
Volume
6
Category
Article
ISSN
0288-3635

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A parallel solver for tridiagonal linear
A parallel solver for tridiagonal linear systems for distributed memory parallel computers
โœ L. Brugnano ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 225 KB

Brugnano, L\_, A parallel solver for tridiagonal linear systems for distributed memory parallel computers, Parallel Computing 17 (1991) 1017-1023. The solution of linear tridiagonal systems is a very common problem in Numerical Analysis. Many algorithms are known for solving such linear systems on

Parallel implementation of a ray tracing
Parallel implementation of a ray tracing algorithm for distributed memory parallel computers
โœ Lee, Tong-Yee; Raghavendra, C. S.; Nicholas, John B. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 145 KB ๐Ÿ‘ 3 views

Ray tracing is a well known technique to generate life-like images. Unfortunately, ray tracing complex scenes can require large amounts of CPU time and memory storage. Distributed memory parallel computers with large memory capacities and high processing speeds are ideal candidates to perform ray tr

Scalable Parallel Matrix Multiplication
Scalable Parallel Matrix Multiplication on Distributed Memory Parallel Computers
โœ Keqin Li ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 392 KB

Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O(N a ), where 2 < a [ 3. We show that such an algorithm can be parallelized on a distributed memory parallel computer (DMPC) in O(log N) time by using N a /log N processors. Such a parallel