An Adaptive Scheduling Method for Grid Computing

  • Salah-Salim Boutammine
  • Daniel Millot
  • Christian Parrot
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4128)


This paper presents an adaptive scheduling method, which can be used for parallel applications whose total workload is unknown a priori. This method can deal with the unpredictable execution conditions commonly encountered on grids. To address this scheduling problem, parameters which quantify the dynamic nature of the execution conditions had to be defined. The proposed scheduling method is based on an on-line algorithm so as to be adaptable to the varying execution conditions, but avoids the idle periods inherent to this on-line algorithm.


scheduling parallel application grid master-worker on-line multi-round heterogeneity dynamicity 


  1. 1.
    Drozdowski, M.: Selected problems of scheduling tasks in multiprocessor computing systems. PhD thesis, Instytut Informatyki Politechnika Poznanska, Poznan (1997)Google Scholar
  2. 2.
    Bharadwaj, V., Ghose, D., Mani, V., Robertazzi, T.G.: Scheduling divisible loads in parallel and distributed systems. IEEE Computing Society Press, Los Alamitos (1996)Google Scholar
  3. 3.
    Robertazzi, T.G., Sohn, J., Luryi, S.: Load sharing controller for optimizing monetary cost (March 30, 1999), US patent # 5,889,989Google Scholar
  4. 4.
    Robertazzi, T.G.: Ten reasons to use divisible load theory. IEEE Computer 36(5), 63–68 (2003)Google Scholar
  5. 5.
    van der Raadt, K., Casanova, H., Yang, Y.: Practical divisible load scheduling on grid platforms with apst-dv. In: Proceeding of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), April 2005, vol. 1, p. 29b. IEEE Computer Society Press, Los Alamitos (2005)Google Scholar
  6. 6.
    Beaumont, O.: Nouvelles méthodes pour l’ordonnancement sur plates-formes hétérogènes. Habilitation à diriger des recherches, Université de Bordeaux 1 (France) (December 2004)Google Scholar
  7. 7.
    Legrand, A., Yang, Y., Casanova, H.: Np-completeness of the divisible load scheduling problem on heterogeneous star platforms with affine costs. Technical Report CS2005-0818, UCSD/CSE (March 2005)Google Scholar
  8. 8.
    Marchal, L., Yang, Y., Casanova, H., Robert, Y.: Steady-state scheduling of multiple divisible load applications on wide-area distributed computing platforms. Int. Journal of High Performance Computing Applications (to appear, 2006)Google Scholar
  9. 9.
    Boutammine, S., Millot, D., Parrot, C.: A runtime scheduling method for dynamic and heterogeneous platforms. In: Proceedings of the 2006 International Conference on Parallel Processing Workshops (ICPPW 2006), IEEE Computer Society Press, Los Alamitos (2006)Google Scholar
  10. 10.
    Bharadwaj, V., Ghose, D., Mani, V.: Multi-installment load distribution in tree networks with delays. IEEE Transactions on Aerospace and Electronic Systems 31(2), 555–567 (1995)CrossRefGoogle Scholar
  11. 11.
    Yang, Y., Casanova, H.: UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads, April 2003. IEEE Computing Society Press, Los Alamitos (2003)Google Scholar
  12. 12.
    Beaumont, O., Legrand, A., Robert, Y.: Optimal algorithms for scheduling divisible workloads on heterogeneous systems. Technical Report 4595, INRIA, Le Chesnay (France) (October 2002)Google Scholar
  13. 13.
    Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, CRC Press, Boca Raton (2004)Google Scholar
  14. 14.
    Casanova, H., Legrand, A., Marchal, L.: Scheduling distributed applications: the simgrid simulation framework. In: Proceedings of the 3th International Symposium on Cluster Computing and the Grid (CCGrid 2003), IEEE Computer Society Press, Los Alamitos (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Salah-Salim Boutammine
    • 1
  • Daniel Millot
    • 1
  • Christian Parrot
    • 1
  1. 1.Département InformatiqueGET / INTÉvryFrance

Personalised recommendations