Skip to main content

Improvement of the processors operating ratio in task scheduling using the deadline method

  • Conference paper
Enhanced Methods in Computer Security, Biometric and Artificial Intelligence Systems

Abstract

Task scheduling technique which allocates some tasks to some processors is essential to high performance computing. Scheduling to the processors is crucial for optimizing performance. The objective of scheduling is to minimize the overall completion time or schedule length of the parallel program. On the other hand, a processors operating ratio may fall with the algorithm which pursued only this purpose unfortunately. For improvement of a processors operating ratio, there are the limitation method and the deadline method which we have proposed. In those methods, we limit the number of available processors. In this paper, we propose the method of improving the deadline method, by changing the limitation value of the number of available processors.

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

Access this chapter

Subscribe and save

Springer+ Basic
€32.70 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 160.49
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 210.99
Price includes VAT (France)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
EUR 210.99
Price includes VAT (France)
  • Durable hardcover 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.

Similar content being viewed by others

References

  1. K. Kashiwagj and S. Kobayashi, “Limitation of used processor for task scheduling,” Proc. 19st IASTED International Multi-Conf. Applied Informatics, pp.122–126, Innsbruck, Austria, Feb. 2001.

    Google Scholar 

  2. K. Kashiwagj and S. Kobayashi, “Consideration of task’s deadline for cheduling method with used processors limitation,” Proc. Advanced Computer Systems, no. VTI-9, pp.487–496, Memo, Poland, Oct. 2001.

    Google Scholar 

  3. H. Kasahara and S. Narita, “Practical multiprocessor scheduling algorithms for efficient parallel processing,” IEEE Trans. Computers, no.33(11), pp. 1023–1029, 1984.

    Google Scholar 

  4. Albert Y. Zomaya, Parallel & distributed computing handbook, McGraw-Hill, New York, 1996.

    Google Scholar 

  5. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Introduction to algorithms, The MIT Press, Massachusetts, 1994.

    Google Scholar 

  6. H. Hashimoto, K. Kashiwagi, Y. Higami and S. Kobayashi, “How to limit the number of available processors for every task in scheduling”, Proc. SJCIEE2001 (Japanese), Sept. 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science+Business Media, Inc.

About this paper

Cite this paper

Kashiwagi, K., Higami, Y., Kobayashi, SY. (2005). Improvement of the processors operating ratio in task scheduling using the deadline method. In: Pejaś, J., Piegat, A. (eds) Enhanced Methods in Computer Security, Biometric and Artificial Intelligence Systems. Springer, Boston, MA. https://doi.org/10.1007/0-387-23484-5_38

Download citation

  • DOI: https://doi.org/10.1007/0-387-23484-5_38

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4020-7776-0

  • Online ISBN: 978-0-387-23484-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics