Skip to main content
SpringerLink
Log in

A New Heuristic Algorithm for Improving Total Completion Time in Grid Computing

  • Conference paper
Multimedia and Ubiquitous Engineering

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 308))

Abstract

Grid is a large scale distributed system, concerned with coordinated resource sharing and problem solving. To make effective use of the huge capabilities of the grids, efficient task scheduling heuristic for improving time are required. Total completion time is an important factor for assessment of algorithm in Grid. Many algorithms for decreasing of total completion time have been implemented so far. In this paper, we propose new scheduling heuristic based on well known task scheduling algorithms, Min-Min. The proposed heuristic tries to use the advantages of this basic algorithm and avoids its fails. To achieve this, the proposed heuristic presented a new strategy for choosing appropriate resource in any round. The simulation results by Gridsim show that the new heuristic can improve performance for a variety of assumptions.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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 serviceoriented 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., McGough, A.S., 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 (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. Litzkow, M., Livny, M., Mutka, M.: Condor – A Hunter of Idle Workstations. In: Proc. the 8th International Conference of Distributed Computing Systems, San Jose, California, pp. 104–111 (June 1988)

    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 

  18. Izakian, H., Abraham, A., Snasel, V.: Comparison of heuristics for scheduling independent tasks on heterogeneous distributed environments. In: CSO 2009: Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization, pp. 8–12. IEEE Computer Society, Washington, DC (2009)

    Chapter  Google Scholar 

  19. Xhafa, F., Abraham, A.: Computational models and heuristics methods for grid scheduling problems. Future Generation Computer Systems 26, 608–621 (2010)

    Article  Google Scholar 

  20. Choon Lee, Y., Subrata, R., Zomaya, A.Y.: On the Performance of a Dual-Objective Optimization Model for Workflow Applications on Grid Platforms. IEEE Transactions on Parallel and Distributed Systems 20(9), 1273–1284 (2009)

    Article  Google Scholar 

  21. Priya, S.B., Subramaniam, C., Ravichandran, T.: On Demand Check Pointing for Grid Application Reliability using Communicating Process Model. IEEE (2011)

    Google Scholar 

  22. Kadhim, S.J., Al-Aubidy, K.M.: Design and Evaluation of a Fuzzy-Based CPU Scheduling Algorithm. In: Das, V.V., et al. (eds.) BAIP 2010. CCIS, vol. 70, pp. 45–52. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Payame Noor University, Tehran, Iran

    Soheil Anousha & Shoeib Anousha

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

    Mahmood Ahmadi

Authors
  1. Soheil Anousha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shoeib Anousha
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mahmood Ahmadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Soheil Anousha .

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Seoul University of Science & and Technology (SeoulTech), Seoul, Korea, Republic of (South Korea)

    James J. (Jong Hyuk) Park

  2. School of Computing and Information Sciences, Florida International University, Miami, Florida, Florida, USA

    Shu-Ching Chen

  3. School of IT Engineering, Catholic University of Daegu, Kyungsan-shi, Korea, Republic of (South Korea)

    Joon-Min Gil

  4. School of Computer Science and Engineeri, The University of Aizu, Aizu-Wakamatsu City, Fukushima, Japan

    Neil Y. Yen

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anousha, S., Anousha, S., Ahmadi, M. (2014). A New Heuristic Algorithm for Improving Total Completion Time in Grid Computing. In: Park, J., Chen, SC., Gil, JM., Yen, N. (eds) Multimedia and Ubiquitous Engineering. Lecture Notes in Electrical Engineering, vol 308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54900-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54900-7_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54899-4

  • Online ISBN: 978-3-642-54900-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation