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.


Mathematics and Statistics

International Standard Book Number (ISBN)


Document Type

Article - Conference proceedings

Document Version


File Type





© 2023 Institute of Electrical and Electronics Engineers, All rights reserved.

Publication Date

01 Jan 1993