## Abstract

Speedup and efficiency are two measures for performance of pipelined computers. Now, these measures are used to evaluate performance of parallel algorithms for multiprocessor systems. However, to evaluate the performance of a parallel algorithm, these measures consider only the computation time and number of processors used, but do not include the number of the communication links in the system. In this paper, we define two new measures, cost effectiveness and time-cost effectiveness, for evaluating performance of a parallel algorithm for a multiprocessor system. From these two measures we define two characterization factors for multiprocessor systems. We use these new characterizing factors to analyze some well-known multiprocessor systems. It is found that for a given penalty function, every multiprocessor architecture has an optimal number of processors that produces maximum profit. If “too many” processors are used, the higher cost of the system reduces the profit obtained from the faster solution. On the other hand, if “too few” processors are used, the penalty paid for taking a longer time to obtain the solution reduces the profit.

Original language | English (US) |
---|---|

Pages (from-to) | 704-712 |

Number of pages | 9 |

Journal | IEEE Transactions on Parallel and Distributed Systems |

Volume | 4 |

Issue number | 6 |

DOIs | |

State | Published - Jun 1993 |

## Keywords

- Cost effectiveness
- efficiency
- hypercubes
- interconnection networks
- mesh-connected computers
- multiprocessing
- parallel algorithms
- speedup

## ASJC Scopus subject areas

- Signal Processing
- Hardware and Architecture
- Computational Theory and Mathematics