Resource Sharing in EDF-Scheduled Systems: A Closer Look

Authors:
Sanjoy K. Baruah
Affiliations:
The University of North Carolina, USA
Venue:
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Year:
2006

Citing 0
Cited 8

An earlier time for inserting and/or accelerating tasks

Real-Time Systems
Resource holding times: computation and optimization

Real-Time Systems
Brief paper: Supervisory control for real-time scheduling of periodic and sporadic tasks with resource constraints

Automatica (Journal of IFAC)
A capacity sharing and stealing strategy for open real-time systems

Journal of Systems Architecture: the EUROMICRO Journal
Reducing stack with intra-task threshold priorities in real-time systems

EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Using allopoietic agents in replicated software to respond to errors, faults, and attacks

Proceedings of the 48th Annual Southeast Regional Conference
Schedulability analysis of EDF-scheduled embedded real-time systems with resource sharing

ACM Transactions on Embedded Computing Systems (TECS)
An EDF run-time profile based on ravenscar

ACM SIGAda Ada Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Resource sharing in priority-based systems can give rise to priority-inversion and blocking, wherein a job's execution is delayed because a lower-priority job holds some resource that is needed for execution. The Stack Resource Policy (SRP) can be used to reduce such blocking in EDFscheduled systems. An efficient implementation of an algorithm is presented for determining whether systems scheduled in this manner are feasible. Some interesting properties of such systems are derived. The technique of reducing the duration of blocking by the replication of selected resources is explored: an algorithm is presented which determines the minimum amount of resource replication necessary to achieve specified blocking times.