Improving job scheduling on a heterogeneous cluster by predicting job execution times using heuristics

Hannes Brandstätter-Müller, Bahram Parsapour, Andreas Hölzlwimmer, Gerald Lirk, Peter Kulczycki

Research output: Chapter in Book/Report/Conference proceedingsConference contributionpeer-review

Abstract

In this paper, we propose the scheduling system for the Bioinformatics Resource Facility Hagenberg (BiRFH). This system takes advantage of the fact that the facility offers tailored solutions for the customers, which includes having a limited amount of different programs available. Additionally, the BiRFH system provides access to different hardware platforms (standard CPU, GPGPU on NVIDIA Cuda, and IMB Cell on Sony Playstation machines) with multiple versions of the same algorithm optimized for these platforms. The BiRFH scheduling system takes these into account and uses knowledge about past runs and run times to predict the expected run time of a job. That leads to a better scheduling and resource usage. The prediction and scheduling use heuristic and artificial intelligence methods to achieve acceptable results. The paper presents the proposed prediction method as well as an overview of the scheduling algorithm.

Original languageEnglish
Title of host publication23rd European Modeling and Simulation Symposium, EMSS 2011
Pages488-495
Number of pages8
Publication statusPublished - 2011
Event23rd European Modeling and Simulation Symposium, EMSS 2011 - Rome, Italy
Duration: 12 Sept 201114 Sept 2011

Publication series

Name23rd European Modeling and Simulation Symposium, EMSS 2011

Conference

Conference23rd European Modeling and Simulation Symposium, EMSS 2011
Country/TerritoryItaly
CityRome
Period12.09.201114.09.2011

Keywords

  • Algorithms
  • Bioinformatics
  • High performance computing
  • Molecular biology

Fingerprint

Dive into the research topics of 'Improving job scheduling on a heterogeneous cluster by predicting job execution times using heuristics'. Together they form a unique fingerprint.

Cite this