Some Results of the Earliest Deadline Scheduling Algorithm
IEEE Transactions on Software Engineering
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)
Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Multiprocessor algorithms for uniprocessor feasibility analysis
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
Validity of the single processor approach to achieving large scale computing capabilities
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
| Hi-index | 0.00 |
Abstract: Chetto and Chetto [3] presented an algorithm for the on-line admission control and run-time scheduling of aperiodic real-time jobs in preemptive uniprocessor environments that are executing systems of periodic hard-real-time tasks. This algorithm requires a significant degree of preprocessing of the system of periodic tasks in general, this preprocessing takes time exponential in the representation of the periodic task system. In this paper, we develop techniques for speeding up the preprocessing phase of the Chetto and Chetto algorithm, by adapting it for implementation in parallel environments. We validate the effectiveness of our parallelization both by theoretical results, and through simulation experiments.