Effects of nonsymmetric release times on rate monotonic scheduling

This paper discusses problems associated with scheduling periodic tasks on a uniprocessor in a hard, real-time processing 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 was developed for static-priority, 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.

[1]  Maryline Chetto,et al.  Some Results of the Earliest Deadline Scheduling Algorithm , 1989, IEEE Transactions on Software Engineering.

[2]  Lui Sha,et al.  Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithm , 1988, Proceedings. Real-Time Systems Symposium.

[3]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[4]  Jay K. Strosnider,et al.  Advanced real-time scheduling using the IEEE 802.5 token ring , 1988, Proceedings. Real-Time Systems Symposium.

[5]  John P. Lehoczky,et al.  Real-time scheduling support in Futurebus+ , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[6]  Lui Sha,et al.  On Countering the Effects of Cycle-Stealing in a Hard Real-Time Environment , 1987, RTSS.

[7]  L. Sha,et al.  The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasks , 1988, IRTAW '88.

[8]  Lui Sha,et al.  Real-time scheduling theory and Ada , 1990, Computer.

[9]  Jay K. Strosnider,et al.  ENHANCED APERIODIC RESPONSIVENESS IN HARD REAL-TIME ENVIRONMENTS. , 1987, IEEE Real-Time Systems Symposium.

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  John P. Lehoczky,et al.  The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[12]  Gene D. Carlow Architecture of the space shuttle primary avionics software system , 1984, CACM.

[13]  Shirley Dex,et al.  JR 旅客販売総合システム(マルス)における運用及び管理について , 1991 .

[14]  Geneva G. Belford,et al.  SIMULATIONS OF A FAULT-TOLERANT DEADLINE MECHANISM. , 1979 .

[15]  Mario J. Gonzalez Deterministic Processor Scheduling , 1977, CSUR.

[16]  Lui Sha,et al.  Solutions for Some Practical Problems in Prioritized Preemptive Scheduling , 1986, IEEE Real-Time Systems Symposium.

[17]  Omri Serlin,et al.  Scheduling of time critical processes , 1899, AFIPS '72 (Spring).

[18]  Lui Sha,et al.  Performance of real-time bus scheduling algorithms , 1986, SIGMETRICS '86/PERFORMANCE '86.

[19]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[20]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[21]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .