A Semi-Interquartile Min-Min Max-Min (SIM2) Approach for Grid Task Scheduling

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


Task scheduling on distributed computing is a NP-Complete problem. It is a great challenge for the system to preserve and enhance its performance. A schedule is said to be optimal if it gives a robust solution by proper utilization of the resources. In our paper, we have proposed Semi-Interquartile Min-Min Max-Min (SIM2) approach, which generates a robust optimal solution for task scheduling. We have used the concept of Semi-Interquartile, Min-Min and Max-Min to minimize the completion time of the tasks. Our experimental analysis shows better results than other conventional algorithms in terms of Makespan, Average Resource Utilization and Average Cycle Time.


Task Schedule Minimum Completion Time Task Queue Average Cycle Time Minimum Execution Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abdi, S., Pedram, H., Mohamadi, S.: The impact of data replication on job scheduling performance in hierarchical data grid. International Journal on Applications of Graph Theory in Wireless ad Hoc Networks and Sensor Networks 2(3) (September 2010)Google Scholar
  2. 2.
    Braun, T., Siegel, H.J., Maciejewski, A.: Heterogeneous computing: goals, methods and open problems. Springer, USA (2001)Google Scholar
  3. 3.
    Buyya, R.: High performance cluster computing. Pearson Education (2008) ISBN 81-317-1693-7Google Scholar
  4. 4.
    Dong, F., Akl, S.G.: Scheduling algorithms for grid computing: state of the art and open problems. Technical Report No. 2006-504, School of Computing, Queen’s University, Kingston, Ontario (January 2006)Google Scholar
  5. 5.
    Etminani, K., Naghibzadeh, M.: A min-min max-min selective algorithm for grid task scheduling. IEEE (2007)Google Scholar
  6. 6.
    Hemamalini, M.: Review on grid task scheduling in distributed heterogeneous environment. International Journal of Computer Applications 40(2), 24–30 (2012)CrossRefGoogle Scholar
  7. 7.
    Kamalam, G.K., Bhaskaran, V.M.: New enhanced heuristic min-mean scheduling algorithm for scheduling meta-tasks on heterogeneous grid environment. European Journal of Scientific Research 70, 423–430 (2012)Google Scholar
  8. 8.
    Kokilavani, T., Amalarethinam, D.I.G.: Load balanced min-min algorithm for static meta-task scheduling in grid computing. International Journal of Computer Applications IJCA 20(2), 43–49 (2011)Google Scholar
  9. 9.
    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
  10. 10.
    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
  11. 11.
    Maheswaran, M., Ali, S., Siegel, H.J., Hensgen, D., Freund, R.F.: Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems. University of Manitoba, Purdue University, USAGoogle Scholar
  12. 12.
    Mansouri, N., Dastghaibyfard, G., Horri, A.: A novel job scheduling algorithm for improving data grid’s performance. IEEE (2011)Google Scholar
  13. 13.
    Mehta, A., Smith, J., Siegel, H.J., Maciejewski, A., Jayaseelan, A., Ye, B.: Dynamic resource management heuristics for minimizing makespan with maintaining an acceptable level of robustness in an uncertain. In: 12th International Conference on Parallel and Distributed Systems (January 2006)Google Scholar
  14. 14.
    Munir, E.U., Li, J., Shi, S.: QoS sufferage heuristic for independent task scheduling in grid. Information Technology Journal 6(8), 1166–1170 (2007)CrossRefGoogle Scholar
  15. 15.
    Navimipour, N.J., Khanli, L.M.: The lgr method for task scheduling in computational grid. In: International Conference on Advanced Computer Theory and Engineering, pp. 1062–1066. IEEE (2008)Google Scholar
  16. 16.
    Parsa, S., Maleki, R.E.: RASA: A new grid task scheduling algorithm. International Journal of Digital Content Technology and its Applications 3(4), 91–99 (2009)Google Scholar
  17. 17.
    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, pp. 138–143. IEEE (2008)Google Scholar
  18. 18.
    SenthilKumar, B., Chitra, P., Prakash, G.: Robust task scheduling on heterogeneous computing systems using segmented maxr-minct. International Journal of Recent Trends in Engineering 1(2), 63–65 (2009)Google Scholar
  19. 19.
    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, pp. 311–315. IEEE (2010)Google Scholar
  20. 20.
    Tang, M., Lee, B.S., Tang, X., Yeo, C.: The impact of data replication on job scheduling performance in the data Grid. Future Generation Computer System 22, 254–268Google Scholar
  21. 21.
    Xiao, Y.: Security in distributed, grid, mobile and pervasive computing. Auerbach Publications (2007) ISBN-10 0-8493-7921-0, ISBN-13 978-0-8493-7921-5Google Scholar

Copyright information

© Springer India 2013

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