Efficient Data Representation of Large Job Schedules

D 2011

Efficient Data Representation of Large Job Schedules

KLUSÁČEK, Dalibor and Hana RUDOVÁ

Basic information

Original name

Efficient Data Representation of Large Job Schedules

Authors

KLUSÁČEK, Dalibor (203 Czech Republic, guarantor, belonging to the institution) and Hana RUDOVÁ (203 Czech Republic, belonging to the institution)

Edition

Berlin, MEMICS 2011, Revised Selected Papers, p. 103-113, 12 pp. 2011

Publisher

Springer, Lecture Notes in Computer Science 7119

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Germany

Confidentiality degree

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

Publication form

printed version "print"

RIV identification code

RIV/00216224:14330/11:00053280

Organization unit

Faculty of Informatics

ISBN

978-3-642-25928-9

DOI

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

Keywords in English

schedule; data structure; binary heap; update procedure

Abstract

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.

Links

MSM0021622419, plan (intention)

Name: Vysoce paralelní a distribuované výpočetní systémy

Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems

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

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

Investor: Masaryk University, Category A

Citovat

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.

@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.

Detailed Information on Publication Record