Allocating fixed-priority periodic tasks on multiprocessor systems
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
IEEE Transactions on Computers
Minimum and Maximum Utilization Bounds for Multiprocessor Rate Monotonic Scheduling
IEEE Transactions on Parallel and Distributed Systems
Janus: a cross-layer soft real-time architecture for virtualization
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
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
Policy based resource allocation in IaaS cloud
Future Generation Computer Systems
Proceedings of the 20th International Conference on Real-Time and Network Systems
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
In this paper, we extend Liu and Layland’s utilization bound for fixed priority scheduling on uniprocessors to homogeneous multiprocessor systems under a partitioning strategy. Assuming that tasks are pre-emptively scheduled on each processor according to fixed priorities assigned by the Rate-Monotonic policy, and allocated to processors by the First Fit algorithm, we prove that the utilization bound is (n−1)(21/2−1)+(m−n+1)(21/(m−n+1)−1), where m and n are the number of tasks and processors, respectively. This bound is valid for arbitrary utilization factors. Moreover, if all the tasks have utilization factors under a value α, the previous bound is raised and the new utilization bound considering α is calculated. Finally, simulation provides the average-case behavior.