Bharadwaj, V and Ghose, D and Mani, V (1994) Optimal Sequencing and Arrangement in Distributed Single Level Tree Networks with Communication Delays. In: IEEE Transactions on Parallel and Distributed Systems, 5 (9). pp. 968-976.
The problem of obtaining optimal processing time in a distributed computing system consisting of (N+1) processors and N communication links, arranged in a single-level tree architecture, is considered. It is shown that optimality can be achieved through a hierarchy of steps involving optimal load distribution, load sequencing, and processor-link arrangement. Closed-form expressions for optimal processing time is derived for a general case of networks with different processor speeds and different communication link speeds. Using these closed-form expressions, the paper analytically proves a number of significant results that in earlier studies were only conjectured from computational results. In addition, it also extends these results to a more general framework. The above analysis is carried out for the cases in which the root processor may or may not be equipped with a front-end processor. Illustrative examples are given for all cases considered.
|Item Type:||Journal Article|
|Additional Information:||Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE|
|Keywords:||Communication delays;Distributed processing; Optimal arrangement;Optimal load distribution;Optimal load sequencing;Optimal processing time;Single-level tree networks|
|Department/Centre:||Division of Mechanical Sciences > Aerospace Engineering (Formerly, Aeronautical Engineering)|
|Date Deposited:||25 Aug 2008|
|Last Modified:||19 Sep 2010 04:27|
Actions (login required)