Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing A Divisible Job

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 eachprocessorare obtained.Theperformanceof large symmetric tree networks is examined by aggregating the component links and processors into a single equivalentprocessor. This allows an easy examination of large tree networks. In addition, it becomes possible to find a closed form solution for the optimal amountof data that is to be assigned to each processor in the tree network in order to achieve the minimum finish time.

• Type: Conference
• Year: 1993
• Where: ICPP
• Authors: Sameer M. Bataineh, Te-Yu Hsiung, Thomas G. Robertazzi
• Keywords: Closed Form Solution, Distributed And Parallel Computing, ICPP 1993, Minimum Finish Time, Tree Network