RRTS: A Task Scheduling Algorithm to Minimize Makespan in Grid Environment

  • Sanjaya Kumar Panda
  • Sourav Kumar Bhoi
  • Pabitra Mohan Khilar
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 216)


Task scheduling is one of the major issues of grid environment. This is an essential process in utilizing the resources efficiently by reducing the completion time. The performance of the grid can be enhanced by using efficient task scheduling algorithms. In this paper, we have proposed a new technique called Round Robin Task Scheduling (RRTS) for minimizing the Makespan by using concept of Round Robin. The idea of the approach is to execute the tasks by using Dynamic Time Slice (DTS). Our experimental analysis shows better results than other task scheduling algorithms (Minimum Execution Time (MET), Minimum Completion Time (MCT), Min–Max, and Max–Min) in terms of Makespan and Average Resource Utilization.


Round robin task scheduling Makespan Grid computing Task scheduling Dynamic time slice 


  1. 1.
    Freund, R.F., Gherrity, M., Ambrosius, S., Campbell, M., Hensgen, D., Keith, E., Kidd, T., Kussow, M., Lima, J.D., Mirabile, F., Moore, L., Rust, B., Siegel, H.J.: Scheduling resources in multi-user, heterogeneous, computing environments with smartnet. IEEE, pp. 184–199 (1998)Google Scholar
  2. 2.
    Xiaoshan, H., Sun, X.H., Laszewski, G.V.: Qos guided min–min heuristic for grid task scheduling, NSF Grant Nos. EIA-0224377, ANI-0123930, EIA-0130673, ARO Grant No. DAAD19-01-1-0432, May 2003Google Scholar
  3. 3.
    Hemamalini, M.: Review on grid task scheduling in distributed heterogeneous environment. IJCA 40(2), 24–30 (2012)CrossRefGoogle Scholar
  4. 4.
    Liu, K., Chen, J., Jin, H., Yang, Y.: A min–min average algorithm for scheduling transaction-intensive grid workflows. In: 7th Australasian Symposium on Grid Computing and e-Research (2009)Google Scholar
  5. 5.
    Mansouri, N., Dastghaibyfard, G., Horri, A.: A novel job scheduling algorithm for improving data grid’s performance. IEEE (2011)Google Scholar
  6. 6.
    Etminani, K., Naghibzadeh, M.: A min–min max–min selective algorithm for grid task scheduling, In: IEEE (2007)Google Scholar
  7. 7.
    Sun, W., Zhu, Y., Su, Z., Jiao, D., Li, M.: A priority-based task scheduling algorithm in grid. In: 3rd International Symposium on Parallel Architectures, Algorithms and Programming, IEEE, pp. 311–315 (2010)Google Scholar
  8. 8.
    Kokilavani, T., Amalarethinam, D.I.G.: Load balanced min–min algorithm for static meta-task scheduling in grid computing. IJCA 20(2), 43–49 (2011)CrossRefGoogle Scholar
  9. 9.
    Kamalam, G.K., Bhaskaran, V.M.: New enhanced heuristic min-mean scheduling algorithm for scheduling meta-tasks on heterogeneous grid environment. Eur. J. Sci. Res. 70(3), 423–430 (2012)Google Scholar
  10. 10.
    Baca, D.F.: Allocating modules to processors in a distributed system. IEEE Trans. Softw. Eng. 15(11), 1427–1436 (1989)CrossRefGoogle Scholar
  11. 11.
    Munir, E.U., Li, J., Shi, S.: QoS sufferage heuristic for independent task scheduling in grid. Inf. Technol. J 6(8), 1166–1170 (2007)CrossRefGoogle Scholar
  12. 12.
    Liang, Y., Jiliu, Z.: The improvement of A task scheduling algorithm in grid computing. In: First International Symposium on Data, Privacy and E-Commerce, IEEE (2007)Google Scholar
  13. 13.
    Parsa, S., Maleki, R.E.: RASA: A new grid task scheduling algorithm. JDCTA 3(4), 91–99 (2009)Google Scholar
  14. 14.
    Rasooli, A., Aghatabar, M.M., Khorsandi, S.: Introduction of novel rule based algorithms for scheduling in grid computing systems. In: Second Asia international conference on modelling & simulation, IEEE, pp. 138–143 (2008)Google Scholar
  15. 15.
    Buyya, R.: High Performance Cluster Computing. Pearson Education, ISBN 81-317-1693-7 (2008)Google Scholar
  16. 16.
    Xiao, Y.: Security in Distributed, Grid, Mobile, and Pervasive Computing. Auerbach Publications, ISBN-10 0-8493-7921-0, ISBN-13 978-0-8493-7921-5 (2007)Google Scholar
  17. 17.
    Yaashuwanth, C., Ramesh, R.: A new scheduling algorithm for real time system. Int. J. Comput. Electr. Eng. 2(6), 1104–1106 (2010)CrossRefGoogle Scholar
  18. 18.
    Yaashuwanth, C., Ramesh, R.: A new scheduling algorithms for real time tasks. IJCSIS 6(2), 61–66 (2009)Google Scholar
  19. 19.
    Zhang, Y., Koelbel, C., Kennedy, K.: Relative performance of scheduling algorithms in grid environments. In: 7th International Symposium on Cluster Computing and the Grid, IEEE (2007)Google Scholar
  20. 20.
    Navimipour, N.J., Khanli, L.M.: The LGR method for task scheduling in computational grid. In: International Conference on Advanced Computer Theory and Engineering, IEEE, pp. 1062–1066 (2008)Google Scholar
  21. 21.
    Panda, S.K., Bhoi, S.K.: An effective round Robin algorithm using min-max dispersion measure. IJCSE 4(1), 45–53 (2012)Google Scholar
  22. 22.
    Tang, M., Lee, B.S., Tang, X., Yeo, C.: The impact of data replication on job scheduling performance in the data grid. Future Gener. Comput Syst. 22, 254–268 (Elsevier)Google Scholar
  23. 23.
    Abdi, S., Pedram, H., Mohamadi, S.: The impact of data replication on job scheduling performance in hierarchical data grid. Int. J. Appl. Graph Theory Wireless Ad hoc Netw. Sens. Netw. 2(3), (2010)Google Scholar

Copyright information

© Springer India 2014

Authors and Affiliations

  • Sanjaya Kumar Panda
    • 1
  • Sourav Kumar Bhoi
    • 1
  • Pabitra Mohan Khilar
    • 1
  1. 1.Department of Computer Science and EngineeringNational Institute of TechnologyRourkelaIndia

Personalised recommendations