Skip to main content

A DAG-Based XCIGS Algorithm for Dependent Tasks in Grid Environments

  • Conference paper
  • 861 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3044))

Abstract

Generating high quality schedules for scientific computation on a computational grid is a challenging problem. Many scheduling algorithms in grid computing are for independent tasks. However, communications commonly occur among tasks executed on different grid nodes. In this paper, an eXtended Communication-Inclusion Generational Scheduling (XCIGS) algorithm is proposed to schedule dependent tasks of an application with their DAG. During scheduling, those ineligible tasks are momentarily ignored, and a Buffer Set of Independent tasks (BSI) is conducted to leverage the utilization of grid resources. The predicted transferring time, the machine ready time and the expectation completion time of all predecessors are taken into consideration while an alternative auxiliary algorithm dynamically makes the schedule. Corresponding experimental results suggest that it betters resource utilization of grid experiments and improves execution performance.

The research reported in this paper is supported by the Science Research Foundation of Hunan University of Arts and Science, China (Grant No. JJ0231), and the National High- Tech. R&D Program for CIMS, China (Grant No. 2002AA414070).

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Foster, I., Kesselman, C., et al.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. International Journal of High Performance Computing Applications 15(3), 200–222 (2001)

    Article  Google Scholar 

  2. Fernandez-Baca, D.: Allocating Modules to Processors in a Distributed System. IEEE Transactions on Software Engineer 15(11), 1427–1436 (1989)

    Article  Google Scholar 

  3. Subramani, V., Kettimuthu, R., et al.: Distributed Job Scheduling on Computational Grids Using Multiple Simultaneous Requests. In: Proc. of International Symposium on High Performance Distributed Computing (2002)

    Google Scholar 

  4. Dogan, A., Özgüner, F.: Scheduling Independent Tasks with QoS Requirements in Grid Computing with Time-Varying Resource Prices. In: Parashar, M. (ed.) GRID 2002. LNCS, vol. 2536, pp. 58–69. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Iverson, M., Özgüner, F.: Dynamic, Competitive Scheduling of Multiple DAGs in a Distributed Heterogeneous Environment. In: Proc. of the 7th Heterogeneous Computing Workshop, HCW 1998 (1998)

    Google Scholar 

  6. Shang, M., Sun, S., et al.: An Efficient Parallel Scheduling Algorithm of Dependent Task Graphs. In: Proc. of the 4th International Conference on Parallel and Distributed Computing, Applications and Technologies (2003)

    Google Scholar 

  7. Wu, M., Shu, W., et al.: Efficient Local Search for DAG Scheduling. IEEE Transactions on Parallel and Distributed Systems 12(6), 617–627 (2001)

    Article  Google Scholar 

  8. Carter, B.R., Watson, D.W., et al.: Generational Scheduling for Dynamic Task Management in Heterogeneous Computing Systems. Journal of Information sciences 106(3-4), 219–236 (1998)

    Article  Google Scholar 

  9. Cheng, T.C.E., Ding, Q.: Scheduling Start Time Dependent Tasks with Deadlines and Identical Initial Processing Times on a Single Machine. Computers & Operations Research 30, 51–62 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Gui, X., Qian, D.: OGS Algorithm for Mapping Dependent Tasks to Metacomputing Environment. Chinese Journal of Computers 25(6), 584–588 (2002)

    Google Scholar 

  11. Beaumont, O., Legrand, A., et al.: Scheduling Strategies for Mixed Data and Task Parallelism on Heterogeneous Clusters and Grids. In: Proc. of the 11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, Euro-PDP 2003 (2003)

    Google Scholar 

  12. Wolski, R., et al.: The Network Weather Service: a Distributed Resource Performance Forecasting Service for Metacomputing. Future Generation Computing Systems (5-6), 757–768 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, C., Chen, D., Zeng, Q., Hu, H. (2004). A DAG-Based XCIGS Algorithm for Dependent Tasks in Grid Environments. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24709-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24709-8_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22056-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics