Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Optimal virtual cluster-based multiprocessor scheduling
Real-Time Systems
Proceedings of the 2010 ACM Symposium on Applied Computing
Improved multiprocessor global schedulability analysis
Real-Time Systems
Proceedings of the Conference on Design, Automation and Test in Europe
Proceedings of the Conference on Design, Automation and Test in Europe
Real-time performance analysis of multiprocessor systems with shared memory
ACM Transactions on Embedded Computing Systems (TECS)
Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling
Journal of Systems Architecture: the EUROMICRO Journal
Tests for global EDF schedulability analysis
Journal of Systems Architecture: the EUROMICRO Journal
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling
Journal of Systems Architecture: the EUROMICRO Journal
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
Zero-laxity based real-time multiprocessor scheduling
Journal of Systems and Software
Partially non-preemptive dual priority multiprocessor scheduling
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
STM concurrency control for multicore embedded real-time software: time bounds and tradeoffs
Proceedings of the 27th Annual ACM Symposium on Applied Computing
An experimental comparison of different real-time schedulers on multicore systems
Journal of Systems and Software
FPSL, FPCL and FPZL schedulability analysis
Real-Time Systems
Journal of Systems and Software
Contention-free executions for real-time multiprocessor scheduling
ACM Transactions on Embedded Computing Systems (TECS) - Special Section ESFH'12, ESTIMedia'11 and Regular Papers
Limited carry-in technique for real-time multi-core scheduling
Journal of Systems Architecture: the EUROMICRO Journal
Feasibility intervals for homogeneous multicores, asynchronous periodic tasks, and FJP schedulers
Proceedings of the 21st International conference on Real-Time Networks and Systems
Demand-based schedulability analysis for real-time multi-core scheduling
Journal of Systems and Software
Hi-index | 0.00 |
In the last years, a progressive migration from single processor chips to multi-core computing devices has taken place in the general-purpose and embedded system market. The development of Multi-Processor Systems is already a core activity for the most important hardware companies. A lot of different solutions have been proposed to overcome the physical limits of single core devices and to address the increasing computational demand of modern multimedia applications. The Real-Time community followed this trend with an increasing number of results adapting the classical scheduling analysis to parallel computing systems. This paper will contribute to refine the schedulability analysis for Symmetric Multi-Processor (SMP) Real-Time systems composed by a set of periodic and sporadic tasks. We will focus on both fixed and dynamic priority global scheduling algorithms, where tasks can migrate from one processor to another during execution. By increasing the complexity of the analysis, we will show that an improve- ment is possible over existing schedulability tests, signifi- cantly increasing the number of schedulable task sets de- tected. The added computational effort is comparable to the cost of techniques widely used in the uniprocessor case. We believe this is a reasonable cost to pay, given the intrin- sically higher complexity of multi-processor devices.