Fault-Tolerant Rate-Monotonic Scheduling
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Synchronization in Real-Time Systems: A Priority Inheritance Approach
Synchronization in Real-Time Systems: A Priority Inheritance Approach
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
IEEE Transactions on Computers
Tight Performance Bounds of Heuristics for a Real-Time Scheduling Problem
Tight Performance Bounds of Heuristics for a Real-Time Scheduling Problem
IEEE Transactions on Computers
Tolerance to Multiple Transient Faults for Aperiodic Tasks in Hard Real-Time Systems
IEEE Transactions on Computers
Preemptive Multiprocessor Scheduling Anomalies
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Enhanced Utilization Bounds for QoS Management
IEEE Transactions on Computers
A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling
IEEE Transactions on Computers
Minimum and Maximum Utilization Bounds for Multiprocessor Rate Monotonic Scheduling
IEEE Transactions on Parallel and Distributed Systems
Static-priority periodic scheduling on muitiprocessors
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Calculation of the acceleration of parallel programs as a function of the number of threads
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
ScatterD: Spatial deployment optimization with hybrid heuristic/evolutionary algorithms
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Hi-index | 0.01 |
A real-time system must execute functionally correct computations in a timely manner. In order to guarantee that all tasks accepted in the system will meet their timing requirements, an admission control algorithm must be used to only accept tasks whose requirements can be satisfied. Rate-monotonic scheduling (RMS) is arguably the best known scheduling policy for periodic real-time tasks on uniprocessors. We propose a new and eficient admission control for rate-monotonic scheduling on a uniprocessor and analyze its performance. This admission control is then modified to provide an admission control mechanism for multiprocessor systems. Experimental results indicate that this new admission control for multiprocessor systems achieves a processor utilization of up to 96% for a large number of tasks and has a low computational complexity. The proposed admission control is also used to derive a new and better multiprocessor schedulability bound for RMS with provisions for periodic servers and for RMS with tolerance to transient faults.