Skip to main content
SpringerLink
Log in

A Dynamic Task Scheduling Algorithm forGrid Computing System

  • Conference paper
Book cover Parallel and Distributed Processing and Applications (ISPA 2004)

Part of the book series: Lecture Notes in Computer Science ((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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers, San Francisco (1999)

    Google Scholar 

  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. 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)

    Article  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science,  

    Yuanyuan Zhang & Hong Shen

  2. Center for Information Science, Japan Advanced Institute of Science and Technology, 1-1 Asahidai, Tatsunokuchi, Ishikawa, 923-1292, Japan

    Yasushi Inoguchi

Authors
  1. Yuanyuan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yasushi Inoguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hong Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing, Hong Kong Polytechnic University, Kowloon, Hong Kong, China

    Jiannong Cao

  2. Department of Computer Science, St. Francis Xavier University, Antigonish, Canada

    Laurence T. Yang

  3. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200030, Shanghai, China

    Minyi Guo

  4. Department of Computer Science, The University of Hong Kong, Pokfulam

    Francis Lau

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, Y., Inoguchi, Y., Shen, H. (2004). A Dynamic Task Scheduling Algorithm forGrid Computing System . In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds) Parallel and Distributed Processing and Applications. ISPA 2004. Lecture Notes in Computer Science, vol 3358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30566-8_69

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30566-8_69

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24128-7

  • Online ISBN: 978-3-540-30566-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation