Efficient Data Representation of Large Job Schedules

D 2011

Efficient Data Representation of Large Job Schedules

KLUSÁČEK, Dalibor a Hana RUDOVÁ

Základní údaje

Originální název

Efficient Data Representation of Large Job Schedules

Autoři

KLUSÁČEK, Dalibor a Hana RUDOVÁ

Vydání

Berlin, MEMICS 2011, Revised Selected Papers, od s. 103-113, 12 s. 2011

Nakladatel

Springer, Lecture Notes in Computer Science 7119

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Německo

Utajení

není předmětem státního či obchodního tajemství

Forma vydání

tištěná verze "print"

Označené pro přenos do RIV

Ano

Kód RIV

RIV/00216224:14330/11:00053280

Organizační jednotka

Fakulta informatiky

ISBN

978-3-642-25928-9

DOI

https://doi.org/10.1007/978-3-642-25929-6_10

Klíčová slova anglicky

schedule; data structure; binary heap; update procedure

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 10. 4. 2014 15:51, doc. Mgr. Hana Rudová, Ph.D.

Anotace

V originále

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.

Návaznosti

MSM0021622419, záměr

Název: Vysoce paralelní a distribuované výpočetní systémy

Investor: Ministerstvo školství, mládeže a tělovýchovy ČR, Vysoce paralelní a distribuované výpočetní systémy

MUNI/A/0914/2009, interní kód MU

Název: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace (Akronym: SV-FI MAV)

Investor: Masarykova univerzita, Rozsáhlé výpočetní systémy: modely, aplikace a verifikace, DO R. 2020_Kategorie A - Specifický výzkum - Studentské výzkumné projekty

Citovat

KLUSÁČEK, Dalibor a Hana RUDOVÁ. Efficient Data Representation of Large Job Schedules. In MEMICS 2011, Revised Selected Papers. Berlin: Springer, Lecture Notes in Computer Science 7119, 2011, s. 103-113, 12 s. ISBN 978-3-642-25928-9. Dostupné z: https://doi.org/10.1007/978-3-642-25929-6_10.

@inproceedings{951255,
   author = {Klusáček, Dalibor and Rudová, Hana},
   address = {Berlin},
   booktitle = {MEMICS 2011, Revised Selected Papers},
   doi = {https://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  - CONF
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 a 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, s.~103-113, 12 s. ISBN~978-3-642-25928-9. Dostupné z: https://doi.org/10.1007/978-3-642-25929-6\_{}10.

Přehled o publikaci