Shared Resources and Precedence Constraints with Capacity Sharing and Stealing
Ref: HURRAY-TR-080202 Publication Date: 14 to 18, Apr, 2008
Shared Resources and Precedence Constraints with Capacity Sharing and StealingRef: HURRAY-TR-080202 Publication Date: 14 to 18, Apr, 2008
This paper proposes a new strategy to integrate shared resources and precedence constraints among real-time tasks, assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a greedy capacity sharing and stealing policy to efficiently exchange bandwidth among tasks, minimising the degree of deviation from the ideal system's behaviour caused by inter-application blocking. The proposed Capacity Exchange Protocol (CXP) focus on exchanging extra capacities as early, and not necessarily as fairly, as possible. This loss of optimality is worth the reduced complexity as the protocol's behaviour nevertheless tends to be fair in the long run and outperforms other solutions in highly dynamic scenarios, as demonstrated by extensive simulations.
22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS 2008), IEEE, pp 1-8.
Miami Beach, U.S.A..
WOS ID: 000258501402121.
Record Date: 11, Feb, 2008