Per processor spin-based protocols for multiprocessor real-time systems

S. Afshar, M. Behnam, R.J. Bril, T. Nolte

Research output: Contribution to journalArticleAcademicpeer-review

56 Downloads (Pure)


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.
Original languageEnglish
Article number03
Number of pages30
JournalLeibniz Transactions on Embedded Systems
Issue number2
Publication statusPublished - 2017


  • Multiprocessor
  • multitasking
  • spin-lock protocols


Dive into the research topics of 'Per processor spin-based protocols for multiprocessor real-time systems'. Together they form a unique fingerprint.

Cite this