Relative Content

Tag Archive for real-time

Semaphore : one for each shared resource?

Normally semaphores are implemented as integer variables. The value of a semaphore represents initially the number of processes that are allowed to access the shared resource at the same time, which means one single semaphore is enough for regulating the access to one shared resource. But I have seen a lot of concurrency problems where there are more than one semaphore for the same shared resource. So my question is: in which case do we have more than one semaphore guarding the same shared resource?

Real-time theory: how is period transformation implemented with delay requests?

To deal with transient overloads with a real-time system scheduled with rate-monotonic scheduling, one can use period transformation to reduce the period of important processes so that they have greater priority. In Scheduling Hard Real-Time Systems: a Review, A. Burns says (pages 4 to 5 of the PDF) that this can be done by: