Journal of Scheduling

, Volume 13, Issue 5, pp 545–552 | Cite as

On-line hierarchical job scheduling on grids with admissible allocation

  • Andrei TchernykhEmail author
  • Uwe Schwiegelshohn
  • Ramin Yahyapour
  • Nikolai Kuzjurin


In this paper, we address non-preemptive online scheduling of parallel jobs on a Grid. Our Grid consists of a large number of identical processors that are divided into several machines. We consider a Grid scheduling model with two stages. At the first stage, jobs are allocated to a suitable machine, while at the second stage, local scheduling is independently applied to each machine. We discuss strategies based on various combinations of allocation strategies and local scheduling algorithms. Finally, we propose and analyze a scheme named adaptive admissible allocation. This includes a competitive analysis for different parameters and constraints. We show that the algorithm is beneficial under certain conditions and allows for an efficient implementation in real systems. Furthermore, a dynamic and adaptive approach is presented which can cope with different workloads and Grid properties.


Grid computing Online scheduling Resource management Job allocation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Albers, S. (1999). Better bounds for online scheduling. SIAM Journal on Computing, 29(2), 459–473. CrossRefGoogle Scholar
  2. Avellino, G., Barale, S., Beco, S., Cantalupo, B., Colling, D., Giacomini, F., Gianelle, A., Guarise, A., Krenek, A., Kouril, D., Maraschini, A., Matyska, L., Mezzadri, M., Monforte, S., Mulac, M., Pacini, F., Pappalardo, M., Peluso, R., Pospisil, J., Prelz, F., Ronchieri, E., Ruda, M., Salconi, L., Salvet, Z., Sgaravatto, M., Sitera, J., Terracina, A., Vocu, M., & Werbrouck, A. (2003). The EU DataGrid workload management system: towards the second major release. In CHEP 2003, La Jolla, CA, March 2003. Google Scholar
  3. Bar-Noy, A., Freund, A., & Naor, S. (2002). On-line load balancing in a hierarchical server topology. SIAM Journal on Computing, 2(31), 527–549. Google Scholar
  4. Elmroth, E., & Tordsson, J. (2005). An interoperable standards-based grid resource broker and job submission service, e-Science 2005. In First IEEE conference on e-science and grid computing (pp. 212–220). Los Alamitos: IEEE Computer Society Press. CrossRefGoogle Scholar
  5. Ernemann, C., & Yahyapour, R. (2003). Applying economic scheduling methods to grid environments. In Grid resource management—state of the art and future trends (pp. 491–506). Dordrecht: Kluwer Academic. Google Scholar
  6. Ernemann, E., Hamscher, V., Schwiegelshohn, U., Streit, A., & Yahyapour, R. (2002). On advantages of grid computing for parallel job scheduling. In Proceedings of 2nd IEEE international symposium on cluster computing and the grid (CC-GRID 2002) (pp. 39–46). Google Scholar
  7. Garey, M., & Graham, R. (1975). Bounds for multiprocessor scheduling with resource constraints. SIAM Journal on Computing, 4(2), 187–200. CrossRefGoogle Scholar
  8. Graham, R., Lawler, E., Lenstra, J., & Kan, A. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 15, 287–326. CrossRefGoogle Scholar
  9. Krauter, K., Buyya, R., & Maheswaran, M. (2002). A taxonomy and survey of grid resource management systems for distributed computing. International Journal of Software: Practice and Experience, 32, 135–164. CrossRefGoogle Scholar
  10. Kurowski, K., Nabrzyski, J., Oleksiak, A., & Weglarz, J. (2008). A multi-criteria approach to two-level hierarchy scheduling in grids. Journal of Scheduling, 11(5), 371–379. CrossRefGoogle Scholar
  11. Naroska, E., & Schwiegelshohn, U. (2002). On an online scheduling problem for parallel jobs. Information Processing Letters, 81(6), 297–304. CrossRefGoogle Scholar
  12. Pascual, F., Rzadca, K., & Trystram, D. (2008). Cooperation in multi-organization scheduling. Concurrency and Computation: Practice and Experience. doi: 10.1002/cpe.1378. Google Scholar
  13. Rodero, I., Corbalan, J., Badia, R. M., & Labarta, J. (2005). eNANOS grid resource broker. In P. M. A. Sloot, et al. (Eds.), Advances in grid computing (EGC 2005), European Grid Conference. Google Scholar
  14. Rodero, I., Guim, F., Corbalan, J., Labarta, J., Oleksiak, A., Kurowski, K., & Nabrzyski, J. (2008). Integration of the eNANOS execution framework with GRMS. Achievements in European research on grid systems. In CoreGRID integration workshop 2006 (pp. 25–39). Berlin: Springer. Google Scholar
  15. Rudin III, J. (2001). Improved bounds for the on-line scheduling problem. PhD thesis, The University of Texas at Dallas. Google Scholar
  16. Schwiegelshohn, U., & Yahyapour, R. (2003). Attributes for communication between grid scheduling instances. In J. Nabrzyski, J. Schopf, & J. Weglarz (Eds.), Grid resource management—state of the art and future trends (pp. 41–52). Dordrecht: Kluwer Academic. Google Scholar
  17. Schwiegelshohn, U., Tchernykh, A., & Yahyapour, R. (2008). Online scheduling in grids. In Proceedings of the IEEE international parallel and distributed processing symposium (IPDPS 2008) (pp. 1–10). Google Scholar
  18. Schwiegelshohn, U. (2009). An owner-centric metric for the evaluation of online job schedules. In Proceedings of the 2009 multidisciplinary international conference on scheduling: theory and applications (MISTA 2009) (pp. 557–569). Google Scholar
  19. Tchernykh, A., Ramirez, J., Avetisyan, A., Kuzjurin, N., Grushin, D., & Zhuk, S. (2006). Two level job-scheduling strategies for a computational grid. In Wyrzykowski, et al. (Eds.), LNCS : Vol. 3911. Parallel processing and applied mathematics (pp. 774–781). Berlin: Springer. CrossRefGoogle Scholar
  20. Tchernykh, A., Schwiegelshohn, U., Yahyapour, R., & Kuzjurin, N. (2008). Online hierarchical job scheduling in grids. In T. Priol, & M. Vanneschi (Eds.), From grids to service and pervasive computing (pp. 77–91). Berlin: Springer. CrossRefGoogle Scholar
  21. Vazquez-Poletti, J., Huedo, E., Montero, R., & Llorente, I. (2007). A comparison between two grid scheduling philosophies: EGEE WMS and grid way. Journal Multiagent and Grid Systems, 3(4), 429–440. Google Scholar
  22. Zhuk, S., Chernykh, A., Kuzjurin, N., Pospelov, A., Shokurov, A., Avetisyan, A., Gaissaryan, S., & Grushin, D. (2004). Comparison of scheduling heuristics for grid resource broker. In Proceedings of the third international IEEE conference on parallel computing systems (PCS2004) (pp. 388–392). Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Andrei Tchernykh
    • 1
  • Uwe Schwiegelshohn
    • 2
  • Ramin Yahyapour
    • 3
  • Nikolai Kuzjurin
    • 4
  1. 1.Computer Science DepartmentCICESE Research CenterEnsenadaMexico
  2. 2.Robotics Research InstituteTechnische Universität DortmundDortmundGermany
  3. 3.IT and Media CenterTechnische Universität DortmundDortmundGermany
  4. 4.Institute of System Programming RASMoscowRussia

Personalised recommendations