Stack-based scheduling for realtime processes
Real-Time Systems
Synchronization in Real-Time Systems: A Priority Inheritance Approach
Synchronization in Real-Time Systems: A Priority Inheritance Approach
RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
Minimizing Memory Utilization of Real-Time Task Sets in Single and Multi-Processor Systems-on-a-Chip
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Application-defined scheduling in Ada
IRTAW '03 Proceedings of the 12th international workshop on Real-time Ada
A Flexible Real-Time Locking Protocol for Multiprocessors
RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Correcting the EDF protocol in Ada 2005
IRTAW '07 Proceedings of the 13th international workshop on Real-time Ada
Real-Time Synchronization on Multiprocessors: To Block or Not to Block, to Suspend or Spin?
RTAS '08 Proceedings of the 2008 IEEE Real-Time and Embedded Technology and Applications Symposium
RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Optimality Results for Multiprocessor Real-Time Locking
RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Real-time resource-sharing under clustered scheduling: mutex, reader-writer, and k-exclusion locks
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
| Hi-index | 0.00 |
As from Ada 2005, the language has supported different dispatching policies including fixed priority (FP) and earliestdeadline first (EDF). EDF dispatching can be applied across the whole range of priorities or across a restricted range. In this way, EDF scheduling is integrated into a FP framework. Baker's Stack Resource Policy (SRP) is also integrated with Ada's immediate priority ceiling protocol to support resource sharing using protected objects. However, with the introduction of support for global, partitioned and cluster scheduling for multiprocessor systems, the use of protected objects in applications needs to be re-evaluated. This is because Ada does not completely define how protected objects are accessed in a multiprocessor environment and because the SRP cannot be directly applied to multiprocessors. This paper reviews the currently available multiprocessor resource allocation policies and analyzes their applicability to Ada. It proposes some new Ada mechanisms that would facilitate the programming of a variety of protected object access protocols.