Scheduling HPC Workflows for Responsiveness and Fairness with Networking Delays and Inaccurate Estimates of Execution Times

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Author(s)

Department/unit(s)

Publication details

Title of host publicationProceedings of the 19th International Conference on Parallel Processing (Euro-Par 2013)
DatePublished - 2013
Pages126-137
Number of pages12
PublisherSpringer Berlin / Heidelberg
EditorsFelix Wolf, Bernd Mohr, Dieter Mey
Volume8097
Original languageEnglish
ISBN (Electronic)978-3-642-40047-6
ISBN (Print)978-3-642-40046-9

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg

Abstract

High-Performance Computing systems (HPCs) have grown in popularity in recent years, especially in the form of Grid and Cloud platforms. These platforms may be subject to periods of overload. In our previous research, we found that the Projected-SLR list scheduling policy provides responsiveness and a starvation-free scheduling guaran- tee in a realistic HPC scenario. This paper extends the previous work to consider networking delays in the platform model and inaccurate esti- mates of execution times in the application model. P-SLR is shown to be competitive with the best alternative scheduling policies in the presence of network costs (up to 400% computation time) and where execution time estimate inaccuracies are within generous error bounds (

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations