Proceedings of the joint conference on Languages, compilers and tools for embedded systems: software and compilers for embedded systems
RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
Preemption-aware dynamic voltage scaling in hard real-time systems
Proceedings of the 2004 international symposium on Low power electronics and design
MTSS: Multitask stack sharing for embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
Proceedings of the conference on Design, automation and test in Europe
Design and Development of Component-Based Embedded Systems for Automotive Applications
Ada-Europe '08 Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies
Leakage-Aware Energy Efficient Scheduling for Fixed-Priority Tasks with Preemption Thresholds
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
Analysis on quantum-based fixed priority scheduling of real-time tasks
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Non-preemptible last section assignment for reducing feedback latency in real-time control systems
International Journal of Systems Science
From UML/SPT models to schedulability analysis: approach and a prototype implementation using ATL
Automated Software Engineering
Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
Asynchronous event handling and safety critical Java
Proceedings of the 8th International Workshop on Java Technologies for Real-Time and Embedded Systems
Dual ceiling protocol for real-time synchronization under preemption threshold scheduling
Journal of Computer and System Sciences
Reducing stack with intra-task threshold priorities in real-time systems
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
ACO approach with learning for preemptive scheduling of real-time tasks
International Journal of Bio-Inspired Computation
Scalable real-time system design using preemption thresholds
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Designing for schedulability: integrating schedulability analysis with object-oriented design
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Variants of priority scheduling algorithms for reducing context-switches in real-time systems
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Asynchronous event handling and Safety Critical Java
Concurrency and Computation: Practice & Experience
Extending fixed task-priority schedulability by interference limitation
Proceedings of the 20th International Conference on Real-Time and Network Systems
A Least-Laxity-First Scheduling Algorithm of Variable Time Slice for Periodic Tasks
International Journal of Software Science and Computational Intelligence
Preemption delay analysis for floating non-preemptive region scheduling
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Proceedings of the 21st International conference on Real-Time Networks and Systems
Best-case response times and jitter analysis of real-time tasks with arbitrary deadlines
Proceedings of the 21st International conference on Real-Time Networks and Systems
Limited preemptive scheduling of non-independent task sets
Proceedings of the Eleventh ACM International Conference on Embedded Software
A review of fixed priority and EDF scheduling for hard real-time uniprocessor systems
ACM SIGBED Review - Special Issue on the 3rd Embedded Operating System Workshop (EWiLi 2013)
| Hi-index | 0.00 |
The notion of preemption threshold is initiated in the industry to provide flexibility for real-time and embedded system designs. However, it also brings new contents to scheduling theory. Historically, the scheduling model are divided into two categories: preemptive and non-preemptive. In the context of fixed-priority scheduling, feasibility of a task set with non-preemptive scheduling does not imply the feasibility with preemptive scheduling and vice versa. We demonstrate a generalized fixed-priority scheduling model using the notion of preemption threshold, bridging the gap between preemptive scheduler and non-preemptive scheduler, such that both of them are included in the new model as extreme cases. With this model, the schedulability of a task set is improved compared with both preemptive and non-preemptive scheduler. In this paper, we develop equations for computing worst-case response time using the concept of level-i busy period. Some useful results about the generalized model are presented and an algorithm for optimal assignment of priority and preemption threshold is designed based on these results.