Needed foundations for assuring the desirable behavior of software-reliant systems
Proceedings of the FSE/SDP workshop on Future of software engineering research
Multicore embedded systems: the timing problem and possible solutions
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling
Journal of Systems Architecture: the EUROMICRO Journal
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
Multiprocessor extensions to real-time calculus
Real-Time Systems
Partially non-preemptive dual priority multiprocessor scheduling
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
FPSL, FPCL and FPZL schedulability analysis
Real-Time Systems
Proceedings of the 20th International Conference on Real-Time and Network 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
Two protocols to reduce the criticality level of multiprocessor mixed-criticality systems
Proceedings of the 21st International conference on Real-Time Networks and Systems
Feasibility intervals for homogeneous multicores, asynchronous periodic tasks, and FJP schedulers
Proceedings of the 21st International conference on Real-Time Networks and Systems
Building timing predictable embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
Demand-based schedulability analysis for real-time multi-core scheduling
Journal of Systems and Software
| Hi-index | 0.00 |
Recently, there have been several promising techniques developed for schedulability analysis and response time analysis for multiprocessor systems based on over-approximation. This paper contains two contributions. First, to improve the analysis precision, we apply Baruah’s window analysis framework [6] to response time analysis for poradic tasks on multiprocessor systems where the deadlines of tasks are within their periods. The crucial observation is that for global fixed priority scheduling, a response time bound of each task can be efficiently estimated by fixed-point computation without enumerating all the busy window sizes as in [6] for schedulability analysis. The technique is proven to dominate theoretically state-of-the-art techniques for response time analysis for multiprocessor systems. Our experiments also show that the technique results in significant performance improvement compared with several existing techniques for multiprocessor schedulability analysis. As the second main contribution of this paper, we extend the proposed technique to task systems with arbitrary deadlines, allowing tasks to have deadlines beyond the end of their periods. This is a non-trivial extension even for single-processor systems. To our best knowledge, this is the first work of response time analysis for multiprocessor systems in this setting, which involves sophisticated techniques for the characterization and computation of response time bounds.