research-article

Engineering and Analysis of Fixed Priority Schedulers

Authors:

J. K. StrosniderAuthors Info & Claims

IEEE Transactions on Software Engineering, Volume 19, Issue 9

Pages 920 - 934

https://doi.org/10.1109/32.241774

Published: 01 September 1993 Publication History

Abstract

Scheduling theory holds great promise as a means to a priori validate timing correctness of real-time applications. However, there currently exists a wide gap between scheduling theory and its implementation in operating system kernels running on specific hardware platforms. The implementation of any particular scheduling algorithm introduces overhead and blocking components which must be accounted for in the timing correctness validation process. This paper presents a methodology for incorporating the costs of scheduler implementation within the context of fixed priority scheduling algorithms. Both event-driven and timer-driven scheduling implementations are analyzed. We show that for the timer-driven scheduling implementations the selection of the timer interrupt rate can dramatically affect the schedulability of a task set, and we present a method for determining the optimal timer rate. We analyzed both randomly generated and two well-defined task sets and found that their schedulability can be significantly degraded by the implementation costs. Task sets that have ideal breakdown utilization over 90% may not even be schedulable when the implementation costs are considered. This work provides a first step toward bridging the gap between real-time scheduling theory and implementation realities. This gap must be bridged for any meaningful validation of timing correctness properties of real-time applications.

References

[1]

{1} C. Liu and J. Layland, "Scheduling algorithms for multiprogramming in a hard real-time environment," J. ACM, vol. 30, pp. 46-61, Jan. 1973.]]

Digital Library

[2]

{2} J. Lehoczky, L. Sha, and Y. Ding, "The rate monotonic scheduling algorithm: Exact characterization and average case behavior," presented at the IEEE Real Time Systems Symp., 1989.]]

[3]

{3} L. Sha, R. Rajkumar, and J. P. Lehoczky, "Priority inheritance protocols: An approach to real-time synchronization," IEEE Trans. Comput., vol. 39, pp. 1175-1185, Sept. 1990.]]

Digital Library

[4]

{4} J. W. Liu, K. Lin, and S. Natarajan, "Scheduling real-time, periodic jobs using imprecise results," in Proc. 8th IEEE Real-Time Systems Symp., Dec. 1987, pp. 252-260.]]

[5]

{5} A. K. Mok, "Fundamental design problems of distributed systems for the hard real time environment," Ph.D. dissertation, Mass. Inst. Technol., Cambridge, 1983.]]

[6]

{6} J. Stankovic, "Real-time computing systems: The next generation," presented at the IEEE Tutorial Hard Real Time Systems, 1988.]]

Digital Library

[7]

{7} K. Ramamritham, J. Stankovic, and P. Shiah, "Efficient scheduling algorithms for real-time multiprocessor systems," IEEE Trans. Parallel Distributed Syst., vol. 1, pp. 184-194, 1990.]]

Digital Library

[8]

{8} R. Rajkumar, "Task synchronization in real-time systems," Ph.D. dissertation, Carnegie Mellon Univ., Pittsburgh, PA, 1989.]]

Digital Library

[9]

{9} B. Sprunt, "A periodic task scheduling for real-time systems," Ph.D. dissertation, Carnegie Mellon Univ., Pittsburgh, PA, 1990.]]

Digital Library

[10]

{10} J. Strosnider, "Highly responsive real-time token rings," Ph.D. dissertation, Carnegie Mellon Univ., Pittsburgh, PA, 1988.]]

Digital Library

[11]

{11} D. Katcher, H. Arakawa, and J. Strosnider, "Bridging the gap between scheduling theory and reality," in Proc. 1991 Workshop Architectural Aspects of Real-Time Systems.]]

[12]

{12} D. Katcher, H. Arakawa, and J. Strosnider, "Engineering and analysis of real-time microkernels," in Proc. 9th IEEE Workshop Real-Time Operating Systems and Software, May 1992, pp. 15-19.]]

[13]

{13} J. Strosnider, J. Lehoczky, and L. Sha, "The deferrable server algorithm," IEEE Trans. Comput., 1993, to be published.]]

Digital Library

[14]

{14} L. Sha and S. Sathaye, "Distributed real-time system design using generalized rate monotonic theory," presented at the 2nd Int. Conf. Automation, Robotics and Computer Vision, 1992.]]

[15]

{15} R. Mraz, "The analysis and design of a RISC based architecture for real-time computation," Ph.D. dissertation, Dept. Elec. Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, 1992.]]

Digital Library

[16]

{16} T. Anderson, H. Levy, B. Bershad, and E. Lazowska, "The interaction of architecture and operating system design," in Proc. 4th Int. Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS), Apr. 1991, pp. 108-120.]]

Digital Library

[17]

{17} H. Tokuda, T. Nakajima, and P. Rao, "Real-time Mach: Toward a predictable real-time system," in Proc. USENIX Mach Workshop, 1990.]]

[18]

{18} D. Stewart, D. Schmitz, and P. Khosla, "Implementing real-time robotic systems using CHIMERA II," in Proc. 1990 IEEE Int. Conf. Robotics and Automation, 1990.]]

[19]

{19} D. Katcher, H. Arakawa, and J. Strosnider, "Engineering and analysis of fixed priority schedulers," Carnegie Mellon Univ., Pittsburgh, PA, CMU/ECE Tech. Rep. CMUCAD-91-10, pp. 1-39, Dec. 1991.]]

[20]

{20} G. Kane and J. Heinrich, MIPS RISC Architecture. Englewood Cliffs, NJ: Prentice Hall, 1991.]]

Digital Library

[21]

{21} "SPARC RISC User's Guide," Cypress Semiconductor, San Jose, CA, 1990.]]

[22]

{22} C. Douglass Locke, D. R. Vogel, and T. J. Mesler, "Building a predictable avionics platform in Ada: A case study," in Proc. Real-Time Systems Symp., Dec. 1991, pp. 181-189.]]

[23]

{23} C. D. Locke, D. R. Vogel, L. Lucas, and J. B. Goodenough, "Generic avionics software specification," Carnegie Mellon Univ., Pittsburgh, PA, Tech. Rep. CMU/SEI-90-TR-8, 1990.]]

[24]

{24} M. W. Borger, "VAXELN experimentation: Programming a real-time periodic task dispatcher using VAXELN Ada 1.1.," Software Engineering Inst., Carnegie Mellon Univ., Tech. Rep., 1987.]]

Cited By

Goossens JMasson D(2022)Simulation intervals for uniprocessor real-time schedulers with preemption delayProceedings of the 30th International Conference on Real-Time Networks and Systems10.1145/3534879.3534887(36-45)Online publication date: 7-Jun-2022
https://dl.acm.org/doi/10.1145/3534879.3534887
Davis RAltmeyer SReineke J(2018)Response-time analysis for fixed-priority systems with a write-back cacheReal-Time Systems10.5555/3288651.328873554:4(912-963)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.5555/3288651.3288735
Davis RAltmeyer SReineke JPlantec ASinghoff FFaucou SPinho L(2016)Analysis of Write-back Caches under Fixed-priority Preemptive and Non-preemptive SchedulingProceedings of the 24th International Conference on Real-Time Networks and Systems10.1145/2997465.2997476(309-318)Online publication date: 19-Oct-2016
https://dl.acm.org/doi/10.1145/2997465.2997476
Show More Cited By

Engineering and Analysis of Fixed Priority Schedulers

Recommendations

Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines

The deadline of a request is the time instant at which its execution must complete. The deadline of the request in any period of a job with deferred deadline is some time instant after the end of the period. The authors describe a semi-static priority-...
Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems

This paper presents a timing analysis for a quite general hard real-time periodic task set on a uniprocessor using fixed-priority methods. Periodic tasks are composed of serially executed subtasks, where each subtask is characterized by an execution ...
Optimal aperiodic scheduling for dynamic-priority systems
RTCSA '96: Proceedings of the Third International Workshop on Real-Time Computing Systems Application

This paper addresses the problem of jointly scheduling tasks with both hard and soft real-time constraints. We present a new on-line aperiodic admission algorithm to be used with on optimal dynamic priority preemptive scheduler, such as the Earliest ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Software Engineering

IEEE Transactions on Software Engineering Volume 19, Issue 9

September 1993

96 pages

ISSN:0098-5589

Issue’s Table of Contents

Copyright © Copyright © 1993 IEEE. All Rights Reserved.

Publisher

IEEE Press

Publication History

Published: 01 September 1993

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

55
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Goossens JMasson D(2022)Simulation intervals for uniprocessor real-time schedulers with preemption delayProceedings of the 30th International Conference on Real-Time Networks and Systems10.1145/3534879.3534887(36-45)Online publication date: 7-Jun-2022
https://dl.acm.org/doi/10.1145/3534879.3534887
Davis RAltmeyer SReineke J(2018)Response-time analysis for fixed-priority systems with a write-back cacheReal-Time Systems10.5555/3288651.328873554:4(912-963)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.5555/3288651.3288735
Davis RAltmeyer SReineke JPlantec ASinghoff FFaucou SPinho L(2016)Analysis of Write-back Caches under Fixed-priority Preemptive and Non-preemptive SchedulingProceedings of the 24th International Conference on Real-Time Networks and Systems10.1145/2997465.2997476(309-318)Online publication date: 19-Oct-2016
https://dl.acm.org/doi/10.1145/2997465.2997476
Davis RCucu-Grosjean LBertogna MBurns A(2016)A review of priority assignment in real-time systemsJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2016.04.00265:C(64-82)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1016/j.sysarc.2016.04.002
Qureshi MAlrashed SMin-Allah NKołodziej JArabas P(2015)Maintaining The Feasibility Of Hard Real-Time Systems With A Reduced Number Of Priority LevelsInternational Journal of Applied Mathematics and Computer Science10.1515/amcs-2015-005125:4(709-722)Online publication date: 1-Dec-2015
https://dl.acm.org/doi/10.1515/amcs-2015-0051
Zhang YGuo R(2014)Power-aware fixed priority scheduling for sporadic tasks in hard real-time systemsJournal of Systems and Software10.5555/2747013.274713690:C(128-137)Online publication date: 1-Apr-2014
https://dl.acm.org/doi/10.5555/2747013.2747136
Zhang FBurns ABaruah S(2011)Sensitivity analysis of arbitrary deadline real-time systems with EDF schedulingReal-Time Systems10.1007/s11241-011-9124-y47:3(224-252)Online publication date: 1-May-2011
https://dl.acm.org/doi/10.1007/s11241-011-9124-y
Dodiu EGaitan VGraur A(2010)Improving commercial RTOS performance using a custom interrupt management scheduling policyProceedings of the 2010 international conference on Applied computing conference10.5555/1950153.1950163(61-66)Online publication date: 21-Oct-2010
https://dl.acm.org/doi/10.5555/1950153.1950163
Dorin FRichard PRichard MGoossens J(2010)Schedulability and sensitivity analysis of multiple criticality tasks with fixed-prioritiesReal-Time Systems10.1007/s11241-010-9107-446:3(305-331)Online publication date: 1-Dec-2010
https://dl.acm.org/doi/10.1007/s11241-010-9107-4
Park MYoo HChae JKim WChoi HWon D(2009)Analysis on quantum-based fixed priority scheduling of real-time tasksProceedings of the 3rd International Conference on Ubiquitous Information Management and Communication10.1145/1516241.1516351(627-634)Online publication date: 15-Feb-2009
https://dl.acm.org/doi/10.1145/1516241.1516351
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents