An Efficient Spin-Lock Based Multi-Core Resource Sharing Protocol
- We present in this paper a new lock-based resource sharing protocol PWLP (Preemptable Waiting Locking Protocol) for embedded multi-core processors. It is based on the busy-wait model and works with non-preemptive critical sections while task may be preempted by tasks with a higher priority when waiting for resources. Our protocol can be applied in partitioned as well as global scheduling scenarios, in which task-fix, job-fix or dynamically assigned priorities may be used. Furthermore, the PWLP permits nested requests to shared resources. Finally, we present a case study based on event-based simulations in which the FMLP (Flexible Multiprocessor Locking Protocol) and the proposed PWLP are compared.
Author: | Martin Alfranseder, Michael Deubzer, Benjamin Justus, Jürgen MottokORCiDGND, Christian Siemers |
---|---|
DOI: | https://doi.org/10.1109/PCCC.2014.7017090 |
Parent Title (German): | 33rd IEEE International Performance, Computing, and Communications Conference (IPCCC), Austin (TX), USA, 5-7 December 2014 |
Document Type: | conference proceeding (article) |
Language: | English |
Year of first Publication: | 2014 |
Release Date: | 2021/03/01 |
Institutes: | Fakultät Elektro- und Informationstechnik |
Fakultät Elektro- und Informationstechnik / Laboratory for Safe and Secure Systems (LAS3) | |
research focus: | Digitalisierung |