Allocating hard real-time tasks: an NP-hard problem made easy
Real-Time Systems
Allocating fixed-priority periodic tasks on multiprocessor systems
Real-Time Systems
Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems
IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Utilization Bounds for Multiprocessor Rate-Monotonic Scheduling
Real-Time Systems
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
IEEE Transactions on Computers
New Results on Fixed Priority Aperiodic Servers
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
Real-Time Systems
An Efficient RMS Admission Control and its Application to Multiprocessor Scheduling
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Static-Priority Scheduling on Multiprocessors
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Rate-Monotonic Scheduling on Uniform Multiprocessors
IEEE Transactions on Computers
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
Computers and Operations Research
Available task-level parallelism on the Cell BE
Scientific Programming - High Performance Computing with the Cell Broadband Engine
Real-time task scheduling by multiobjective genetic algorithm
Journal of Systems and Software
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
Task synchronization and allocation for many-core real-time systems
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
What to make of multicore processors for reliable real-time systems?
Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
ACO Based Dynamic Scheduling Algorithm for Real-Time Multiprocessor Systems
International Journal of Grid and High Performance Computing
| Hi-index | 0.00 |
The utilization bound for real-time Rate Monotonic (RM) scheduling on uniprocessors is extended to multiprocessors with partitioning-based scheduling. This allows fast schedulability tests to be performed on multiprocessors and quantifies the influence of key parameters, such as the number of processors and task sizes on the schedulability of the system. The multiprocessor utilization bound is a function of the allocation algorithm, so among all the allocation algorithms there exists at least one allocation algorithm providing the minimum multiprocessor utilization bound, and one allocation algorithm providing the maximum multiprocessor utilization bound. We prove that the multiprocessor utilization bound associated with the allocation heuristic Worst Fit (WF) coincides with that minimum if we use Liu and Layland's bound (LLB) as the uniprocessor schedulability condition. In addition, we present a class of allocation algorithms sharing the same multiprocessor utilization bound which coincides with the aforementioned maximum using LLB. The heuristics First Fit Decreasing (FFD) and Best Fit Decreasing (BFD) belong to this class. Thus, not even an optimal allocation algorithm can guarantee a higher multiprocessor utilization bound than that of FFD and BFD using LLB. Finally, the pessimism of the multiprocessor utilization bounds is estimated through extensive simulations.