Schedulability of generalized multiframe task sets under static priority assignment

	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/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by H. Takada Articles by K. Sakamura

Fourth International Workshop on Real-Time Computing Systems and Applications (RTCSA'97)

Taipei, TAIWAN

October 27-October 29

ISBN: 0-8186-8073-3

	ASCII Text	x
	H. Takada, K. Sakamura, "Schedulability of generalized multiframe task sets under static priority assignment," Real-Time Computing Systems and Applications, International Workshop on, pp. 80, Fourth International Workshop on Real-Time Computing Systems and Applications (RTCSA'97), 1997.

	BibTex	x
	@article{ 10.1109/RTCSA.1997.629177, author = {H. Takada and K. Sakamura}, title = {Schedulability of generalized multiframe task sets under static priority assignment}, journal ={Real-Time Computing Systems and Applications, International Workshop on}, volume = {0}, year = {1997}, isbn = {0-8186-8073-3}, pages = {80}, doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.1997.629177}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Real-Time Computing Systems and Applications, International Workshop on TI - Schedulability of generalized multiframe task sets under static priority assignment SN - 0-8186-8073-3 SP EP A1 - H. Takada, A1 - K. Sakamura, PY - 1997 KW - scheduling; generalized multiframe task set schedulability; static priority assignment; execution times; GMF task sets; priority-based preemptive scheduling; critical instant theorem; maximum interference junction; polynomial-time feasibility decision algorithm; real time systems VL - 0 JA - Real-Time Computing Systems and Applications, International Workshop on ER -

H. Takada, Dept. of Inf. Sci., Tokyo Univ., Japan

K. Sakamura, Dept. of Inf. Sci., Tokyo Univ., Japan

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTCSA.1997.629177

The multiframe task model has been proposed to effectively model a task whose execution times are periodically changed according to a specified pattern. Schedulability of task sets consisting of multiframe tasks or generalized multiframe tasks (GMF tasks) is now being investigated under various conditions. This paper discusses the necessary and sufficient condition of the schedulability of GMF task sets under a priority-based preemptive scheduling with static priority assignment. The critical instant theorem for GMF task sets is described and the necessary and sufficient condition of their schedulability is presented based on the theorem. We also introduce the maximum interference junction (MIF) and propose a polynomial-time feasibility decision algorithm using the MIF.

Index Terms:

scheduling; generalized multiframe task set schedulability; static priority assignment; execution times; GMF task sets; priority-based preemptive scheduling; critical instant theorem; maximum interference junction; polynomial-time feasibility decision algorithm; real time systems

Citation:

H. Takada, K. Sakamura, "Schedulability of generalized multiframe task sets under static priority assignment," rtcsa, pp.80, Fourth International Workshop on Real-Time Computing Systems and Applications (RTCSA'97), 1997

Peer Review Notice | Give Us Feedback

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