Abstract
This paper discusses problems associated with scheduling periodic task on a uniprocessor in a hard, real-time processing environment using a static-priority, preemptive-resume operating system. Task sets containing a single periodic task with two Ned release periocis of unequal length are examined. Ihe nonsymmetric scheduling algorithm is based on the rate monotonic scheduling algorithm which assigns higher task priorities to tasks with shorter release periods. me effects on processor utilization using two dirkrent priority assignment schemes are examined; one with task priorities sorted by the average release periods and the other with priorities sorted using the short nonsymmetric task period with the average period lengths for the remaining task. Results indicate that the second scheme had higher breakdown utilizations than the first one, and that the second scheme, for task sets with a low utilization nonsymmetric task, results in little or no loss in the overall task set utilization.
Recommended Citation
R. G. Karl et al., "Feasibility Test Verification Method For Nonsymmetric Release Time Task Scheduling," Proceedings - 26th Annual Simulation Symposium, ANSS 1993, pp. 296 - 305, article no. 639151, Institute of Electrical and Electronics Engineers, Jan 1993.
The definitive version is available at https://doi.org/10.1109/SIMSYM.1993.639151
Department(s)
Mathematics and Statistics
International Standard Book Number (ISBN)
978-081863620-2
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2023 Institute of Electrical and Electronics Engineers, All rights reserved.
Publication Date
01 Jan 1993
