Feasibility problems for recurring tasks on one processor
MFCS '90 Selected papers of the 15th international symposium on Mathematical foundations of computer science
Improvement in feasibility testing for real-time tasks
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
New Algorithms for Bin Packing
Journal of the ACM (JACM)
Measuring the Performance of Schedulability Tests
Real-Time Systems
Optimal deadline assignment for periodic real-time tasks in dynamic priority systems
ECRTS '06 Proceedings of the 18th Euromicro Conference on Real-Time Systems
Computing the Minimum EDF Feasible Deadline in Periodic Systems
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Multiprocessor Scheduling with Few Preemptions
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Sustainable Scheduling Analysis
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Real-Time Scheduling with Task Splitting on Multiprocessors
RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Portioned EDF-based scheduling on multiprocessors
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Notional Processors: An Approach for Multiprocessor Scheduling
RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Semi-partitioned Fixed-Priority Scheduling on Multiprocessors
RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Partitioned Fixed-Priority Preemptive Scheduling for Multi-core Processors
ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
Semi-partitioned Scheduling of Sporadic Task Systems on Multiprocessors
ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
Schedulability Analysis for Real-Time Systems with EDF Scheduling
IEEE Transactions on Computers
Real-Time Systems and Programming Languages: Ada, Real-Time Java and C/Real-Time POSIX
Real-Time Systems and Programming Languages: Ada, Real-Time Java and C/Real-Time POSIX
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound
RTAS '10 Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium
Sensitivity Analysis for EDF Scheduled Arbitrary Deadline Real-Time Systems
RTCSA '10 Proceedings of the 2010 IEEE 16th International Conference on Embedded and Real-Time Computing Systems and Applications
Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
Dispatching domains for multiprocessor platforms and their representation in ada
Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
FPSL, FPCL and FPZL schedulability analysis
Real-Time Systems
| Hi-index | 0.00 |
An EDF-based task-splitting scheme for scheduling multiprocessor systems is presented in this paper. For m processors at most m驴1 tasks are split. The first part of a split task is constrained to have a deadline equal to its computation time. The second part of the task then has the maximum time available to complete its execution on a different processor. The advantage of this scheme is that no special run-time mechanisms are required and the overheads are kept to a minimum. Analysis is developed that allows the parameters of the split tasks to be derived. This analysis is integrated into the QPA algorithm for testing the schedulability of any task set executing on a single processor under EDF. Evaluation of the C=D scheme is provided via a comparison with a fully partitioned scheme. Different heuristics for choosing the task to split are derived and evaluated. Issues pertaining to the implementation of the C=D scheme on Linux or via the Ada programming language are also discussed.