Mani, V (2003) An Equivalent Tree Network Methodology for Efficient Utilization of Front-Ends in Linear Network. In: Cluster Computing, 6 (1). 57 -62.
Full text not available from this repository. (Request a copy)Abstract
In this paper, divisible load scheduling in a linear network of processors is presented. The cases of processing load originating at the boundary and also at the interior of the network are considered. An equivalent tree network for the given linear network is derived. Using this equivalent tree network, we prove all the results obtained in the earlier studies. The equivalent tree network methodology presented in this paper, is more general than the earlier results, because in this approach, we can solve the scheduling problem even in an hetrogeneous linear network. The earlier studies considered only homogeneous linear network.
| Item Type: | Journal Article |
|---|---|
| Publication: | Cluster Computing |
| Publisher: | Springer |
| Additional Information: | Copyright of this article belong to Springer Netherlands. |
| Keywords: | Divisible load[Linear network;Equivalent tree network;Communication delay |
| Department/Centre: | Division of Mechanical Sciences > Aerospace Engineering(Formerly Aeronautical Engineering) |
| Date Deposited: | 02 Jun 2006 |
| Last Modified: | 27 Aug 2008 12:07 |
| URI: | http://eprints.iisc.ac.in/id/eprint/7338 |
Actions (login required)
 |
View Item |
