Publication details

<< back
 

Efficient Data Representation of Large Job Schedules

Basic information
Original title:Efficient Data Representation of Large Job Schedules
Authors:Dalibor Klusáček, Hana Rudová
Further information
Citation:KLUSÁČEK, Dalibor - RUDOVÁ, Hana. Efficient Data Representation of Large Job Schedules. In MEMICS 2011, Revised Selected Papers. Berlin : Springer, Lecture Notes in Computer Science 7119, 2011. ISBN 978-3-642-25928-9, pp. 103-113. 2011, Lednice.
Original language:English
Field:Informatika
Type:Article in Proceedings
Keywords:schedule; data structure; binary heap; update procedure

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.

Related projects:

 
 
top