Bringing real-time scheduling theory and practice closer for multimedia computing
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Real-Time Systems and Programming Languages: ADA 95, Real-Time Java, and Real-Time POSIX
Real-Time Systems and Programming Languages: ADA 95, Real-Time Java, and Real-Time POSIX
Multiprocessor Scheduling of Age Constraint Processes
RTCSA '98 Proceedings of the 5th International Conference on Real-Time Computing Systems and Applications
Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Procrastination scheduling in fixed priority real-time systems
Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
The Limited-Preemption Uniprocessor Scheduling of Sporadic Task Systems
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
An Analysis of Fixed-Priority Schedulability on a Multiprocessor
Real-Time Systems
ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
A dual-priority real-time multiprocessor system on FPGA for automotive applications
Proceedings of the conference on Design, automation and test in Europe
Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
RTCSA '09 Proceedings of the 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers
RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
RTAS '11 Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium
| Hi-index | 0.00 |
We propose a partially non-preemptive dual priority scheduling algorithm (PNPDP) for multiprocessors. In dual priority scheduling, each task has two fixed priorities. When a job is released, it executes at its task's lower priority. After some fixed amount of time, its priority is promoted. Our approach is to prevent lower priority jobs from preempting one another. We use the tasks' Worst Case Response Times to determine when a promotion must occur in order to guarantee all deadlines will be met. During execution, this promotion time is adjusted to extend non-preemptive execution of lower priority tasks whenever possible. Tasks executing at their promoted priorities are scheduled using preemptive fixed priority (FP) scheduling algorithm. Experimental results demonstrate that this approach reduces the preemption and migration overheads by as much as 90%. Moreover we found that many FP-unschedulable task sets are PNPDP-schedulable.