Efficient Data Representation of Large Job Schedules

Varování

Publikace nespadá pod Filozofickou fakultu, ale pod Fakultu informatiky. Oficiální stránka publikace je na webu muni.cz.
Autoři

KLUSÁČEK Dalibor RUDOVÁ Hana

Rok publikování 2011
Druh Článek ve sborníku
Konference MEMICS 2011, Revised Selected Papers
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
Doi http://dx.doi.org/10.1007/978-3-642-25929-6_10
Obor Informatika
Klíčová slova schedule; data structure; binary heap; update procedure
Popis 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.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.