Slack-based multiprocessor scheduling of aperiodic real-time tasks
Real-Time Systems
Efficient charging station scheduling for an autonomous parking and charging system
Proceedings of the ninth ACM international workshop on Vehicular inter-networking, systems, and applications
| Hi-index | 0.00 |
This paper studies multiprocessor scheduling for aperiodic tasks where future arrivals are unknown. A previously proposed priority-driven scheduling algorithm for periodic tasks with migration capability is extended to aperiodic scheduling and is shown to have a capacity bound of 0.5. This bound is close to the best achievable for a priority-driven scheduling algorithm. With an infinite number of processors, no priority-driven scheduling algorithm can perform better. We also propose a simple admission controller which guarantees that admitted tasks meet their deadlines and for many workloads, it admits tasks so that the utilization can be kept above the capacity bound.