Re-scheduling Service for Distributed Systems

  • Florin Pop
  • Ciprian Dobre
  • Catalin Negru
  • Valentin Cristea
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 187)


The scheduling process in Grid systems is very complex. The resource heterogeneity, the dynamic environment, the variety of policies, the size and number of tasks, and the high number of constraints are some of the main characteristics that contribute to this complexity. Despite this, the increasing number of users and applications that use sustains its necessity. This thesis proposes a re-scheduling service for distributed systems, designed for Grid environment. The use of the proposed re-scheduling model in a real environment with real tasks and workflows represents the better way to validate the service architecture and algorithms. Also, a critical analysis of scheduling algorithms is performed.


Re-scheduling Distributed Systems DAG PBS Grid 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Beaumont, O., Carter, L., Ferrante, J., Legrand, A., Marchal, L., Robert, Y.: Centralized versus distributed schedulers for bag-of-tasks applications. IEEE Trans. Parallel Distrib. Syst. 19(5), 698–709,
  2. 2.
    Xavier, P., Lee, B.S., Cai, W.: A decentralized hierarchical scheduler for a grid-based clearinghouse. In: IPDPS 2003: Proceedings of the 17th International Symposium on Parallel and Distributed Processing. IEEE Computer Society, Washington, DC (2003)Google Scholar
  3. 3.
    Pop, F.: Communication model for decentralized meta-scheduling in grid environments. In: Proceedings of The Second International Conference on Complex, Intelligent and Software Intensive System, Second International Workshop on P2P, Parallel, Grid and Internet Computing - 3PGIC 2008 (CISIS 2008), March 4-7, pp. 315–320. IEEE Computer Society, Barcelona (2008) ISBN: 0-7695-3109-1Google Scholar
  4. 4.
    Singho, F., Plantec, A.: AADL modeling and analysis of hierarchical schedulers. In: SIGAda 2007: Proceedings of the 2007 ACM International Conference on SIGAda Annual International Conference. ACM, New York (2007), Google Scholar
  5. 5.
    Goyal, P., Guo, X., Vin, H.M.: A Hierarchical CPU Scheduler for Multimedia Operating Systems. Technical Report. UMI Order Number: CS-TR-96-12, University of Texas at Austin (1996)Google Scholar
  6. 6.
    Regehr, J., Stankovic, J., Humphrey, M.: The Case for Hierarchical Schedulers with Performance Guarantees. Technical Report. UMI Order Number: CS-2000-07, University of Virginia (2000)Google Scholar
  7. 7.
    Pop, F., Dobre, C., Cristea, V.: Performance analysis of grid dag scheduling algorithms using monarc simulation tool. In: ISPDC 2008: Proceedings of the 2008 International Symposium on Parallel and Distributed Computing, pp. 131–138. IEEE Computer Society, Washington, DC (2008), doi: CrossRefGoogle Scholar
  8. 8.
    Ma, Z., Catthoor, F., Vounckx, J.: Hierarchical task scheduler for interleaving subtasks on heterogeneous multiprocessor platforms. In: Proceedings of the 2005 Conference on Asia South Pacific Design Automation ASP-DAC 2005, January 18-21, pp. 952–955. ACM, New York (2005), CrossRefGoogle Scholar
  9. 9.
    Regehr, J., Stankovic, J.A.: Hierarchical schedulers, performance guarantee, and resource management. SIGOPS Oper. Syst. Rev. 34(2), 31 (2000), CrossRefGoogle Scholar
  10. 10.
    Forti, A.: Dag Scheduling for Grid Computing Systems (PhD Thesis). Ph.D. thesis. UNIVERSITY OF UDINE - ITALY, Department of Mathematics and Computer Science (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Florin Pop
    • 1
  • Ciprian Dobre
    • 1
  • Catalin Negru
    • 1
  • Valentin Cristea
    • 1
  1. 1.Computer Science DepartmentUniversity Politehnica of BucharestBucharestRomania

Personalised recommendations