It is a well known fact that given a parallel architecture and a problem of a fixed site, the speedup of a parallel algorithm does not continue to increase with increasing number of processors. It usually tends to saturate or peak at a certain limit. Thus it may not be useful to employ more than an optimal number of processors for solving a problem on a parallel computer. This optimal number of processors depends on the problem sine, the parallel algorithm and the parallel architecture. In this paper we study the impact of parallel processing overheads and the degree of concurrency of a parallel algorithm on the optimal number of processors to be used when the criterion for optimality is minimizing the parallel execution time. We then study a more general criterion of optimality and show how operating at the optimal point is equivalent to operating at a unique value of eflciency which is characteristic of the criterion of optimality and the properties of the parallel system under study. We put the technical results derived in this paper in perspective with similar results that have appeared in the literature before and show how this paper generalizes and/or extends these earlier results.
|Original language||English (US)|
|Title of host publication||Proceedings of the 26th Hawaii International Conference on System Sciences, HICSS 1993|
|Publisher||IEEE Computer Society|
|Number of pages||10|
|State||Published - 1993|
|Event||26th Hawaii International Conference on System Sciences, HICSS 1993 - Wailea, United States|
Duration: Jan 8 1993 → …
|Name||Proceedings of the Annual Hawaii International Conference on System Sciences|
|Conference||26th Hawaii International Conference on System Sciences, HICSS 1993|
|Period||1/8/93 → …|
Bibliographical noteFunding Information:
*This work was supported by IST/SDIO through the Army Research Office grant # 2840SMA-SDI to the University of Minnesota and by the Army High Performance Computing Research Center at the University of Minnesota.
© 1993 IEEE.
Copyright 2019 Elsevier B.V., All rights reserved.