An Equivalent Tree Network Methodology for Efficient Utilization of Front-Ends in Linear Network

Authors:
V. Mani
Affiliations:
Department of Aerospace Engineering, Indian Institute of Science, Bangalore, 560 012, India
Venue:
Cluster Computing
Year:
2003

Citing 3
Cited 1

Distributed computation with communication delays: asymptotic performance analysis

Journal of Parallel and Distributed Computing
Scheduling Divisible Loads in Parallel and Distributed Systems

Scheduling Divisible Loads in Parallel and Distributed Systems
Optimal Sequencing and Arrangement in Distributed Single-Level Tree Networks with Communication Delays

IEEE Transactions on Parallel and Distributed Systems

A new load distribution strategy for linear network with communication delays

Mathematics and Computers in Simulation

Quantified Score

Hi-index	0.00

Visualization

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.