@inproceedings{a02f6d3edb3c4309827d8f9470ba7c12,
title = "Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing A Divisible Job",
abstract = "Optimal load allocation for load sharing a divisi ble 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 fin ish time and the optimal data allocation for each pro cessor are obtained. The performance of large sym metric tree networks is examined by aggregating the component links and processors into a single equiv alent 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.",
author = "S. Bataineh and T. Hsiung and Robertazzi, \{T. G.\}",
note = "Publisher Copyright: {\textcopyright} 1993 IEEE.; 1993 International Conference on Parallel Processing, ICPP 1993 ; Conference date: 16-08-1993 Through 20-08-1993",
year = "1993",
doi = "10.1109/ICPP.1993.54",
language = "English",
series = "Proceedings of the International Conference on Parallel Processing",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "290--293",
booktitle = "Architecture",
}