Issue No. 10 - October (1994 vol. 43)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.324544
<p>Optimal load allocation for load sharing a divisible job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with front-end processors or not so equipped. Closed form solutions for the minimum finish time and the optimal data allocation for each processor are obtained. The performance of large symmetric tree networks is examined by aggregating the component links and processors into a single equivalent processor. This allows an easy examination of large tree networks. In addition, it becomes possible to find a closed form solution for the optimal amount of data that is to be assigned to each processor in the tree network in order to achieve the minimum finish time.</p>
resource allocation; multiprocessor interconnection networks; system buses; closed form solutions; tree networks; bus networks; processors load sharing; optimal load allocation; front-end processors; optimal data allocation; symmetric tree networks.
Te-Yu Hsiung, S. Bataineh, T.G. Robertazzi, "Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job", IEEE Transactions on Computers, vol. 43, no. , pp. 1184-1196, October 1994, doi:10.1109/12.324544