Scheduling and memory requirements analysis with AADL
Proceedings of the 2005 annual ACM SIGAda international conference on Ada: The Engineering of Correct and Reliable Software for Real-Time & Distributed Systems using Ada and Related Technologies
On the design and implementation of a shared memory dispatcher for partially clairvoyant schedulers
International Journal of Parallel Programming
A shared memory dispatching approach for partially clairvoyant schedulers
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Revisiting transactions in Ada
ACM SIGAda Ada Letters
| Hi-index | 0.00 |
A non-blocking protocol that allows real-time tasks to share data in a multiprocessor system is presented in this paper. The protocol gives the means to concurrent real-time tasks to read and write shared data; the protocol allows multiple write and multiple read operations to be executed concurrently.Our protocol extends previous results and is optimal with respect to space requirements. Together with the protocol, its schedulability analysis and a set of schedulability tests for a set of random task sets are presented. Both the schedulability analysis and the schedulability experiments show that the algorithm presented in this paper exhibits less overhead than the lock based protocols.