This paper investigates the time lost in a parallel computation due to sequential and duplicated work, communication, and blocking, and proposes characterizations of parallel algorithms based upon the communication complexity and the blocking model. It discusses the impact of the processor's archite
โฆ LIBER โฆ
On the scalability of parallel computations on a network of workstations
โ Scribed by H.-S. Dou; N. Phan-Thien
- Publisher
- Springer
- Year
- 1998
- Tongue
- English
- Weight
- 886 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0178-7675
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
On the Scalability of Asynchronous Paral
โ
D.C. Marinescu; J.R. Rice
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 753 KB
Parallel structural optimization on a ne
โ
Efthimios S. Sikiotis; Victor E. Saouma
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 1019 KB
Scalable architecture for parallel distr
โ
Ivan Tanev; Takashi Uozumi; Koichi Ono
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 696 KB
Performance prediction model for paralle
โ
Zhang Jianjun; Ru Guobao
๐
Article
๐
1998
๐
Wuhan University
๐
English
โ 315 KB
System support for parallel computing on
โ
Xiaodong Zhang
๐
Article
๐
1996
๐
Wuhan University
๐
English
โ 484 KB
Parallel computing on clusters of workst
โ
Mohammed Atiquzzaman; Pradip K Srimani
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 38 KB
There has been an increasing interest in the use of clusters of workstations connected together by high speed networks for solving large computation-intensive problems. The trend is mainly driven by the cost eectiveness of such systems as compared to large multiprocessor systems with tightly coupled