1997
DOI: 10.1002/(sici)1096-9128(199707)9:7<721::aid-cpe265>3.3.co;2-x View full text |Buy / Rent full text
|
|

Abstract: SUMMARYParallel programming on workstation clusters is subject to many factors and problems which determine the potential success or failure of any individual implementation. The most obvious problems are the difficulty in developing parallel algorithms and the high communication latency which may render such algorithms inefficient. In an attempt to address some of these issues we propose a strategy for estimating the potential speedup of a parallel program based on computation and communication profiling. We … Show more

Help me understand this report

Search citation statements

Order By: Relevance
Select...
0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals