Real-Time Systems
Locking under Pfair scheduling
ACM Transactions on Computer Systems (TOCS)
Supporting lock-free synchronization in Pfair-scheduled real-time systems
Journal of Parallel and Distributed Computing
Resource sharing in behavioral based scheduling
Proceedings of the 2009 ACM symposium on Applied Computing
A Hierarchical Framework for Component-based Real-time Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A capacity sharing and stealing strategy for open real-time systems
Journal of Systems Architecture: the EUROMICRO Journal
Analysis of client/server interactions in a reservation-based system
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Hi-index | 0.00 |
In this paper, we present algorithm BandWidth Inheritance(BWI), a new scheduling strategy that extends the bandwidthreservation approach to systems where tasks can interact through shared resources.The propose d algorithm provides temporal isolation between independent groups of tasks, andenables a schedulability analysis for guaranteeing the performance of real-time tasks.After showing that BWI is thenatural extensionof the well-known Priority Inheritance Protocol to dynamic reservation systems, a formal analysis of the algorithmis presented, and simple guarantee tests for hard real-time tasks are proposed.