| KLUSÁČEK, Dalibor and Hana RUDOVÁ. Efficient Data Representation of Large Job Schedules. In MEMICS 2011, Revised Selected Papers. Berlin: Springer, Lecture Notes in Computer Science 7119, 2011, p. 103-113, 12 pp. ISBN 978-3-642-25928-9. Available from: https://dx.doi.org/10.1007/978-3-642-25929-6_10. |
Other formats:
BibTeX
LaTeX
RIS
@inproceedings{951255,
author = {Klusáček, Dalibor and Rudová, Hana},
address = {Berlin},
booktitle = {MEMICS 2011, Revised Selected Papers},
doi = {http://dx.doi.org/10.1007/978-3-642-25929-6_10},
keywords = {schedule; data structure; binary heap; update procedure},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Berlin},
isbn = {978-3-642-25928-9},
pages = {103-113},
publisher = {Springer, Lecture Notes in Computer Science 7119},
title = {Efficient Data Representation of Large Job Schedules},
year = {2011}
}
TY - JOUR
ID - 951255
AU - Klusáček, Dalibor - Rudová, Hana
PY - 2011
TI - Efficient Data Representation of Large Job Schedules
PB - Springer, Lecture Notes in Computer Science 7119
CY - Berlin
SN - 9783642259289
KW - schedule
KW - data structure
KW - binary heap
KW - update procedure
N2 - The increasing popularity of advanced schedule-based techniques designed to solve Grid scheduling problems requires the use of efficient data structures to represent the constructed job schedules. Based on our previous research in the area of advanced scheduling algorithms we have developed data representation designed to maintain large job schedules. We provide new details of the applied representation, especially about the binary heap structure that guarantees good efficiency of the crucial schedule update procedure which is used to keep the schedule consistent and up-to-date subject to dynamically changing state of the system. We prove the time complexity related to the use of such a structure and--using an experimental evaluation--we demonstrate the performance of this structure even for very large job schedules.
ER -
KLUSÁČEK, Dalibor and Hana RUDOVÁ. Efficient Data Representation of Large Job Schedules. In \textit{MEMICS 2011, Revised Selected Papers}. Berlin: Springer, Lecture Notes in Computer Science 7119, 2011, p.~103-113, 12 pp. ISBN~978-3-642-25928-9. Available from: https://dx.doi.org/10.1007/978-3-642-25929-6\_{}10.
|
