Worst-Case Response Time Analysis of Real-Time Tasks under Fixed-Priority Scheduling with Deferred Preemption Revisited

Pisa, Italy July 04-July 06

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ECRTS.2007.38

19th Euromicro Conference on Real-Tim ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	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 Reinder J. Bril Articles by Johan J. Lukkien Articles by Wim F.J. Verhaegh

	ASCII Text	x
	Reinder J. Bril, Johan J. Lukkien, Wim F.J. Verhaegh, "Worst-Case Response Time Analysis of Real-Time Tasks under Fixed-Priority Scheduling with Deferred Preemption Revisited," Real-Time Systems, Euromicro Conference on, pp. 269-279, 19th Euromicro Conference on Real-Time Systems (ECRTS'07), 2007.

	BibTex	x
	@article{ 10.1109/ECRTS.2007.38, author = {Reinder J. Bril and Johan J. Lukkien and Wim F.J. Verhaegh}, title = {Worst-Case Response Time Analysis of Real-Time Tasks under Fixed-Priority Scheduling with Deferred Preemption Revisited}, journal ={Real-Time Systems, Euromicro Conference on}, volume = {0}, year = {2007}, issn = {1068-3070}, pages = {269-279}, doi = {http://doi.ieeecomputersociety.org/10.1109/ECRTS.2007.38}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Real-Time Systems, Euromicro Conference on TI - Worst-Case Response Time Analysis of Real-Time Tasks under Fixed-Priority Scheduling with Deferred Preemption Revisited SN - 1068-3070 SP269 EP279 A1 - Reinder J. Bril, A1 - Johan J. Lukkien, A1 - Wim F.J. Verhaegh, PY - 2007 KW - null VL - 0 JA - Real-Time Systems, Euromicro Conference on ER -

Reinder J. Bril, Technische Universiteit Eindhoven, The Netherlands

Johan J. Lukkien, Technische Universiteit Eindhoven, The Netherlands

Wim F.J. Verhaegh, Philips Research Laboratories, The Netherlands

Fixed-priority scheduling with deferred preemption (FPDS) has been proposed in the literature as a viable alternative to fixed-priority preemptive scheduling (FPPS), that both reduces the cost of arbitrary preemptions and removes the need for non-trivial resource access protocols.

This paper shows that existing worst-case response time analysis of hard real-time tasks under FPDS, arbitrary phasing and relative deadlines at most equal to periods is both pessimistic and optimistic. This paper provides a revised analysis, resolving the problems with the existing approaches. The analysis assumes a continuous scheduling model. It is shown that the critical instant, longest busy period, and worst-case response time for a task are suprema rather than maxima for all tasks, except for the lowest priority task. Moreover, it is shown that the analysis is not uniform for all tasks, i.e. the analysis for the lowest priority task differs from the analysis of the other tasks, because only the lowest priority task cannot be blocked. To build on earlier work, the worst-case response time analysis for FPDS is expressed in terms of known worst-case analysis results for FPPS. The paper includes pessimistic variants of the analysis, which are uniform for all tasks.

Citation:

Reinder J. Bril, Johan J. Lukkien, Wim F.J. Verhaegh, "Worst-Case Response Time Analysis of Real-Time Tasks under Fixed-Priority Scheduling with Deferred Preemption Revisited," ecrts, pp.269-279, 19th Euromicro Conference on Real-Time Systems (ECRTS'07), 2007

Peer Review Notice | Give Us Feedback

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