Standard
An Analytical Bound for Choosing Trivial Strategies in Co-scheduling. / Kuchumov, Ruslan; Korkhov, Vladimir.
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS, ICCSA 2021, PT VIII: 21st International Conference, Cagliari, Italy, September 13–16, 2021, Proceedings, Part VIII. ред. / O Gervasi; B Murgante; S Misra; C Garau; Blecic; D Taniar; BO Apduhan; AMAC Rocha; E Tarantino; CM Torre. Springer Nature, 2021. стр. 381-395 (Lecture Notes in Computer Science; Том 12956).
Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование
Harvard
Kuchumov, R & Korkhov, V 2021,
An Analytical Bound for Choosing Trivial Strategies in Co-scheduling. в O Gervasi, B Murgante, S Misra, C Garau, Blecic, D Taniar, BO Apduhan, AMAC Rocha, E Tarantino & CM Torre (ред.),
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS, ICCSA 2021, PT VIII: 21st International Conference, Cagliari, Italy, September 13–16, 2021, Proceedings, Part VIII. Lecture Notes in Computer Science, Том. 12956, Springer Nature, стр. 381-395, 21st International Conference on Computational Science and Its Applications, ICCSA 2021, Virtual, Online, Италия,
13/09/21.
https://doi.org/10.1007/978-3-030-87010-2_28
APA
Kuchumov, R., & Korkhov, V. (2021).
An Analytical Bound for Choosing Trivial Strategies in Co-scheduling. в O. Gervasi, B. Murgante, S. Misra, C. Garau, Blecic, D. Taniar, BO. Apduhan, AMAC. Rocha, E. Tarantino, & CM. Torre (Ред.),
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS, ICCSA 2021, PT VIII: 21st International Conference, Cagliari, Italy, September 13–16, 2021, Proceedings, Part VIII (стр. 381-395). (Lecture Notes in Computer Science; Том 12956). Springer Nature.
https://doi.org/10.1007/978-3-030-87010-2_28
Vancouver
Kuchumov R, Korkhov V.
An Analytical Bound for Choosing Trivial Strategies in Co-scheduling. в Gervasi O, Murgante B, Misra S, Garau C, Blecic, Taniar D, Apduhan BO, Rocha AMAC, Tarantino E, Torre CM, Редакторы, COMPUTATIONAL SCIENCE AND ITS APPLICATIONS, ICCSA 2021, PT VIII: 21st International Conference, Cagliari, Italy, September 13–16, 2021, Proceedings, Part VIII. Springer Nature. 2021. стр. 381-395. (Lecture Notes in Computer Science).
https://doi.org/10.1007/978-3-030-87010-2_28
Author
Kuchumov, Ruslan ; Korkhov, Vladimir. /
An Analytical Bound for Choosing Trivial Strategies in Co-scheduling. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS, ICCSA 2021, PT VIII: 21st International Conference, Cagliari, Italy, September 13–16, 2021, Proceedings, Part VIII. Редактор / O Gervasi ; B Murgante ; S Misra ; C Garau ; Blecic ; D Taniar ; BO Apduhan ; AMAC Rocha ; E Tarantino ; CM Torre. Springer Nature, 2021. стр. 381-395 (Lecture Notes in Computer Science).
BibTeX
@inproceedings{9558c290de00473a907fb1d67bf14c3b,
title = "An Analytical Bound for Choosing Trivial Strategies in Co-scheduling",
abstract = "Efficient usage of shared high-performance computing (HPC) resources raises the problem of HPC applications co-scheduling, i.e. the problem of execution of multiple applications simultaneously on the same shared computing nodes. Each application may have different requirements for shared resources (e.g. network bandwidth or memory bus bandwidth). When these resources are used concurrently, their resource throughputs may decrease, which leads to performance degradation. In this paper we define application behavior model in co-scheduling environment and formalize a scheduling problem. Within the model we evaluate trivial strategies and compare them with an optimal strategy. The comparison provides a simple analytical criteria for choosing between a naive strategy of running all applications in parallel or any sophisticated strategies that account for applications performance degradation.",
keywords = "Co-scheduling, High performance computing, Linear programming, Scheduling theory",
author = "Ruslan Kuchumov and Vladimir Korkhov",
note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; 21st International Conference on Computational Science and Its Applications, ICCSA 2021, ICCSA 2021 ; Conference date: 13-09-2021 Through 16-09-2021",
year = "2021",
doi = "10.1007/978-3-030-87010-2_28",
language = "English",
isbn = "9783030870096",
series = "Lecture Notes in Computer Science",
publisher = "Springer Nature",
pages = "381--395",
editor = "O Gervasi and B Murgante and S Misra and C Garau and Blecic and D Taniar and BO Apduhan and AMAC Rocha and E Tarantino and CM Torre",
booktitle = "COMPUTATIONAL SCIENCE AND ITS APPLICATIONS, ICCSA 2021, PT VIII",
address = "Germany",
}
RIS
TY - GEN
T1 - An Analytical Bound for Choosing Trivial Strategies in Co-scheduling
AU - Kuchumov, Ruslan
AU - Korkhov, Vladimir
N1 - Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - Efficient usage of shared high-performance computing (HPC) resources raises the problem of HPC applications co-scheduling, i.e. the problem of execution of multiple applications simultaneously on the same shared computing nodes. Each application may have different requirements for shared resources (e.g. network bandwidth or memory bus bandwidth). When these resources are used concurrently, their resource throughputs may decrease, which leads to performance degradation. In this paper we define application behavior model in co-scheduling environment and formalize a scheduling problem. Within the model we evaluate trivial strategies and compare them with an optimal strategy. The comparison provides a simple analytical criteria for choosing between a naive strategy of running all applications in parallel or any sophisticated strategies that account for applications performance degradation.
AB - Efficient usage of shared high-performance computing (HPC) resources raises the problem of HPC applications co-scheduling, i.e. the problem of execution of multiple applications simultaneously on the same shared computing nodes. Each application may have different requirements for shared resources (e.g. network bandwidth or memory bus bandwidth). When these resources are used concurrently, their resource throughputs may decrease, which leads to performance degradation. In this paper we define application behavior model in co-scheduling environment and formalize a scheduling problem. Within the model we evaluate trivial strategies and compare them with an optimal strategy. The comparison provides a simple analytical criteria for choosing between a naive strategy of running all applications in parallel or any sophisticated strategies that account for applications performance degradation.
KW - Co-scheduling
KW - High performance computing
KW - Linear programming
KW - Scheduling theory
UR - http://www.scopus.com/inward/record.url?scp=85115733724&partnerID=8YFLogxK
UR - https://www.mendeley.com/catalogue/8580220b-c3e4-3d32-9137-ab1ffefec9fc/
U2 - 10.1007/978-3-030-87010-2_28
DO - 10.1007/978-3-030-87010-2_28
M3 - Conference contribution
AN - SCOPUS:85115733724
SN - 9783030870096
T3 - Lecture Notes in Computer Science
SP - 381
EP - 395
BT - COMPUTATIONAL SCIENCE AND ITS APPLICATIONS, ICCSA 2021, PT VIII
A2 - Gervasi, O
A2 - Murgante, B
A2 - Misra, S
A2 - Garau, C
A2 - Blecic, null
A2 - Taniar, D
A2 - Apduhan, BO
A2 - Rocha, AMAC
A2 - Tarantino, E
A2 - Torre, CM
PB - Springer Nature
T2 - 21st International Conference on Computational Science and Its Applications, ICCSA 2021
Y2 - 13 September 2021 through 16 September 2021
ER -
