Resource Management Architecture for Fair Scheduling of Optional Computations
2013 (English)In: 2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing: 3PGCIC 2013 / [ed] Fatos Xhafa, Leonard Barolli, Dritan Nace, Salvatore Vinticinque and Alain Bui, IEEE Computer Society, 2013, 113-120 p.Conference paper (Refereed)
Most HPC platforms require users to submit a pre-determined number of computation requests (also called jobs). Unfortunately, this is cumbersome when some of the computations are optional, i.e., they are not critical, but their completion would improve results. For example, given a deadline, the number of requests to submit for a Monte Carlo experiment is difficult to choose. The more requests are completed, the better the results are, however, submitting too many might overload the platform. Conversely, submitting too few requests may leave resources unused and misses an opportunity to improve the results.
This paper introduces and solves the problem of scheduling optional computations. An architecture which auto-tunes the number of requests is proposed, then implemented in the DIET GridRPC middleware. Real-life experiments show that several metrics are improved, such as user satisfaction, fairness and the number of completed requests. Moreover, the solution is shown to be scalable.
Place, publisher, year, edition, pages
IEEE Computer Society, 2013. 113-120 p.
resource management, scheduling, optional computations, deadline
Research subject Computer Science
IdentifiersURN: urn:nbn:se:umu:diva-84210DOI: 10.1109/3PGCIC.2013.23Archive number: 10.1109/3PGCIC.2013.23OAI: oai:DiVA.org:umu-84210DiVA: diva2:680468
8th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, 28-30 October 2013 Compiègne, France