Skip to main content

A Genetic-Based Scheduling Algorithm to Minimize the Makespan of the Grid Applications

  • Conference paper
Grid and Distributed Computing, Control and Automation (GDC 2010, CA 2010)

Abstract

Task scheduling algorithms in grid environments strive to maximize the overall throughput of the grid. In order to maximize the throughput of the grid environments, the makespan of the grid tasks should be minimized. In this paper, a new task scheduling algorithm is proposed to assign tasks to the grid resources with goal of minimizing the total makespan of the tasks. The algorithm uses the genetic approach to find the suitable assignment within grid resources. The experimental results obtained from applying the proposed algorithm to schedule independent tasks within grid environments demonstrate the applicability of the algorithm in achieving schedules with comparatively lower makespan in comparison with other well-known scheduling algorithms such as, Min-min, Max-min, RASA and Sufferage algorithms.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Montero, R.S., Huedo, E., Llorente, I.M.: Benchmarking of High Throughput Computing Applications on Grids. Journal of Parallel Computing 32, 267–279 (2006)

    Article  Google Scholar 

  2. Xue, Y., Wang, Y., Wang, J., Luo, Y., Hu, Y., Zhong, S., Tang, J., Cai, G., Guan, Y.: High Throughput Computing for Spatial Information Processing (HIT-SIP) System on Grid Platform. In: Sloot, P.M.A., Hoekstra, A.G., Priol, T., Reinefeld, A., Bubak, M. (eds.) EGC 2005. LNCS, vol. 3470, pp. 40–49. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Condor Project, http://www.cs.wisc.edu/condor/overview/

  4. 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 

  5. Hsu, C.-H., Chen, T.-L., Li, K.-C.: Performance Effective Pre-scheduled Strategy for Heterogeneous Grid Systems in the Master Slave Paradigm. Journal of Future Generation Computer Systems 23, 569–579 (2007)

    Article  Google Scholar 

  6. Foster, I., Kesselman, C.: The Grid 2: Blueprint for a New Computing Infrastructure, 2nd edn. Elsevier and Morgan Kaufmann, San Francisco (2004)

    Google Scholar 

  7. Maheswaran, M., Ali, S., Siegel, H.J., 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 

  8. Braun, T.D., Siegel, H.J., 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  MATH  Google Scholar 

  9. Tseng, L.-Y., Chin, Y.-H., Wang, S.-C.: A Minimized Makespan Scheduler with Multiple Factors for Grid Computing Systems. Journal of Expert Systems with Applications 35, 11118–11130 (2009)

    Article  Google Scholar 

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

    Google Scholar 

  11. Wang, L., Siegel, H.J., Roychowdhury, V.P., Maciejewski, A.A.: Task Matching and Scheduling in Heterogeneous Computing Environments Using a Genetic-Algorithm-Based Approach. Journal of Parallel and Distributed Computing 47, 1–15 (1997)

    Article  Google Scholar 

  12. Munir, E.U., Li, J., Shi, S.: QoS Sufferage Heuristic for Independent Task Scheduling in Grid. Information Technology Journal 6, 1166–1170 (2007)

    Article  Google Scholar 

  13. Briceno, L.D., Oltikar, M., Siegel, H.J., Maciejewski, A.A.: Study of an Iterative Technique to Minimize Completion Times of Non-Makespan Machines. In: The 21st International Parallel and Distributed Processing Symposium, California, pp. 1–14 (2007)

    Google Scholar 

  14. Levitin, G., Dai, Y.-S.: Optimal Service Task Partition and Distribution in Grid System with Star Topology. Reliability Engineering and System Safety 93, 152–159 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Entezari-Maleki, R., Movaghar, A. (2010). A Genetic-Based Scheduling Algorithm to Minimize the Makespan of the Grid Applications. In: Kim, Th., Yau, S.S., Gervasi, O., Kang, BH., Stoica, A., Ślęzak, D. (eds) Grid and Distributed Computing, Control and Automation. GDC CA 2010 2010. Communications in Computer and Information Science, vol 121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17625-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17625-8_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17624-1

  • Online ISBN: 978-3-642-17625-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics