A scheduling technique for real-time systems with end-to-end timing constraints

	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 Namyun Kim

Third International Workshop on Real-Time Computing Systems Application (RTCSA'96)

Seoul, Korea

October 30-November 01

ISBN: 0-8186-7626-4

	ASCII Text	x
	Namyun Kim, "A scheduling technique for real-time systems with end-to-end timing constraints," Real-Time Computing Systems and Applications, International Workshop on, pp. 301, Third International Workshop on Real-Time Computing Systems Application (RTCSA'96), 1996.

	BibTex	x
	@article{ 10.1109/RTCSA.1996.554990, author = {Namyun Kim}, title = {A scheduling technique for real-time systems with end-to-end timing constraints}, journal ={Real-Time Computing Systems and Applications, International Workshop on}, volume = {0}, year = {1996}, isbn = {0-8186-7626-4}, pages = {301}, doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.1996.554990}, 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 - A scheduling technique for real-time systems with end-to-end timing constraints SN - 0-8186-7626-4 SP EP A1 - Namyun Kim, PY - 1996 KW - real-time systems; scheduling technique; real-time systems; end-to-end timing constraints; shared tasks; overload situations VL - 0 JA - Real-Time Computing Systems and Applications, International Workshop on ER -

Namyun Kim, Dept. of Comput. Eng., Seoul Nat. Univ., South Korea

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

This paper presents a scheduling technique for guaranteeing end-to-end timing constraints. Applications are structured as a set of tasks which are the sequence of actions to produce an output. Task is decomposed into subtasks and shares subtasks with other tasks. According to the proposed scheduling technique, for each instance of a task, the sequence of subtasks is determined off-line and then called by the task sequentially at runtime. This technique avoids unnecessary execution of shared tasks and satisfies precedence constraints between subtasks even in overload situations.

Index Terms:

real-time systems; scheduling technique; real-time systems; end-to-end timing constraints; shared tasks; overload situations

Citation:

Namyun Kim, "A scheduling technique for real-time systems with end-to-end timing constraints," rtcsa, pp.301, Third International Workshop on Real-Time Computing Systems Application (RTCSA'96), 1996

Peer Review Notice | Give Us Feedback

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