Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

European Conference on Parallel Processing

Euro-Par 2011: Euro-Par 2011: Parallel Processing Workshops pp 440–449Cite as

  1. Home
  2. Euro-Par 2011: Parallel Processing Workshops
  3. Conference paper
Performance Evaluation of List Based Scheduling on Heterogeneous Systems

Performance Evaluation of List Based Scheduling on Heterogeneous Systems

  • Hamid Arabnejad30 &
  • Jorge G. Barbosa30 
  • Conference paper
  • 1439 Accesses

  • 3 Citations

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

Abstract

This paper addresses the problem of evaluating the schedules produced by list based scheduling algorithms, with metaheuristic algorithms. Task scheduling in heterogeneous systems is a NP-problem, therefore several heuristic approaches were proposed to solve it. These heuristics are categorized into several classes, such as list based, clustering and task duplication scheduling. Here we consider the list scheduling approach. The objective of this study is to assess the solutions obtained by list based algorithms to verify the space of improvement that new heuristics can have considering the solutions obtained with metaheuritcs that are higher time complexity approaches. We concluded that for a low Communication to Computation Ratio (CCR) of 0.1, the schedules given by the list scheduling approach is in average close to metaheuristic solutions. And for CCRs up to 1 the solutions are below 11% worse than the metaheuristic solutions, showing that it may not be worth to use higher complexity approaches and that the space to improve is narrow.

Keywords

  • Schedule Algorithm
  • Tabu Search
  • Direct Acyclic Graph
  • Task Graph
  • Metaheuristic Algorithm

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.

Download conference paper PDF

References

  1. Cerny, V.: Thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. Journal of Optimization Theory and Applications, 41–51 (1985)

    Google Scholar 

  2. Coffman, E.G.: Computer and job-shop scheduling theory. Wiley (1976)

    Google Scholar 

  3. Dhodhi, M.K., Ahmad, I., Yatama, A., et al.: An integrated technique for task matching and scheduling onto distributed heterogeneous computing system. Journal of Parallel and Distributed Computing 62(9), 1338–1361 (2002)

    CrossRef  MATH  Google Scholar 

  4. Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)

    CrossRef  Google Scholar 

  5. Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant algorithms for discrete optimization. Artifitial Life 5, 137–172 (1999)

    CrossRef  Google Scholar 

  6. El-Rewini, H., Lewis, T.G.: Scheduling parallel program tasks onto arbitrary target machines. Journal of Parallel and Distributed Computing 9(2 ), 138–153 (1990)

    CrossRef  Google Scholar 

  7. Glover, F.: Tabu search-part i. ORSA Journal on Computing 1(3), 190–206 (1989)

    CrossRef  MATH  Google Scholar 

  8. Glover, F.: Tabu search-part ii. ORSA Journal on Computing 2(1), 4–32 (1990)

    CrossRef  MATH  Google Scholar 

  9. Kim, D., Yi, B.-G.: A two-pass scheduling algorithm for parallel programs. Parallel Computing 20, 869–885 (1994)

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. Kohler, W.H., Steiglitz, K.: Characterization and theoretical comparison of branch-and-bound algorithms for permutation problems. Journal of ACM 2, 140–156 (1974)

    CrossRef  MathSciNet  Google Scholar 

  12. Kwok, Y., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys 31(4), 406–471 (1999)

    CrossRef  Google Scholar 

  13. Kwok, Y.-K., Ahmad, I.: Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors. IEEE Transactions on Parallel and Distributed Systems 7(5), 506–521 (1996)

    CrossRef  Google Scholar 

  14. Liou, J.-C., Palis, M.A.: A comparison of general approaches to multiprocessor scheduling. In: International Parallel Processing Symposium, pp. 152–156 (1997)

    Google Scholar 

  15. Papadimitriou, C., Yannakakis, M.: Scheduling interval ordered tasks. SIAM Journal of Computing 5, 73–82 (1976)

    CrossRef  Google Scholar 

  16. DAG Generation Program (2010), http://www.loria.fr/~suter/dags.html

  17. Sinnen, O., Sousa, L.: List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures. Parallel Computing 30, 81–101 (2004)

    CrossRef  Google Scholar 

  18. Topcuoglu, H., Hariri, S., Wu, M.-Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems 13(3), 260–274 (2002)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculdade de Engenharia, Dep. de Engenharia Informática, Laboratório de Intelegência Artificial e Ciência dos Computadores, Universidade do Porto, Rua Dr. Roberto Frias, s/n, 4200-465, Porto, Portugal

    Hamid Arabnejad & Jorge G. Barbosa

Authors
  1. Hamid Arabnejad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jorge G. Barbosa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Scilytics, Koellnerhofgasse 3/15A, 1010, Vienna, Austria

    Michael Alexander

  2. ICAR-CNR, Via P. Castellino, 111, 80131, Napoli, Italy

    Pasqua D’Ambra

  3. University of Amsterdam, 1090, Amsterdam, Netherlands

    Adam Belloum

  4. Innovative Computing Laboratory, The University of Tennessee, USA

    George Bosilca

  5. Department of Experimental Medicine and Clinic, University Magna Græcia, 88100, Catanzaro, Italy

    Mario Cannataro

  6. Computer Science Department, University of Pisa, Italy

    Marco Danelutto

  7. Second University of Naples, Italy

    Beniamino Di Martino

  8. TU München, Boltzmannstr. 3, 85748, Garching, Germany

    Michael Gerndt

  9. Equipe Runtime, INRIA Bordeaux Sud-Ouest, 33405, Talence Cedex, France

    Emmanuel Jeannot & Raymond Namyst & 

  10. Equipe HIEPACS, INRIA Bordeaux Sud-Ouest, 33405, Talence Cedex, France

    Jean Roman

  11. Oak Ridge National Laboratory, Computer Science and Mathematics Division, 37831-6164, Oak Ridge, TN, USA

    Stephen L. Scott

  12. Department of Scientific Computing, University of Vienna, Nordbergstr. 15/3C, 1090, Vienna, Austrial

    Jesper Larsson Traff

  13. Computer Science and Mathematics Division, Oak Ridge National Laboratory, 37831, Oak Ridge, TN, USA

    Geoffroy Vallée

  14. Technische Universität München, Germany

    Josef Weidendorfer

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arabnejad, H., Barbosa, J.G. (2012). Performance Evaluation of List Based Scheduling on Heterogeneous Systems. In: Alexander, M., et al. Euro-Par 2011: Parallel Processing Workshops. Euro-Par 2011. Lecture Notes in Computer Science, vol 7155. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29737-3_49

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-29737-3_49

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature