Skip to main content
SpringerLink
Log in

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

  • Published:
Cluster Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. http://www.ee.sunysb.edu/ tom/dlt.html

  2. Y.C. Cheng and T.G. Robertazzi, Distributed computation with communication delays, IEEE Transactions on Aerospace and Electronic Systems 24 (1988) 700–712.

    Google Scholar 

  3. Y.C. Cheng and T.G. Robertazzi, Distributed computation for a tree network with communication delays, IEEE Transactions on Aerospace and Electronic Systems 26 (1990) 511–516.

    Google Scholar 

  4. V. Mani and D. Ghose, Distributed computation in linear networks: Closed-form solutions, IEEE Transactions on Aerospace and Electronic Systems 30 (1994) 471–483.

    Google Scholar 

  5. D. Ghose and V. Mani, Distributed computation with communication delays: Asymptotic performance analysis, Journal of Parallel and Distributed Computing 23 (1994) 293–305.

    Google Scholar 

  6. V. Bharadwaj, D. Ghose and V. Mani, Optimal sequencing and arrangement in distributed single-level networks with communication delays, IEEE Transactions on Parallel and Distributed Systems 5 (1994) 968–976.

    Google Scholar 

  7. V. Bharadwaj, D. Ghose and V. Mani, An efficient load distribution strategy for a linear network of processors with communication delays, Computers and Mathematics with Applications 29 (1995) 95–112.

    Google Scholar 

  8. V. Bharadwaj, D. Ghose, V. Mani and T.G. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems (IEEE Computer Society Press, Los Alamitos, CA, 1996).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Aerospace Engineering, Indian Institute of Science, Bangalore, 560 012, India

    V. Mani

Authors
  1. V. Mani
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mani, V. An Equivalent Tree Network Methodology for Efficient Utilization of Front-Ends in Linear Network. Cluster Computing 6, 57–62 (2003). https://doi.org/10.1023/A:1020919101196

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020919101196

Search

Navigation