Skip to main content
SpringerLink
Log in

Scheduling Divisible Loads with Processor Release Times and Finite Size Buffer Capacity Constraints in Bus Networks

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

In this paper we address the problem of processing a computationally intensive divisible load with high memory requirements on a bus network. Each network node is assumed to have a limited memory capacity (buffer space), while at the same time being available for processing after a specific time (release time). The combined influence of the release times, as well as the limited buffer capacity available, is considered in the problem formulation, with the objective to minimize the overall processing time of the divisible load. In the existing literature, these two issues have been considered independently, although in practice, they are commonly found to coexist. The Multi-Installment Balancing Strategy (MIBS) presented in this paper, manages to address both of these constraints by building on-top of the analytical solutions derived by a buffer capacity-unaware approach. MIBS monitors the available resources and adapts the processing and communication phases according to their availability. Towards this goal both single and/or multi-installment scheduling is utilized. The description of the algorithms accompany simulation experiments that highlight the behavior of MIBS. It should be stressed that the use of MIBS allows the processing of loads that exceed by far the total memory capacity of the available machines, while at the same time exhibiting processing times that match the ones predicted by strategies that ignore the memory constraints.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. G.D. Barlas, Collection-aware optimum sequencing of operations and closed-form solutions for the distribution of a divisible load on arbitrary processor trees, IEEE Transactions on Parallel and Distributed Systems 9(5) (1998) 429–441.

    Google Scholar 

  2. G.D. Barlas, Compression algorithms for one-dimensional semiperiodical biomedical signals and methods for their parallelization, Ph.D. thesis, National Technical University of Athens, 1996.

  3. S. Bataineh and M. Al-Ibrahim, Effect of fault-tolerance and communication delay on response time in a multiprocessor system with a bus topology, Computer Communications 17 (1994) 843–851.

    Google Scholar 

  4. S. Bataineh and T.G. Robertazzi, Ultimate performance limits for networks of load sharing processors, in: Proceedings of the Conference on Information Sciences and Systems, Princeton University, Princeton, NJ, March 1992, 794–799.

  5. V. Bharadwaj, Distributed computation with communication delays: Design and analysis of load distribution strategies, Ph.D. thesis, Faculty of Engineering, Indian Institute of Science, Bangalore, India, June 1994.

    Google Scholar 

  6. V. Bharadwaj and N. Viswanadham, Sub-optimal solutions using integer approximation techniques for scheduling divisible loads on distributed bus networks, IEEE Transactions on Systems, Man, and Cybernetics, Part A (2001), to appear.

  7. V. Bharadwaj, D. Ghose and V. Mani, Multi-installment load distribution in tree networks with delays, IEEE Transactions on Aerospace and Electronic Systems 31 (1995) 555–567.

    Google Scholar 

  8. 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 

  9. 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 

  10. V. Bharadwaj, X. Li and KC. Chung, On the influence of start-up costs in scheduling divisible loads on bus networks, IEEE Transactions on Parallel and Distributed Systems 11(12) (2000) 1288–1305.

    Google Scholar 

  11. V. Bharadwaj, H.F. Li and T. Radhakrishnan, Scheduling divisible loads in bus networks with arbitrary processor release times, Computers and Mathematics with Applications 32(7) (1996) 57–77.

    Google Scholar 

  12. J. Blazewicz and M. Drozdowski, Distributed processing of divisible jobs with communication startup costs, Research Report RA-94/006, Institute of Computing Science, Poznan University of Technology, Poznan, Poland, December 1994.

  13. J. Blazewicz and M. Drozdowski, Performance limits of twodimensional network of load sharing processors, Foundations of Computing and Decision Sciences 21(1) (1996) 3–15.

    Google Scholar 

  14. 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 

  15. M. Drozdowski, Selected Problems of Scheduling Tasks in Multiprocessor Computer Systems, Book No. 321 (Wydawnictwa Politechniki Poznanskiej, Poznan, Poland, 1997) (in English).

    Google Scholar 

  16. M.M. Eshaghian (ed.), Heterogeneous Computing (Artech House, 1996).

  17. D. Ghose and H.J. Kim, Load partitioning and trade-off study for large matrix-vector computations in multicast bus networks with communication delays, Journal of Parallel and Distributed Computing 55(1) (1998) 32–59.

    Google Scholar 

  18. 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 

  19. J.F. Jeng and S. Sahni, Reconfigurable mesh algorithms for the hough transform, Journal of Parallel and Distributed Computing 20 (1994) 69–77.

    Google Scholar 

  20. H.J. Kim, G.-I. Jee and J.G. Lee, Optimal load distribution for tree network processors, IEEE Transactions on Aerospace and Electronic Systems 32(2) (1996) 607–612.

    Google Scholar 

  21. K. Ko and T.G. Robertazzi, Record search time evaluation, in: 2000 Conference on Information Sciences and Systems, Princeton University, March 2000.

  22. C.-K. Lee and M. Hamdi, Parallel image procesing applications on a network of workstations, Parallel Computing 21 (1995) 137–160.

    Google Scholar 

  23. X. Li, V. Bharadwaj and C.C. Ko, Optimal divisible task scheduling on single-level tree networks with finite size buffers, IEEE Transactions on Aerospace and Electronic Systems 36(4) (2000) 1298–1308.

    Google Scholar 

  24. C. Lee, Y.-F. Wang and T. Yang, Static global scheduling for optimal computer vission and image processing operations on distributed memory multiprocesors, TRC 94-23, University of California, Santa Barbara, CA, December 1994.

    Google Scholar 

  25. 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 

  26. T.G. Robertazzi, Processor equivalence for a linear daisy chain of load sharing processors, IEEE Transactions on Aerospace and Electronic Systems 29 (1993) 1216–1221.

    Google Scholar 

  27. T.G. Robertazzi, S. Luryi and J. Sohn, Load sharing controller for optimizing monetary cost, United States Patent, No. 5,889,989 (March 1999).

  28. H.J. Siegel, J.B. Armsrong and D.W. Watson, Mapping computervision-related tasks onto reconfigurable parallel-processing systems, IEEE Computer 25(2) (1992) 54–63.

    Google Scholar 

  29. J. Sohn and T.G. Robertazzi, A multi-job load sharing strategy for divisible jobs on bus networks, in: Proceedings of the 1994 Conference on Information Sciences and Systems, Princeton University, Princeton, NJ, March 1994.

  30. J. Sohn and T.G. Robertazzi, An optimum load sharing strategy for divisible jobs with time-varying processor speed and channel speed, in: Proceedings of the ISCA International Conference on Parallel and Distributed Computing Systems, Orlando, FL, September 1995, 27–32.

  31. J. Sohn and T.G. Robertazzi, Optimal divisible load scheduling on Bus Networks, IEEE Transactions on Aerospace and Electronic Systems 32(1) (1996) 34–39.

    Google Scholar 

  32. J. Sohn and T.G. Robertazzi, Optimal load sharing for a divisible load on a Bus Network, in: Proceedings of the Conference on Information Science and Systems, The Johns Hopkins University, Baltimore, MD, March 1993, 835–840.

  33. J. Sohn, T.G. Robertazzi and S. Luryi, Optimizing computing costs using divisible load analysis, IEEE Transactions on Parallel and Distributed Systems 9(3) (1998) 225–234.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Open Source Software Laboratory, Department of Electrical and Computer Engineering, The National University of Singapore, 10, Kent Ridge Crescent, Singapore, 119260

    Veeravalli Bharadwaj

  2. Department of Computer Science and Mathematics, College of Arts and Sciences, American University of Sharjah, PO Box 26666, UAE

    Gerassimos Barlas

Authors
  1. Veeravalli Bharadwaj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerassimos Barlas
    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

Bharadwaj, V., Barlas, G. Scheduling Divisible Loads with Processor Release Times and Finite Size Buffer Capacity Constraints in Bus Networks. Cluster Computing 6, 63–74 (2003). https://doi.org/10.1023/A:1020971118034

Download citation

  • Issue Date:

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

Search

Navigation