A Cyclic Scheduling for Relative Timing Requirements

Montreal, CANADA October 21-October 25

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ICECCS.1996.558404

Second IEEE International Conference ...

	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 Sheng-Tzong Cheng Articles by Chia-Mei Chen

	ASCII Text	x
	Sheng-Tzong Cheng, Chia-Mei Chen, "A Cyclic Scheduling for Relative Timing Requirements," Engineering of Complex Computer Systems, IEEE International Conference on, pp. 160, Second IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'96), 1996.

	BibTex	x
	@article{ 10.1109/ICECCS.1996.558404, author = {Sheng-Tzong Cheng and Chia-Mei Chen}, title = {A Cyclic Scheduling for Relative Timing Requirements}, journal ={Engineering of Complex Computer Systems, IEEE International Conference on}, volume = {0}, year = {1996}, isbn = {0-8186-7614-0}, pages = {160}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICECCS.1996.558404}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Engineering of Complex Computer Systems, IEEE International Conference on TI - A Cyclic Scheduling for Relative Timing Requirements SN - 0-8186-7614-0 SP EP A1 - Sheng-Tzong Cheng, A1 - Chia-Mei Chen, PY - 1996 KW - Scheduling KW - relative timing constraints KW - real-time KW - allocation KW - jitters VL - 0 JA - Engineering of Complex Computer Systems, IEEE International Conference on ER -

Sheng-Tzong Cheng, National Dong Hwa University

Chia-Mei Chen, Nation Sun-Yat-Sen Univ.

We consider the scheduling problem for periodic tasks with relative timing requirements. Specifically, the timing constraints imposed on the consecutive executions of a task and the inter-task temporal constraints across task periods are considered. A pre-run-time timing analysis technique is applied to the set of tasks. A schedule is generated in which the length of the schedule is the least common multiple (LCM) of all periods. Experiments are conducted to evaluate the performance of the algorithm.

Index Terms:

Scheduling, relative timing constraints, real-time, allocation, jitters

Citation:

Sheng-Tzong Cheng, Chia-Mei Chen, "A Cyclic Scheduling for Relative Timing Requirements," iceccs, pp.160, Second IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'96), 1996

Peer Review Notice | Give Us Feedback

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