- DOI: 10.4230/LITES-v004-i002-a003
- URN:
This paper investigates preemptive spin-based global resource sharing protocols for resource-constrained real-time embedded multi-core systems based on partitioned fixed-priority preemptive scheduling. We present preemptive spin-based protocols that feature (i) an increased schedulability ratio of task sets and reduced response jitter of tasks compared to the classical non-preemptive spin-based protocol, (ii) similar memory requirements for the administration of waiting tasks as for the non-preemptive protocol whilst only causing (iii) a minimal increase of the minimal number of required stacks per core from one to at most two, and (iv) strong progress guarantees to tasks. We complement these protocols with a unified worst-case response time analysis that specializes to the classical analysis for the non-preemptive protocol. The paper includes a comparative evaluation of the preemptive protocols and the non-preemptive protocol based on synthetic data.
@Article{afshar_et_al:LITES-v004-i002-a003, author = {Afshar, Sara and Behnam, Moris and Bril, Reinder J. and Nolte, Thomas}, title = {{Per Processor Spin-Based Protocols for Multiprocessor Real-Time Systems}}, journal = {Leibniz Transactions on Embedded Systems}, pages = {03:1--03:30}, ISSN = {2199-2002}, year = {2018}, volume = {4}, number = {2}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES-v004-i002-a003}, doi = {10.4230/LITES-v004-i002-a003}, annote = {Keywords: Resource sharing, Real-time systems, Multiprocessors, Spin-locks} }
Feedback for Dagstuhl Publishing