Real-Time Scheduling with Shared Resources Revisited

DAVID DONARI; LEONARDO ORDINEZ; RODRIGO SANTOS; JAVIER OROZCO

Asuncion

Congreso; XXXVI Conferencia Latinoamericana de Informática (XXXVI CLEI); 2010

Universidad Nacional de Asuncion

Resource sharing is one of the limiting factors when dealing with realtime scheduling. In particular, synchronizing tasks and sharing resources usually impose priority inversions and the possibility of introducing deadlocks among the tasks involved. Contention policies usually bound the blocking-time that higher priority tasks may suffer, by introducing an strict order in the access to the shared resources. The way in which they do this determines the maximum time each task would have to wait for a resource. In some cases, a resource constitutes a limiting factor for the schedulability and replicating it may facilitate the scheduling. In this paper, a replicating scheme is introduced for detecting and replicating the appropriate resource so the system can become feasible within a cost constraint.