Performance analysis of message-passing multiprocessors
Technical Report
·
OSTI ID:5216085
The report discusses an analytical model for analyzing the performance of a message passing multiprocessor achieving concurrency by domain decomposition, i.e., by partitioning the data domain into sub-domains, and carrying out computation on each sub-domain in a different processor. Studies on different numerical algorithms reveal that execution of an algorithm can be modelled as repetitive cycles where a cycle consists of computation followed by communication or computation with overlapped communication. The paper gives expressions for the execution times, speed-ups and efficiencies for different models of parallel algorithm execution. These expressions have been used to study how the efficiency varies with different parameters such as computation-communication ratio and processor load balancing.
- Research Organization:
- Centre for Development of Advanced Computing, Bangalore (India)
- OSTI ID:
- 5216085
- Report Number(s):
- PB-91-207860/XAB
- Country of Publication:
- United States
- Language:
- English
Similar Records
Model for performance prediction of message-passing multiprocessors achieving concurrency by domain decomposition
Parallel graph partitioning algorithm for a message-passing multiprocessor
Graphical representations of program performance on hypercube message-passing multiprocessors
Technical Report
·
Wed Jan 31 23:00:00 EST 1990
·
OSTI ID:5447505
Parallel graph partitioning algorithm for a message-passing multiprocessor
Journal Article
·
Mon Nov 30 23:00:00 EST 1987
· Int. J. Parallel Program.; (United States)
·
OSTI ID:6264875
Graphical representations of program performance on hypercube message-passing multiprocessors
Thesis/Dissertation
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:5702726