实时系统-3.ppt

Highest Locker’s Priority Protocol (HLP) Basic Idea A task in a CS gets the highest priority among all the tasks that use the resource (off-line analysis) Features Simple implementation A task is blocked when attempting to preempt, not when entering the CS Adopted in Ada95 (protected object), POSIX mutexes * CH8 Resource Sharing in Real-Time Systems * An HLP Example Tasks * CH8 Resource Sharing in Real-Time Systems * Properties of HLP Deadlock free * CH8 Resource Sharing in Real-Time Systems * Properties of HLP Task will be blocked at most once * CH8 Resource Sharing in Real-Time Systems * Response Time Analysis with HLP * CH8 Resource Sharing in Real-Time Systems * Implementation of HLP The P(scb) Operation * CH8 Resource Sharing in Real-Time Systems * Implementation of HLP The V Operation * CH8 Resource Sharing in Real-Time Systems * A Summary of HLP Pros Bounded priority inversion Deadlock free Number of blocking = 1 Cons The extreme case of HLP = NPP E.g. when the highest priority task uses all semaphores, the lower priority tasks will inherit the highest priority * CH8 Resource Sharing in Real-Time Systems * Priority Ceiling Protocol (PCP) Basic idea Each semaphore S has a Ceiling C(S) Assume that S is the semaphore with highest ceiling locked by other tasks currently: C(S) is ”the current system ceiling” If A wants to lock a semaphore (not necessarily S), it must have a strictly higher priority than C(S) i.e. P(A) C(S); Otherwise A is blocked, and it transmits its priority to the task currently holding S * CH8 Resource Sharing in Real-Time Systems * An Example of PCP * CH8 Resource Sharing in Real-Time Systems * An Example of PCP * CH8 Resource Sharing in Real-Time Systems * Properties of PCP Deadlock is avoided Chained blockings are avoided Assume J1 access S1 and S2, J2 accesses S2 and J3 accesses S1 According to PCP, PS1 = PS2 = PJ1 * CH8 Resource Sharing in Real-Time Systems * Schedulability Analysis with PCP * CH8 Resource Sharing in Real-Tim