Advertisement

A Dynamic Task Scheduling Algorithm forGrid Computing System

  • Yuanyuan Zhang
  • Yasushi Inoguchi
  • Hong Shen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3358)

Abstract

In this paper, we propose a dynamic task scheduling algorithm which assigns tasks with precedence constraints to processors in a Grid computing system. The proposed scheduling algorithm bases on a modified static scheduling algorithm and takes into account the heterogeneous and dynamic natures of resources in Grid.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers, San Francisco (1999)Google Scholar
  2. 2.
    Banino, C., Beaumont, O., Legrand, A., Robert, Y.: Scheduling strategies for master-slave tasking on heterogeneous processor grids. In: Applied Parallel Computing: Advanced Scientific Computing: 6th Int’l Conf., June 2002, pp. 423–432 (2002)Google Scholar
  3. 3.
    Topcuoglu, H., Hariri, S., Wu, M.-Y.: Performance-Effective and Low- Complexity Task Scheduling for Heterogeneous Computing. IEEE Trans. Parallel and Distributed Systems 13(3), 260–274 (2002)CrossRefGoogle Scholar
  4. 4.
    Liou, J.-C., Palis, M.A.: An Efficient Task Clustering Heuristic for Scheduling DAGs on Multiprocessors. In: Workshop on Resource Management, Symposium on Parallel and Distributed Processing (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Yuanyuan Zhang
    • 1
  • Yasushi Inoguchi
    • 2
  • Hong Shen
    • 1
  1. 1.Graduate School of Information Science 
  2. 2.Center for Information ScienceJapan Advanced Institute of Science and TechnologyIshikawaJapan

Personalised recommendations