An efficient spin-lock based multi-core resource sharing protocol

Abstract : 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. © 2014 IEEE.
Document type :
Conference papers
Complete list of metadatas

https://hal.uvsq.fr/hal-02177226
Contributor : Équipe Hal Uvsq <>
Submitted on : Monday, July 8, 2019 - 5:12:36 PM
Last modification on : Tuesday, July 9, 2019 - 1:03:02 AM

Identifiers

Collections

Citation

M. Alfranseder, M. Deubzer, B. Justus, J. Mottok, C. Siemers. An efficient spin-lock based multi-core resource sharing protocol. 33rd IEEE International Performance Computing and Communications Conference, IPCCC 2014, Dec 2014, Austin, United States. pp.7017090, ⟨10.1109/PCCC.2014.7017090⟩. ⟨hal-02177226⟩

Share

Metrics

Record views

15