A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Dynamic priority scheduling of periodic tasks with extended precedences
2011
ETFA2011
Preserved Fulltext
The software architecture of a critical embedded control system generally consists of a set of multi-periodic communicating tasks. In order to be able to describe such a system, we define the notion of semaphore precedence constraint, which supports multi-rate communications that follow regular repetitive patterns. We propose a feasibility test for EDF and we study three implementations, for periodic task sets related by such extended precedences on monoprocessor architectures. • Linear
doi:10.1109/etfa.2011.6059015
dblp:conf/etfa/ForgetGPR11
fatcat:6lbqwukiz5ebtizprargzzppwi