Advertisement

Efficient Data Representation of Large Job Schedules

  • Dalibor Klusáček
  • Hana Rudová
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7119)

Abstract

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 data structure. The heap 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.

Keywords

Completion Time Data Representation Resource Management System Advanced Reservation Initial Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abraham, A., Liu, H., Grosan, C., Xhafa, F.: Nature inspired meta-heuristics for Grid scheduling: Single and multi-objective optimization approaches. In: Metaheuristics for Scheduling in Distributed Computing Environments [17], pp. 247–272Google Scholar
  2. 2.
    Baptiste, P., Pape, C.L., Nuijten, W.: Constraint-based scheduling: Applying constraint programming to scheduling problems. Kluwer (2001)Google Scholar
  3. 3.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press (2001)Google Scholar
  4. 4.
    Feitelson, D.G., Weil, A.M.: Utilization and predictability in scheduling the IBM SP2 with backfilling. In: 12th International Parallel Processing Symposium, pp. 542–546. IEEE (1998)Google Scholar
  5. 5.
    Foster, I., Kesselman, C.: The Grid 2: Blueprint for a New Computing Infrastructure, 2nd edn. Morgan Kaufmann (2004)Google Scholar
  6. 6.
    Hovestadt, M., Kao, O., Keller, A., Streit, A.: Scheduling in HPC Resource Management Systems: Queuing vs. Planning. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol. 2862, pp. 1–20. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  7. 7.
    Keller, A., Reinefeld, A.: Anatomy of a resource management system for HPC clusters. Annual Review of Scalable Computing 3, 1–31 (2001)CrossRefzbMATHGoogle Scholar
  8. 8.
    Klusáček, D.: Event-based Optimization of Schedules for Grid Jobs. PhD thesis, Masaryk University (submitted, 2011) Google Scholar
  9. 9.
    Klusáček, D., Rudová, H.: Efficient Grid scheduling through the incremental schedule-based approach. Computational Intelligence: An International Journal 27(1), 4–22 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Klusáček, D., Rudová, H., Baraglia, R., Pasquali, M., Capannini, G.: Comparison of multi-criteria scheduling techniques. In: Grid Computing Achievements and Prospects, pp. 173–184. Springer, Heidelberg (2008)Google Scholar
  11. 11.
    Mu’alem, A.W., Feitelson, D.G.: Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling. IEEE Transactions on Parallel and Distributed Systems 12(6), 529–543 (2001)CrossRefGoogle Scholar
  12. 12.
    Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Prentice-Hall (2002)Google Scholar
  13. 13.
    Sgall, J.: On-line scheduling – a survey. In: Fiat, A. (ed.) Dagstuhl Seminar 1996. LNCS, vol. 1442, pp. 196–231. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  14. 14.
    Smith, W., Foster, I., Taylor, V.: Scheduling with advanced reservations. In: International Parallel and Distributed Processing Symposium (IPDPS 2000), pp. 127–132 (2000)Google Scholar
  15. 15.
    Süß, W., Jakob, W., Quinte, A., Stucky, K.-U.: GORBA: A global optimising resource broker embedded in a Grid resource management system. In: International Conference on Parallel and Distributed Computing Systems, PDCS 2005, pp. 19–24. IASTED/ACTA Press (2005)Google Scholar
  16. 16.
    Xhafa, F., Abraham, A.: Meta-heuristics for Grid scheduling problems. In: Metaheuristics for Scheduling in Distributed Computing Environments [17], pp. 1–37Google Scholar
  17. 17.
    Xhafa, F., Abraham, A.: Metaheuristics for Scheduling in Distributed Computing Environments. SCI, vol. 146. Springer, Heidelberg (2008)zbMATHGoogle Scholar
  18. 18.
    Xhafa, F., Abraham, A.: Computational models and heuristic methods for Grid scheduling problems. Future Generation Computer Systems 26(4), 608–621 (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Dalibor Klusáček
    • 1
  • Hana Rudová
    • 1
  1. 1.Faculty of InformaticsMasaryk UniversityCzech Republic

Personalised recommendations