An extendible approach for analyzing fixed priority hard real-time tasks
Real-Time Systems
Multiprocessor priority ceiling based protocols
Multiprocessor priority ceiling based protocols
Synchronization in Real-Time Systems: A Priority Inheritance Approach
Synchronization in Real-Time Systems: A Priority Inheritance Approach
RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
Static-Priority Scheduling on Multiprocessors
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
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
Efficient Synchronization under Global EDF Scheduling on Multiprocessors
ECRTS '06 Proceedings of the 18th Euromicro Conference on Real-Time Systems
ECRTS '06 Proceedings of the 18th Euromicro Conference on Real-Time Systems
The partitioned dynamic-priority scheduling of sporadic task systems
Real-Time Systems
Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Global EDF Schedulability Analysis of Arbitrary Sporadic Task Systems
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
System level performance analysis for real-time automotive multicore and network architectures
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Worst-case response time analysis of resource access models in multi-core systems
Proceedings of the 47th Design Automation Conference
Learning early-stage platform dimensioning from late-stage timing verification
Proceedings of the Conference on Design, Automation and Test in Europe
Real-time communication analysis for networks with two-stage arbitration
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Proceedings of the tenth ACM international conference on Embedded software
| Hi-index | 0.00 |
As multiprocessor systems are increasingly used in real-time environments, scheduling and synchronization analysis of these platforms receive growing attention. However, most known schedulability tests lack a general applicability. Common constraints are a periodic or sporadic task activation pattern, with deadlines no larger than the period, or no support for shared resource arbitration, which is frequently required for embedded systems. In this paper, we address these constraints and present a general analysis which allows the calculation of response times for fixed priority task sets with arbitrary activations and deadlines in a partitioned multiprocessor system with shared resources. Furthermore, we derive an improved bound on the blocking time in this setup for the case where the shared resources are protected according to the Multiprocessor Priority Ceiling Protocol (MPCP).