Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Heterogeneous computing scheduling with evolutionary algorithms

  • Original Paper
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

This work presents sequential and parallel evolutionary algorithms (EAs) applied to the scheduling problem in heterogeneous computing environments, a NP-hard problem with capital relevance in distributed computing. These methods have been specifically designed to provide accurate and efficient solutions by using simple operators that allow them to be later extended for solving realistic problem instances arising in distributed heterogeneous computing (HC) and grid systems. The EAs were codified over MALLBA, a general-purpose library for combinatorial optimization. Efficient numerical results are reported in the experimental analysis performed on well-known problem instances. The comparative study of scheduling methods shows that the parallel versions of the implemented evolutionary algorithms are able to achieve high problem solving efficacy, outperforming traditional scheduling heuristics and also improving over previous results already reported in the related literature.

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

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Abraham A, Buyya R, Nath B (2000) Nature heuristics for scheduling jobs on computational grids. In: Proceedings of 8th IEEE international conference on advanced computing and communications, pp 45–52

  • Alba E (2005) Parallel metaheuristics: a new class of algorithms. Wiley, New York. ISBN 0471678066

  • Alba E, Tomassini M (2002) Parallelism and evolutionary algorithms. IEEE Trans Evol Comput 6(5):443–462

    Article  Google Scholar 

  • Alba E, Almeida F, Blesa M, Cotta C, Diaz M, Dorta I, Gabarró J, González J, León C, Moreno L, Petit J, Roda J, Rojas A, Xhafa F (2002) MALLBA: a library of skeletons for combinatorial optimisation. In: Proceedings of the Euro-Par, pp 927–932

  • Ali S, Siegel H, Maheswaran M, Ali S, Hensgen D (2000) Task execution time modeling for heterogeneous computing systems. In: Proceedings of the 9th heterogeneous computing workshop, Washington, DC, USA, IEEE Computer Society, p 185

  • Bäck T, Fogel D, Michalewicz Z (eds) (1997) Handbook of evolutionary computation. Oxford University Press

  • Berman F, Fox G, Hey A (2003) Grid computing: making the global infrastructure a reality. Wiley, New York. ISBN 0470853190

  • Boyer W, Hura G (2005) Non-evolutionary algorithm for scheduling dependent tasks in distributed heterogeneous computing environments. J Parallel Distrib Comput 65(9):1035–1046

    Article  MATH  Google Scholar 

  • Braun T, Siegel H, Beck N, Bölöni L, Maheswaran M, Reuther A, Robertson J, Theys M, Yao B, Hensgen D, Freund R (2001) A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J Parallel Distrib Comput 61(6):810–837

    Article  Google Scholar 

  • Braun T, Siegel H, Maciejewski A, Hong Y (2008) Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions. J Parallel Distrib Comput 68(11):1504–1516

    Article  Google Scholar 

  • Davis L (1991) Handbook of genetic algorithms. van Nostrand Reinhold, New York

    Google Scholar 

  • Davis E, Jaffe J (1981) Algorithms for scheduling tasks on unrelated processors. J ACM 28(4):721–736

    Article  MathSciNet  MATH  Google Scholar 

  • Duran B, Xhafa F (2006) The effects of two replacement strategies on a genetic algorithm for scheduling jobs on computational grids. In: Proceedings of the 2006 ACM symposium on applied computing, New York. ACM, pp 960–961

  • El-Rewini H, Lewis T, Ali H (1994) Task scheduling in parallel and distributed systems. Prentice-Hall, Upper Saddle River. ISBN 0-13-099235-6

  • Eshaghian M (1996) Heterogeneous computing. Artech House, Norwood, MA, USA. ISBN 0-8906-552-7

  • Eshelman L (1991) The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination. In: Foundations of genetics algorithms. Morgan Kaufmann Publishers, Los Altos, pp 265–283

  • Foster I, Kesselman C (1998) The grid: blueprint for a future computing infrastructure. Morgan Kaufmann Publishers, Los Altos

  • Freund R, Sunderam V, Gottlieb A, Hwang K, Sahni S (1994) Special issue on heterogeneous processing. J Parallel Distrib Comput 21(3)

  • Garey M, Johnson D (1979) Computers and intractability. Freeman, New York

  • Goldberg D (1989) Genetic algorithms in search, optimization, and machine learning. Addison Wesley, New York

    MATH  Google Scholar 

  • Grajcar M (1999) Genetic list scheduling algorithm for scheduling and allocation on a loosely coupled heterogeneous multiprocessor system. In: Proceedings of the 36th ACM/IEEE conference on design automation, New York. ACM, pp 280–285

  • Grajcar M (2001) Strengths and weaknesses of genetic list scheduling for heterogeneous systems. In: Proceedings of international conference on application of concurrency to system design, pp 123n++–132. IEEE

  • Ibarra O, Kim E (1977) Heuristic algorithms for scheduling independent tasks on nonidentical processors. J ACM 24(2):280–289

    Article  MathSciNet  MATH  Google Scholar 

  • Kwok Y, Ahmad I (1997) Efficient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm. J Parallel Distrib Comput 47:58–77

    Article  Google Scholar 

  • Leung J, Kelly L, Anderson J (2004) Handbook of scheduling: algorithms, models, and performance analysis. CRC Press, Inc., Boca Raton. ISBN 1584883979

  • Li H, Groep D, Templon J, Wolters L (2004) Predicting job start times on clusters. In: Proceedings of the 2004 IEEE international symposium on cluster computing and the grid, Washington. IEEE Computer Society, pp 301–308

  • Luo P, Lü K, Shi Z (2007) A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems. J Parallel Distrib Comput 67(6):695–714

    Article  MATH  Google Scholar 

  • Makhorin A (2006) GNU linear programming kit, version 4.9. GNU Software Foundation. http://www.gnu.org/software/glpk/glpk.html

  • Ritchie G, Levine J (2004) A hybrid ant algorithm for scheduling independent jobs in heterogeneous computing environments. In: Proceedings of the 23rd workshop of the UK Planning and Scheduling Special Interest Group

  • Wang L, Siegel H, Roychowdhury V, Maciejewski A (1997) Task matching and scheduling in heterogeneous computing environments using a genetic-algorithm-based approach. J Parallel Distrib Comput 47(1):8–22

    Article  Google Scholar 

  • Wu A, Yu H, Jin S, Lin K, Schiavone G (2004) An incremental genetic algorithm approach to multiprocessor scheduling. IEEE Trans Parallel Distrib Syst 15(9):824–834

    Article  Google Scholar 

  • Xhafa F (2007) A hybrid evolutionary heuristic for job scheduling in computational grids, chapter 10. Springer Verlag Series: studies in computational intelligence, vol 75

  • Xhafa F, Duran B (2008) Parallel memetic algorithms for independent job scheduling in computational grids. In: Cotta C, van Hemert J (eds) Recent advances in evolutionary computation for combinatorial optimization, volume 153 of Studies in computational intelligence. Springer, New York, pp 219–239

  • Xhafa F, Carretero J, Abraham A (2007) Genetic algorithm based schedulers for grid computing systems. Int J Innovative Comput Inf Control 3(5):1–19

    Google Scholar 

  • Xhafa F, Alba E, Dorronsoro B, Duran B (2008a) Efficient batch job scheduling in grids using cellular memetic algorithms. J Math Model Algorithms 7(2):217–236

    Article  MathSciNet  MATH  Google Scholar 

  • Xhafa F, Carretero J, Alba E, Dorronsoro B (2008b) Design and evaluation of tabu search method for job scheduling in distributed environments. In: Proceedings of the 21th international parallel and distributed processing symposium. IEEE Computer Society, pp 1–8

  • Xhafa F, Duran B, Abraham A, Dahal K (2008c) Tuning struggle strategy in genetic algorithms for scheduling in computational grids. In: Proceedings of the 7th Computer information systems and industrial management applications, Washington, DC, USA. IEEE Computer Society, pp 275–280

  • Yang J, Ahmad I, Ghafoor A (1993) Estimation of execution times on heterogeneous supercomputer architectures. In: Proceedings of the 1993 international conference on parallel processing, Washington, DC, USA, IEEE Computer Society, pp 219–226

  • Zomaya A, Teh Y (2001) Observations on using genetic algorithms for dynamic load-balancing. IEEE Trans Parallel Distrib Syst 12(9):899–911

    Article  Google Scholar 

Download references

Acknowledgments

The work of S. Nesmachnow and H. Cancela has been partially supported by Programa de Desarrollo de las Ciencias Básicas, Comisión Sectorial de Investigación Científica, Universidad de la República, and Agencia Nacional de Investigación e Innovación, Uruguay. The work of E. Alba has been partially funded by the Spanish government and European FEDER through contract TIN2008-06491-C04-01 (M* project), and by the Andalusian government through contract P07-TIC-03044 (DIRICOM project).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sergio Nesmachnow.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nesmachnow, S., Cancela, H. & Alba, E. Heterogeneous computing scheduling with evolutionary algorithms. Soft Comput 15, 685–701 (2010). https://doi.org/10.1007/s00500-010-0594-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-010-0594-y

Keywords