Divisible Load Scheduling from Single Source in Distributed Environments

  • Murugesan GanapathyEmail author
Conference paper
Part of the Lecture Notes on Data Engineering and Communications Technologies book series (LNDECT, volume 39)


Divisible loads are computing loads that can be partitioned arbitrarily in to number of fractional loads and each fractional load can be independently processed in a parallel manner. Scheduling such type of loads on distributed heterogeneous environment like grid and cloud environment is a challenging task. The problem addressed here is to find the size of the fractional load to be assigned by the root processor to the child processor in a tree shaped network to minimize the computation time of a divisible load. This paper aims to develop a mathematical model to find the size of a load fraction for a divisible load with an objective of minimizing the finish time with budget and deadline as the constraints. The model was developed and solved with sample values specified in the literatures with mild assumptions. Experimental result shows that the proposed approach has obtained better solution than existing model with respect to time and cost.


Divisible Load Scheduling Linear programming Resource allocation Task scheduling Single source scheduling 


  1. 1.
    Aali, S.N., Shahhosseini, H.S., Bagherzadeh, N.: Divisible load scheduling of image processing applications on the heterogeneous star network using a new genetic algorithm. In: Proceedings of the 26th Euromicro International Conference on Parallel, Distributed and Network-based Processing, UK (2018)Google Scholar
  2. 2.
    Altilar, D., Paker, Y.: An optimal scheduling algorithm for parallel video processing In: Proceeding of the IEEE International Conference on Multimedia Computing and Systems, pp. 245–248 (1998)Google Scholar
  3. 3.
    Altilar, D., Paker, Y.: Optimal scheduling algorithms for communication constrained parallel processing. In: Proceeding of the Euro-Par 2002. LNCS, vol. 2400, pp. 197–206. Springer (2002)Google Scholar
  4. 4.
    Blazewicz, J., Drogdowski, M., Markiwicz, M.: Divisible task scheduling – concept and verification. Parallel Comput. 25(1), 87–98 (1999)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Beaumont, O., Casanova, H., Legrand, A., Robert, Y., Yang, Y.: Scheduling divisible loads on star and tree networks: results and open problem. IEEE Trans. Parallel Distrib. Syst. 16(3), 207–218 (2005)CrossRefGoogle Scholar
  6. 6.
    Bharadwaj, V., Ghose, D., Mani, V., Robertazzi, T.: Scheduling Divisible Loads in Parallel and Distributed Systems. IEEE Computer Society Press, Washington (1996)Google Scholar
  7. 7.
    Chan, S., Bharadwaj, V., Ghose, D.: Large matrix-vector products on distributed bus networks with communication delays using the divisible load paradigm: performance and simulation. Math. Comput. Simul. 58(1), 71–92 (2001)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Chin, T.T., Bharadwaj, V., Jia, J.: Handling large-size discrete wavelet transform on network-based computing systems: parallelization via divisible load paradigm. J. Parallel Distrib. Comput. 69(2), 143–152 (2009)CrossRefGoogle Scholar
  9. 9.
    Chen, C.-Y.: Scheduling divisible loads on heterogeneous linear networks using pipelined communications. In: Proceedings of the Fuzzy Systems Association and 9th International Conference on Soft Computing and Intelligent Systems, Japan (2017)Google Scholar
  10. 10.
    Drogdowski, M., Wolniewicz, P.: Optimum divisible load scheduling on heterogeneous stars with limited memory. Eur. J. Oper. Res. 172(2), 545–559 (2006)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Ghatpande, A., Nakazato, H., Beaumont, O., Watanabe, H.: SPORT: an algorithm for divisible load scheduling with result collection on heterogeneous systems. IEICE Trans. Commun. 91(8), 2571–2588 (2012)CrossRefGoogle Scholar
  12. 12.
    Lawenda, M.: Multi-instalment divisible loads scheduling. A thesis, Poznan University, Poland (2006)Google Scholar
  13. 13.
    Lee, C., Hamdi, M.: Parallel image processing applications on a network of workstations. Parallel Comput. 21(1), 137–160 (1995)CrossRefGoogle Scholar
  14. 14.
    Legrand, A., Su, A., Vivien, F.: Minimizing the stretch when scheduling flows of biological requests. In: Proceedings of the SPAA 2006, pp. 103–112. ACM Press (2006)Google Scholar
  15. 15.
    Li, X., Bharadwaj, V., Ko, C.: Distributed image processing on a network of workstations. Int. J. Comput. Appl. 25(2), 1–10 (2003)Google Scholar
  16. 16.
    Murugesan, G., Chellappan, C.: Resource allocation for grid applications: an economy model. In: Lecture notes on Machine Learning and Systems Engineering, pp. 439–449 (2010)Google Scholar
  17. 17.
    Robertazzi, T.G.: A product form solution for tree networks with divisible loads. Parallel Process. Lett. 21(1), 13–20 (2011)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Suresh, S., Mani, V., Omkar, S.N., Kim, H.J., Sundararajan, N.: A new load distribution strategy for linear network with communication delays. Math. Comput. Simul. 79(5), 1488–1501 (2009)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Suresh, S., Cui, R., Robertazzi, T.: Scheduling nonlinear divisible loads for a single level tree network. J. Supercomput. 61(3), 1068–1088 (2012)CrossRefGoogle Scholar
  20. 20.
    Suresh, S., Cui, R., Kim, H.J., Robertazzi, T., Kim, Y.: Scheduling second order computational loads in master-slave paradigm. IEEE Trans. Aerosp. Electron. Syst. 48(1), 780–793 (2012)CrossRefGoogle Scholar
  21. 21.
    Tong, W., Xiao, S., Li, H.: Fault-tolerant scheduling algorithm with re-allocation for divisible loads on homogeneous distributed system. IAENG Int. J. Comput. Sci. 45(3) (2018)Google Scholar
  22. 22.
    Wu, F., Cao, Y., Robertazzi, T.: Optimal divisible load scheduling for resource-sharing network. J. Distrib. Parallel Clust. Comput. (2019, submitted)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringSt. Joseph’s College of EngineeringChennaiIndia

Personalised recommendations