Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1076174,
author = {Klusáček, Dalibor and Rudová, Hana},
address = {Berlin},
booktitle = {Job Scheduling Strategies for Parallel Processing},
doi = {http://dx.doi.org/10.1007/978-3-642-35867-8_13},
editor = {Cirne, W.; Desai, N.; Frachtenberg, E.; Schwiegelshohn, U.},
keywords = {Scheduling; Fairness; Metaheuristic; Backfilling},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Berlin},
isbn = {978-3-642-35866-1},
pages = {235-252},
publisher = {Lecture Notes in Computer Science 7698, Springer},
title = {Performance and Fairness for Users in Parallel Job Scheduling},
url = {http://www.springer.com/computer/swe/book/978-3-642-35866-1},
year = {2013}
}
TY - JOUR
ID - 1076174
AU - Klusáček, Dalibor - Rudová, Hana
PY - 2013
TI - Performance and Fairness for Users in Parallel Job Scheduling
PB - Lecture Notes in Computer Science 7698, Springer
CY - Berlin
SN - 9783642358661
KW - Scheduling
KW - Fairness
KW - Metaheuristic
KW - Backfilling
UR - http://www.springer.com/computer/swe/book/978-3-642-35866-1
N2 - In this work we analyze the performance of scheduling algorithms with respect to fairness. Existing works frequently consider fairness as a job related issue. In our work we analyze fairness with respect to different users of the system as this is a very important real-life problem. First, we discuss how fair are selected popular scheduling algorithms with respect to different users of the system. Next, we present an extension to the well known Conservative backfilling algorithm. Instead of “ad hoc” decisions, the schedule is now created subject to evaluation and optimization. Notably, the fairness is considered as an important metric, which accompanies standard performance related metrics such as slowdown or wait time. To achieve that, an inclusion of fairness as an optimization criterion is proposed. The new extension improves the performance and fairness of Conservative backfilling with respect to other classical techniques such as FCFS, EASY backfilling or aggressive backfilling without reservations.
ER -
KLUSÁČEK, Dalibor a Hana RUDOVÁ. Performance and Fairness for Users in Parallel Job Scheduling. Online. In Cirne, W.; Desai, N.; Frachtenberg, E.; Schwiegelshohn, U. \textit{Job Scheduling Strategies for Parallel Processing}. Berlin: Lecture Notes in Computer Science 7698, Springer, 2013. s.~235-252. ISBN~978-3-642-35866-1. Dostupné z: https://dx.doi.org/10.1007/978-3-642-35867-8\_{}13. [citováno 2024-04-24]
|
