The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1992 vol.18)
pp: 296-303
ABSTRACT
<p>The performance of parallel computing in a network of Apollo workstations where the processes use the remote procedure call (RPC) mechanism for communication is addressed. The speedup in such systems cannot be accurately estimated without taking into account the relatively large communication overheads. Moreover, it decreases by increasing parallelism when the latter exceeds some certain limit. To estimate the speedup and determine the optimum degree of parallelism, the author characterizes the parallelization and the communication overheads in the system considered. Then, parallel applications are modeled and their execution times are expressed for the general case of nonidentical tasks and workstations. The general case study allows the structural constraints of the applications to be taken into account by permitting their partitioning into heterogeneous tasks. A simple expression of the optimum degree of parallelism is obtained for identical tasks where the inherent constraints are neglected. The fact that the theoretical maximum speedup is bounded by half of the optimum degree of parallelism shows the importance of this measure.</p>
INDEX TERMS
optimization; Apollo domain network; parallel computing; Apollo workstations; remote procedure call; communication overheads; optimisation; parallel processing; performance evaluation
CITATION
M.F. Pekergin, "Parallel Computing Optimization in the Apollo Domain Network", IEEE Transactions on Software Engineering, vol.18, no. 4, pp. 296-303, April 1992, doi:10.1109/32.129218
28 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool