umu.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • 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.
Visa övriga samt affilieringar
2013 (Engelska)Ingår i: 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, s. 113-120Konferensbidrag, Publicerat paper (Refereegranskat)
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.

Ort, förlag, år, upplaga, sidor
IEEE Computer Society, 2013. s. 113-120
Nyckelord [en]
resource management, scheduling, optional computations, deadline
Nationell ämneskategori
Datorsystem
Forskningsämne
datalogi
Identifikatorer
URN: urn:nbn:se:umu:diva-84210DOI: 10.1109/3PGCIC.2013.23Arkivnummer: 10.1109/3PGCIC.2013.23OAI: oai:DiVA.org:umu-84210DiVA, id: diva2:680468
Konferens
8th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, 28-30 October 2013 Compiègne, France
Tillgänglig från: 2013-12-18 Skapad: 2013-12-18 Senast uppdaterad: 2018-06-08Bibliografiskt granskad

Open Access i DiVA

fulltext(304 kB)250 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 304 kBChecksumma SHA-512
ff0da196b52399214b60eb4195373dd0a0d335890af7d99b91452168e83d223f86f7788aa99e8122f4e5493ccd0d5d3e3db069690babfed545307f243ce76dc6
Typ fulltextMimetyp application/pdf

Övriga länkar

Förlagets fulltextconference websiteResource Management Architecture for Fair Scheduling of Optional Computations

Personposter BETA

Klein, Cristian

Sök vidare i DiVA

Av författaren/redaktören
Klein, Cristian
Av organisationen
Institutionen för datavetenskap
Datorsystem

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 250 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 451 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf