Efficient Data Representation of Large Job Schedules

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F11%3A00053280" target="_blank" >RIV/00216224:14330/11:00053280 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-25929-6_10" target="_blank" >http://dx.doi.org/10.1007/978-3-642-25929-6_10</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-25929-6_10" target="_blank" >10.1007/978-3-642-25929-6_10</a>

Result language
angličtina
Original language name
Efficient Data Representation of Large Job Schedules
Original language description
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.
Czech name
—
Czech description
—

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)