Skip to main content

Policy Based Scheduling for Resource Allocation on Grid

  • Conference paper
Advances in Web and Network Technologies, and Information Management (APWeb 2007, WAIM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4537))

Abstract

In this paper we discuss a novel framework for policy based scheduling in resource allocation of grid computing. The framework has several features that are associated with the scheduling strategy, efficient resource management, the scheduling method and Quality of Service(QOS). Experimental results are provided to demonstrate the usefulness of the framework.

This work was supported by a grant from Security Engineering Research Center of Korea Ministry of Commerce, Industry and Energy.

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

Access this chapter

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. Liu, G.Q., Poh, K.L., Xie, M.: Iterative list scheduling for heterogeneous computing. Journal of Parallel and Distributed Computing 65(5), 654–665 (2005)

    Article  MATH  Google Scholar 

  2. Kwok, Y.K., Ahmad, I.: Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors. IEEE Transactions on Parallel and Distributed Systems 7(5), 506–521 (1996)

    Article  Google Scholar 

  3. Qin, X., Jiang, H.: Reliability-driven scheduling for real-time tasks with precedence constraints in heterogeneous distributed systems. In: Proceedings of the International Conference Parallel and Distributed Computing and Systems 2000 (PDCS 2000), Las Vegas, USA (November 2000)

    Google Scholar 

  4. Zhao, H., Sakellariou, R.: An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, Springer, Heidelberg (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Kevin Chen-Chuan Chang Wei Wang Lei Chen Clarence A. Ellis Ching-Hsien Hsu Ah Chung Tsoi Haixun Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cho, Sh., Lee, Mh., In, Ju., Kim, Bh., Choi, Ei. (2007). Policy Based Scheduling for Resource Allocation on Grid. In: Chang, K.CC., et al. Advances in Web and Network Technologies, and Information Management. APWeb WAIM 2007 2007. Lecture Notes in Computer Science, vol 4537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72909-9_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72909-9_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72908-2

  • Online ISBN: 978-3-540-72909-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics