Skip to main content

A Consideration of Processor Utilization on Multi-Processor System

  • Conference paper
Advances in Information Processing and Protection

Abstract

List-scheduling is a key to achieve high performance for multi-processor system. The objective is to minimize a processing time of parallel programs. To this end, a lot of scheduling algorithms are proposed. On the other hand, processor utilization may decrease to aim at the shortest processing time. For improvement of processor utilization, there is the deadline method which we have proposed. In this method, we restrict the number of available processors using limitation. In this paper, we show the improvement of processor utilization by proposed method and the validity of the limitation.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • 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.

References

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

    Google Scholar 

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

    Article  Google Scholar 

  3. K. Kashiwagi and S. Kobayashi, “Consideration of task’s deadline for scheduling method with used processors limitation,” Proc. of Advanced Computer Systems, no. VII-9, pp. 487-496, Mielno, Poland, Oct. 2001.

    Google Scholar 

  4. K. Kashiwagi, Y. Higami, S. Kobayashi, “Improvement of the processors operating ratio in task scheduling using the deadline method,” Proc. of 10th International Multi-Conference, Advanced Computer Systems 2003, Oct. 2003.

    Google Scholar 

  5. V. A. F. Almeida, L. M. M. Vasconcelos, J. N. C. Arabe, D. A. Menasce, “Using random task graphs to investigate the potential benefits of heterogeneity in parallel systems,” Supercomputing ‘92. Proceedings, pp. 683-691, Nov. 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Science+Business Media, LLC

About this paper

Cite this paper

Kashiwagi, K., Higami, Y., Kobayashi, SY. (2007). A Consideration of Processor Utilization on Multi-Processor System. In: Pejaś, J., Saeed, K. (eds) Advances in Information Processing and Protection. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-73137-7_34

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-73137-7_34

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-73136-0

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics