Abstract
This paper discusses problems associated with scheduling periodic tasks in a hard, real-time processing or computing environment using a static-priority, preemptive-resume operating system . The scheduling problems associated with a task set containing a single periodic task which has two fixed release periods of unequal length are examined. Some real-world applications may require task release times which are periodic, but whose tasking periods are not symmetric. A scheduling algorithm for task sets with a single nonsymmetric task has been developed for staticpriority, preemptive-resume operating systems. The nonsymmetric scheduling algorithm is based on the rate monotonic scheduling algorithm which assigns higher task priorities to tasks with shorter release periods.
The effects on processor utilization using two different priority assignment schemes are examined. The first method sorts the task priorities by the average release periods. The second method sorts the task priorities using the short nonsymmetric task period with the average period lengths for the remaining tasks. A large number of task sets were generated to characterize effects of the two priority assignment methods on task set utilization levels when used with the nonsymmetric scheduling algorithm. Characterization results for the two methods indicated that the short nonsymmetric task period priority assignment had higher breakdown utilizations than the average period priority assignment method. For task sets with a low utilization nonsymmetric task, use of the short period priority assignment method resulted in little or no loss in the overall task set breakdown utilization. Maximizing the processor utilization is desirable, provided the tasks operate in a deterministic manner and meet their deadlines. The nonsymmetric scheduling algorithm allows the system designer to calculate the feasibility of a task set containing a nonsymmetric period task.
Recommended Citation
Karl, R. G.; Lo, T. L.; and St. Clair, D. C., "Effects of Nonsymmetric Release Times on Rate Monotonic Scheduling" (1992). Computer Science Technical Reports. 141.
https://scholarsmine.mst.edu/comsci_techreports/141
Department(s)
Computer Science
Second Department
Mathematics and Statistics
Report Number
CSc-92-12
Document Type
Technical Report
Document Version
Final Version
File Type
text
Language(s)
English
Rights
© 1992 University of Missouri - Rolla, All rights reserved
Publication Date
1 May, 1992
Comments
The first and second Authors are Graduate Students.This report is substantially the M.S. thesis of the first author, completed May, 1992.