Application-Specific Hints in Reconfigurable Grid Scheduling Algorithms

  • Bruno Volckaert
  • Pieter Thysebaert
  • Filip De Turck
  • Bart Dhoedt
  • Piet Demeester
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3038)


In this paper, we investigate the use of application-specific hints when scheduling jobs on a Computational Grid, as these jobs can expose widely differing characteristics regarding CPU and I/O requirements. Specifically, we consider hints that specify the relative importance of network and computational resources w.r.t. their influence on the associated application’s performance. Using our ns-2 based Grid Simulator (NSGrid), we compare schedules that were produced by taking application-specific hints into account to schedules produced by applying the same strategy for all jobs. The results show that better schedules can be obtained when using these scheduling hints intelligently.


Network Bandwidth Resource Type Grid Site Grid Schedule Grid Portal 
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.


  1. 1.
    Buyya, R., Murshed, M.: GridSim: A Toolkit for the Modeling and Simulation of Distributed Resource Management and Scheduling for Grid Computing. The Journal of Concurrency and Computation: Practice and Experience (CCPE), Wiley Press (2002)Google Scholar
  2. 2.
    Legrand, A., Marchal, L., Casanova, H.: Scheduling Distributed Applications: the SimGrid Simulation Framework. In: Proc. of CCGrid 2003, pp. 138–145 (2003)Google Scholar
  3. 3.
    Volckaert, B., Thysebaert, P., De Turck, F., Dhoedt, B., Demeester, P.: Evaluation of Grid Scheduling Strategies through a Network-aware Grid Simulator. In: Proc. of PDPTA 2003, pp. 30–35 (2003)Google Scholar
  4. 4.
    The Network Simulator - NS2. website,
  5. 5.
    Feitelson, D.G., Rudolph, L., Schwiegelshohn, U., Sevcik, K.C., Wong, P.: Theory and Practice in Parallel Job Scheduling, Job Scheduling Strategies for Parallel Processing, pp. 1–34 (1997)Google Scholar
  6. 6.
    Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms. Mathematics of Operations Research 22(3), 513–544 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Ranganathan, K., Foster, I.: Simulation Studies of Computation and Data Scheduling Algorithms for Data Grids. Journal of Grid Computing 1(1), 53–62 (2003)CrossRefGoogle Scholar
  8. 8.
    Gehring, J., Reinfeld, A.: Mars - a framework for minimizing the job execution time in a metacomputing environment. In: Proc. of Future General Computer Systems 1996 (1996)Google Scholar
  9. 9.
    Berman, F., Wolski, R., Figueira, S., Schopf, J., Shao, G.: Application-Level Scheduling on Distributed Heterogeneous Networks. In: Proc. of SuperComputing 1996 (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Bruno Volckaert
    • 1
  • Pieter Thysebaert
    • 2
  • Filip De Turck
    • 3
  • Bart Dhoedt
    • 1
  • Piet Demeester
    • 1
  1. 1.Department of Information TechnologyGhent University – IMECGentBelgium
  2. 2.Research Assistant of the Fund of Scientific Research – Flanders (F.W.O.-V.) 
  3. 3.Postdoctoral Fellow of the Fund of Scientific Research – Flanders (F.W.O.-V.) 

Personalised recommendations