A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks

R
RTAS
1995
First IEEE Real-Time Technology and Applications Symposium (RTAS'95)
Abstract - A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Y. Manabe Articles by S. Aoyagi

First IEEE Real-Time Technology and Applications Symposium (RTAS'95)

Chicago, Illinois

May 15-May 17

ISBN: 0-8186-6980-2

	ASCII Text	x
	Y. Manabe, S. Aoyagi, "A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks," Real-Time and Embedded Technology and Applications Symposium, IEEE, pp. 212, First IEEE Real-Time Technology and Applications Symposium (RTAS'95), 1995.

	BibTex	x
	@article{ 10.1109/RTTAS.1995.516218, author = {Y. Manabe and S. Aoyagi}, title = {A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks}, journal ={Real-Time and Embedded Technology and Applications Symposium, IEEE}, volume = {0}, year = {1995}, issn = {1080-1812}, pages = {212}, doi = {http://doi.ieeecomputersociety.org/10.1109/RTTAS.1995.516218}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Real-Time and Embedded Technology and Applications Symposium, IEEE TI - A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks SN - 1080-1812 SP EP A1 - Y. Manabe, A1 - S. Aoyagi, PY - 1995 KW - real-time systems; scheduling; computational complexity; feasibility decision algorithm; rate monotonic scheduling; periodic real-time tasks; scheduling algorithm; task scheduling algorithm; periodic real time task systems; real time task system; time complexity; inverse deadline scheduling algorithm VL - 0 JA - Real-Time and Embedded Technology and Applications Symposium, IEEE ER -

Y. Manabe, NTT Basic Res. Labs., Kanagawa, Japan

S. Aoyagi, NTT Basic Res. Labs., Kanagawa, Japan

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTTAS.1995.516218

The rate monotonic scheduling algorithm is a commonly used task scheduling algorithm for periodic real time task systems. The paper discusses feasibility decision for a given real time task system by the rate monotonic scheduling algorithm. It presents a new necessary and sufficient condition for a given task system to be feasible, and a new feasibility decision algorithm based on that condition. The time complexity of this algorithm depends solely on the number of tasks. This algorithm can be applied to the inverse deadline scheduling algorithm, which is an extension of the rate monotonic scheduling algorithm.

Index Terms:

real-time systems; scheduling; computational complexity; feasibility decision algorithm; rate monotonic scheduling; periodic real-time tasks; scheduling algorithm; task scheduling algorithm; periodic real time task systems; real time task system; time complexity; inverse deadline scheduling algorithm

Citation:

Y. Manabe, S. Aoyagi, "A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks," rtas, pp.212, First IEEE Real-Time Technology and Applications Symposium (RTAS'95), 1995

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.