Skip to main content
SpringerLink
Log in

A multi-criteria approach to time cheating in the divisible load scheduling

  • Original Article
  • Published:
Iran Journal of Computer Science Aims and scope Submit manuscript

Abstract

The divisible load scheduling (DLS) can be considered as a special class of scheduling model in the area of distributed and parallel systems. According to the DLS, the computations and communications can be divided into some arbitrarily independent fragments in which each fragment can be computed independently by a processor. The basic assumptions of the traditional DLS models are \(w_j\le w_{j+1}\) and \(z_j\le z_{j+1}\) for all \(j\le m\)(\(z_j\) and \(w_j\) are the rates of communication and computation of the jth processor, respectively). These presumptions are not acceptable if the processors do not report their real rates of communication or computation. The problem that a processor may not report its real rates of communication or computation is called cheating problem. This paper has a multi-criteria approach to the time cheating problem in the area of the DLS. The multi-criteria DLS model is a new paradigm in the area of DLS and its applications. The main contribution of this paper is to reduce the effects of time cheating in a DLS scheduling model.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Yuan-Chieh, C., Robertazzi, T.G.: Distributed computation with communication delay. IEEE Trans. Aerosp. Electron. Syst. 24(6), 700–712 (1988)

    Article  Google Scholar 

  2. Agrawal, R., Jagadish, H.V.: Partitioning techniques for large-grained parallelism. IEEE Trans. Comput 37(12), 1627–1634 (1988)

    Article  Google Scholar 

  3. Chan, S.K., Bharadwaj, V., Ghose, D.: Large matrix vector products on distributed bus networks with communication delays using the divisible load paradigm: performance analysis and simulation. Math. Comput. Simul. 58(1), 71–92 (2001)

    Article  MathSciNet  Google Scholar 

  4. Veeravalli, B., Li, X., Ko, Chi C.: Efficient partitioning and scheduling of computer vision and image processing data on bus networks using divisible load analysis. Image Vis. Comput. 18(11):919-938 (2000)

  5. Sahar N.A., Nader B.: Divisible load scheduling of image processing applications on the heterogeneous star and tree networks using a new genetic algorithm. In: Concurrency and Computation, Practice and Experience, p. e5498 (2019)

  6. 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: The 26th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP), pp. 77–84. IEEE (2018)

  7. Sahar, N.A., Nader, B.: Divisible load scheduling of image processing applications on the heterogeneous star and tree networks using a new genetic algorithm. Concurr. Comput. Pract. Exp. 32(10), e5498 (2020)

    Google Scholar 

  8. Xiaolin, L., Liu, X., Kang, H.: Sensing workload scheduling in sensor networks using divisible load theory. In: IEEE GLOBECOM 2007-IEEE Global Telecommunications Conference, pp. 785–789 (2007)

  9. Kijeung, C., Robertazzi, T.G.: Divisible load scheduling in wireless sensor networks with information utility. In: IEEE International Performance, Computing and Communications Conference, pp. 9–17 (2008)

  10. Robertazzi T.G., Shi L.: Divisible loads and parallel processing. In: Networking and Computation. Springer, Cham (2020)

  11. Bazewicz, J., Drozdowski, M.: Scheduling divisible jobs on hypercubes. Parallel Comput. 21(12), 1945–1956 (1995)

    Article  MathSciNet  Google Scholar 

  12. Drozdowski, M., Gazek, W.: Scheduling divisible loads in a three-dimensional mesh of processors. Parallel Comput. 25(4), 381–404 (1999)

    Article  MathSciNet  Google Scholar 

  13. Yeim-Kuan, C., Wu, J.-H., Chen, C.-Y., Chih-Ping, C.: Improved methods for divisible load distribution on k-dimensional meshes using multi-installment. IEEE Trans. Parallel Distrib. Syst. 18(11), 1618–1629 (2007)

    Article  Google Scholar 

  14. Bazewicz, J., Drozdowski, M., Markiewicz, M.: Divisible task scheduling: concept and verification. Parallel Comput. 25(1), 87–98 (1999)

    Article  MathSciNet  Google Scholar 

  15. Lin, X., Ying, L., Deogun, J., Goddard, S.: Real-time divisible load scheduling for cluster computing. In: 13th IEEE Real Time and Embedded Technology and Applications Symposium (RTAS’07), pp. 303–314 (2007)

  16. Marszakowski, J., Drozdowski, M., Singh, G.: Time-energy trade-offs in processing divisible loads on heterogeneous hierarchical memory systems. J. Parallel Distrib. Comput. (2020)

  17. Drozdowski, M., Singh, G., Marszakowski, J.M.: Isoefficiency maps for divisible computations in hierarchical memory systems. In: International Conference on Parallel Processing and Applied Mathematics, pp. 224–234. Springer, Cham (2019)

  18. Krijn, V.D.R., Yang, Y., Henri, C.: Practical divisible load scheduling on grid platforms with APST-DV. In: The 19th IEEE International Parallel and Distributed Processing Symposium (2005)

  19. Yu, D., Robertazzi, T.G.: Divisible load scheduling for grid computing. In: Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems, vol. 1, pp. 1–6 (2003)

  20. Suresh, S., Huang, H., Joong, K.H.: Scheduling in compute cloud with multiple data banks using divisible load paradigm. IEEE Trans. Aerosp. Electron. Syst. 51(2), 1288–1297 (2015)

    Article  Google Scholar 

  21. Kaur, T., Chana, I.: GreenSched: an intelligent energy aware scheduling for deadline-and-budget constrained cloud tasks. Simul. Model. Pract. Theory 82, 55–83 (2018)

    Article  Google Scholar 

  22. Majid, M.L.A., Chuprat, S.: Adapting market-oriented policies for scheduling divisible loads on clouds. Int. J. Distrib. Syst. Technol. (IJDST) 11(2), 45–55 (2020)

    Article  Google Scholar 

  23. Singh, R.: Hybrid genetic, variable neighbourhood search and particle swarm optimisation-based job scheduling for cloud computing. Int. J. Comput. Sci. Eng. 17(2), 184–191 (2018)

    Google Scholar 

  24. Kazemi, M., Ghanbari, S., Kazemi, M.: Divisible load framework and close form for scheduling in fog computing systems. In: International Conference on Soft Computing and Data Mining, pp. 323–333. Springer, Cham (2020)

  25. Ghanbari, S., Othman, M.: Comprehensive review on divisible load theory: concepts, strategies, and approaches. Math. Probl. Eng. (2014). https://doi.org/10.1155/2014/460354

    Article  Google Scholar 

  26. Ghanbari, S., Othman, M.: Time cheating in divisible load scheduling: sensitivity analysis, results and open problems. Proc. Comput. Sci. 125, 935–943 (2018)

    Article  Google Scholar 

  27. Veeravalli, B.: Scheduling Divisible Loads in Parallel and Distributed Systems, 8th edn. Wiley, New York (1996)

    Google Scholar 

  28. Ghanbari, S., Othman, M., Leong, W.J., Bakar, M.R.A.: Multi-objective method for divisible load scheduling in multi-level tree network. Future Gener. Comput. Syst. 54, 132–143 (2016)

    Article  Google Scholar 

  29. Ghanbari, S., Othman, M., Leong, W.J., Bakar, M.R.A.: Priority-based divisible load scheduling using analytical hierarchy process. Appl. Math. Inf. Sci. 9(5), 2541–2552 (2015)

    MathSciNet  Google Scholar 

  30. Ghanbari, S., Othman, M.: Reducing the effects of time cheating on the performance of divisible load scheduling using analytical hierarchy process. In: International Conference on Soft Computing and Data Mining, pp. 403–416. Springer, Cham (2020)

  31. Sohn, J., Robertazzi, T.G., Luryi, S.: Optimizing computing costs using divisible load analysis. IEEE Trans. Parallel Distrib. Syst. 9(3), 225–234 (1998)

  32. Saaty, T.L.: What is the analytic hierarchy process. Math. Models Decis. Support 48, 109–121 (1988)

    Article  MathSciNet  Google Scholar 

  33. Saaty, T.L.: The modern science of multi-criteria decision making and its practical applications: the AHP/ANP approach. Oper. Res. 61(5), 1101–1118 (2013)

    Article  MathSciNet  Google Scholar 

  34. Ghanbari, S., Othman, M.: A priority based job scheduling algorithm in cloud computing. Proc. Eng. 50, 778–785 (2012)

    Article  Google Scholar 

  35. Jeeho, S., Robertazzi, T.G.: Optimal time-varying load sharing for divisible loads. IEEE Trans. Aerosp. Electron. Syst. 34(3), 907–923 (1998)

    Article  Google Scholar 

  36. Carroll, T.E., Grosu, D.: An incentive-based distributed mechanism for scheduling divisible loads in tree-networks. J. Parallel Distrib. Comput 72, 389–401 (2012)

    Article  Google Scholar 

  37. Carroll, T.E., Grosu, D.: Strategy proof mechanisms for scheduling divisible loads in bus-networked distributed systems. IEEE Trans. Parallel Distrib. Syst. 19(8), 1124–1135 (2008)

    Article  Google Scholar 

  38. Kulakowski, K.: Notes on order preservation and consistency in AHP. Eur. J. Oper. Res. 245(1), 333–337 (2015)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Islamic Azad University, Ashtian Branch, Ashtian, Iran

    Shamsollah Ghanbari

  2. Department of Communication Tech and Network, Faculty of Computer Science and Information Technology, Serdang, Malaysia

    Mohamed Othman

  3. Laboratory of Computational Sciences and Mathematical Physics, Institute for Mathematical Research, Universiti Putra Malaysia, UPM, 43400, Serdang, Selangor D.E, Malaysia

    Mohamed Othman

Authors
  1. Shamsollah Ghanbari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohamed Othman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shamsollah Ghanbari.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ghanbari, S., Othman, M. A multi-criteria approach to time cheating in the divisible load scheduling. Iran J Comput Sci 4, 253–264 (2021). https://doi.org/10.1007/s42044-020-00079-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s42044-020-00079-7

Keywords

Search

Navigation