Performance and Fairness for Users in Parallel Job Scheduling
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F63839172%3A_____%2F12%3A00007318" target="_blank" >RIV/63839172:_____/12:00007318 - isvavai.cz</a>
Alternative codes found
RIV/00216224:14330/13:00065954
Result on the web
<a href="http://link.springer.com/chapter/10.1007/978-3-642-35867-8_13" target="_blank" >http://link.springer.com/chapter/10.1007/978-3-642-35867-8_13</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Performance and Fairness for Users in Parallel Job Scheduling
Original language description
In this work we analyze the performance of schedulingrnalgorithms with respect to fairness. In our work we analyze fairness with respect torndifferent users of the system as this is a very important real-life problem.rnWe discussrnhow fair are selected popular scheduling algorithms with respect to different users of rnthe system. Next,we present an extension to the well known Conservative backfilling rnalgorithm. Instead of "ad hoc" decisions,the schedule is now created subject to rnevaluation and optimization. rnNotably,the fairness is considered as an important metric,which accompanies standardrnperformance related metrics such as slowdown or wait time. rnThe new extension improves the performance and fairness of rnConservativebackfilling with respect to other classical techniques such rnas FCFS,EASY backfilling or aggressive backfilling without reservations.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Job Scheduling Strategies for Parallel Processing
ISBN
978-3-642-35866-1
ISSN
—
e-ISSN
—
Number of pages
18
Pages from-to
235-252
Publisher name
Springer
Place of publication
Berlín
Event location
Shanghai, China
Event date
May 25, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—