Skip to main content
SpringerLink
Log in

An Improved Min-Min Task Scheduling Algorithm in Grid Computing

  • Conference paper
Grid and Pervasive Computing (GPC 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7861))

Included in the following conference series:

Abstract

Supercomputer prices on one hand and the need for vast computational resources on the other hand, led to the development of network computing resources were under name Grid. For optimal use of the capabilities of large distributed systems, the need for effective and efficient scheduling algorithms is necessary. For reduction of total completion time and improvement of load balancing, many algorithms have been implemented. In this paper, we propose new scheduling algorithm based on well known task scheduling algorithms, Min-Min. The proposed algorithm tries to use the advantages of this basic algorithm and avoids its drawbacks. To achieve this, the proposed algorithm firstly like Min-Min estimating of the completion time of the tasks on each of resources and then selects the appropriate resource for scheduling. The experimental results show that the proposed algorithm improved total completion time of scheduling in compared to Min-Min algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Foster, I.: Globus Toolkit Version 4: Software for service-oriented systems. In: Jin, H., Reed, D., Jiang, W. (eds.) NPC 2005. LNCS, vol. 3779, pp. 2–13. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Litzkow, M., Livny, M., Mutka, M.: Condor - A Hunter of Idle Workstations, In: Proceedings of the 8th International Conference of Distributed Computing Systems, pp. 104–111 (June 1988)

    Google Scholar 

  3. Foster, I., Kesselman, C.: The Grid: Blueprint for a future computing Infrastructure. Morgan Kaufmann Publishers, USA (1999)

    Google Scholar 

  4. Yagoubi, B., Slimani, Y.: Task Load Balancing Strategy for Grid Computing. Journal of Computer Science 3(3), 186–194 (2007)

    Article  Google Scholar 

  5. Maheswaran, M., Ali, S., Jay Siegel, H., Hensgen, D., Freund, R.F.: Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems. Journal of Parallel and Distributed Computing 59, 107–131 (1999)

    Article  Google Scholar 

  6. Freund, R.F., Gherrity, M., Ambrosius, S., Campbell, M., Halderman, M., Hensgen, D., Keith, E., Kidd, T., Kussow, M., Lima, J.D., Mirabile, F., Moore, L., Rust, B., Siegel, H.J.: Scheduling Resource in Multi-User, Heterogeneous, Computing Environment with SmartNet. In: The Proceeding of the Seventh Heterogeneous Computing Workshop (1998)

    Google Scholar 

  7. Braun, T.D., Jay Siegel, H., Beck, N., Boloni, L.L., Maheswaran, M., Reuther, A.I., Robertson, J.P., Theys, M.D., Yao, B.: A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems. Journal of Parallel and Distributed Computing 61, 810–837 (2001)

    Article  Google Scholar 

  8. Dong, F., Luo, J., Gao, L., Ge, L.: A Grid Task Scheduling Algorithm Based on QoS Priority Grouping. In: The Proceedings of the Fifth International Conference on Grid and Cooperative Computing (GCC 2006). IEEE (2006)

    Google Scholar 

  9. Parsa, S., Entezari-Maleki, R.: RASA: A New Grid Task Scheduling Algorithm. International Journal of Digital Content Technology and its Applications 3(4) (December 2009)

    Google Scholar 

  10. Etminani, K., Naghibzadeh, M.: A Min-min Max-min Selective Algorithm for Grid Task Scheduling. In: The Third IEEE/IFIP International Conference on Internet, Uzbekistan (2007)

    Google Scholar 

  11. Afzal, A., Stephen McGough, A., Darlington, J.: Capacity planning and scheduling in Grid computing environment. Journal of Future Generation Computer Systems 24, 404–414 (2008)

    Article  Google Scholar 

  12. Brucker, P.: Scheduling Algorithms, 5th edn. Springer Press (2007)

    Google Scholar 

  13. Buyya, R., Murshed, M.: GridSim: A toolkit for the odeling and simulation of distributed resource management and scheduling for grid computing. Journal of Concurrency and Computation Practice and Experience, 1175–1220 (2002)

    Google Scholar 

  14. Benjamin Khoo, B.T., Veeravalli, B., Hung, T., Simon See, C.W.: A multi-dimensional scheduling scheme in a Grid computing environment. Journal of Parallel and Distributed Computing 67, 659–673 (2007)

    Article  MATH  Google Scholar 

  15. Czajkowski, K., Foster, I., Karonis, N., Kesselman, C., Martin, S., Smith, W., Tuecke, S.: A resource management architecture for metacomputing systems. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1998. LNCS, vol. 1459, pp. 62–82. Springer, Heidelberg (1998)

    Google Scholar 

  16. Cao, J., Spooner, D.P., Jarvis, S.A., Nudd, G.R.: Grid Load Balancing Using Intelligent Agents. Future Generation Computer Systems 21(1), 135–149 (2005)

    Article  Google Scholar 

  17. He, X., Sun, X.-H., Laszewski, G.V.: QoS Guided Min-min Heuristic for Grid Task Scheduling. Journal of Computer Science and Technology 18, 442–451 (2003)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Arak Branch, Islamic Azad University, Arak, Iran

    Soheil Anousha

  2. Department of Computer Engineering, University of Razi, Kermanshah, Iran

    Mahmoud Ahmadi

Authors
  1. Soheil Anousha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mahmoud Ahmadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Seoul University of Science and Technology (SeoulTech), 139-743, Seoul, Korea

    James J. (Jong Hyuk) Park

  2. Department of Computer Science, University of Georgia, 30602-7404, Athens, GA, USA

    Hamid R. Arabnia

  3. Department of Computer Science and Engineering, Sejong University, 143-747, Seoul, Korea

    Cheonshik Kim

  4. Department of Computer Science, Wayne State University, 48202, Detroit, MI, USA

    Weisong Shi

  5. School of Information Technology Engineering, Catholic University of Daegu, 712-702, Gyeongsan-si, Gyeongbuk, Korea

    Joon-Min Gil

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anousha, S., Ahmadi, M. (2013). An Improved Min-Min Task Scheduling Algorithm in Grid Computing. In: Park, J.J.(.H., Arabnia, H.R., Kim, C., Shi, W., Gil, JM. (eds) Grid and Pervasive Computing. GPC 2013. Lecture Notes in Computer Science, vol 7861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38027-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38027-3_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38026-6

  • Online ISBN: 978-3-642-38027-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation