Resource Partition for Real-Time Systems
RTAS '01 Proceedings of the Seventh Real-Time Technology and Applications Symposium (RTAS '01)
A General Framework for Analysing System Properties in Platform-Based Embedded System Designs
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
On Schedulability Bounds of Static Priority Schedulers
RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium
Interface-Based Rate Analysis of Embedded Systems
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Soft real-time scheduling on multiprocessors
Soft real-time scheduling on multiprocessors
Techniques for Multiprocessor Global Schedulability Analysis
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Hierarchical Scheduling Framework for Virtual Clustering of Multiprocessors
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
A Multi-mode Real-Time Calculus
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
On the Scalability of Real-Time Scheduling Algorithms on Multicore Platforms: A Case Study
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
A Unified Hard/Soft Real-Time Schedulability Test for Global EDF Multiprocessor Scheduling
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms
IEEE Transactions on Parallel and Distributed Systems
On the Implementation of Global Real-Time Schedulers
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Generalized tardiness bounds for global multiprocessor scheduling
Real-Time Systems
Journal of Computer and System Sciences
Hi-index | 0.00 |
Many embedded platforms consist of a heterogeneous collection of processing elements, memory modules, and communication subsystems. These components often implement different scheduling/arbitration policies, have different interfaces, and are supplied by different vendors. Hence, compositional techniques for modeling and analyzing such platforms are of interest. In prior work, the real-time calculus framework has proven to be very effective in this regard. However, real-time calculus has heretofore been limited to systems with uniprocessor processing elements, which is a serious impediment given the advent of multicore technologies. In this paper, a two-step approach is proposed that allows the power of real-time calculus to be applied in globally-scheduled multiprocessor systems: first, assuming that job response-time bounds are given, determine whether these bounds are met; second, using these bounds, determine the resulting residual processor supply and streams of job completion events using formalisms from real-time calculus. For this methodology to be applied in settings where response-time bounds are not specified, such bounds must be determined. Closed-form expressions for calculating such response-time bounds are presented for a large family of fixed-job-priority schedulers. We have also applied the developed analysis framework in a case study.