umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Resource Management Architecture for Fair Scheduling of Optional Computations
University of Toulouse / ENSEEIHT.
University of Lyon / École Normale Supérieure de Lyon. (Avalon)
University of Toulouse / ENSEEIHT.
University of Toulouse / ENSEEIHT.
Show others and affiliations
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, Published paper (Refereed)
Abstract [en]

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.
Keyword [en]
resource management, scheduling, optional computations, deadline
National Category
Computer Systems
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:umu:diva-84210DOI: 10.1109/3PGCIC.2013.23Archive number: 10.1109/3PGCIC.2013.23OAI: oai:DiVA.org:umu-84210DiVA: diva2:680468
Conference
8th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, 28-30 October 2013 Compiègne, France
Available from: 2013-12-18 Created: 2013-12-18 Last updated: 2014-02-05Bibliographically approved

Open Access in DiVA

fulltext(304 kB)154 downloads
File information
File name FULLTEXT01.pdfFile size 304 kBChecksum SHA-512
ff0da196b52399214b60eb4195373dd0a0d335890af7d99b91452168e83d223f86f7788aa99e8122f4e5493ccd0d5d3e3db069690babfed545307f243ce76dc6
Type fulltextMimetype application/pdf

Other links

Publisher's full textconference websiteResource Management Architecture for Fair Scheduling of Optional Computations

Authority records BETA

Klein, Cristian

Search in DiVA

By author/editor
Klein, Cristian
By organisation
Department of Computing Science
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 154 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 172 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf