A tree network consisting of communicating processors is considered. The objective is to minimize the processing time by distributing the processing load to other nodes. The effect of the order of load distribution on the processing time is addressed. An algorithm which optimally determines the order of load distribution is developed. It is shown that the order depends only on the channel capacity between nodes but not on the computing capability of each node.
Optimal load distribution for tree network processors
IEEE Transactions on Aerospace and Electronic Systems ; 32 , 2 ; 607-612
1996-04-01
1926037 byte
Article (Journal)
Electronic Resource
English
Optimal Load Distribution for Tree Network Processors
Online Contents | 1996
|Processor Equivalence for Daisy Chain Load Sharing Processors
Online Contents | 1993
|A Sequential Implementation of Optimal Array Processors
IEEE | 1980
|Multi-installment Load Distribution in Tree Networks With Delays
Online Contents | 1995
|