You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Per Processor Spin-Lock Protocols for Multiprocessor Real-Time Systems

Authors:

Sara Afshar, Moris Behnam, Reinder J. Bril, Thomas Nolte

Research group:

Complex Real-Time Embedded Systems

Publication Type:

Journal article

Venue:

Leibniz Transactions on Embedded Systems

Publisher:

LITES

Abstract

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.

Bibtex

@article{Afshar4887,
author = {Sara Afshar and Moris Behnam and Reinder J. Bril and Thomas Nolte},
title = {Per Processor Spin-Lock Protocols for Multiprocessor Real-Time Systems},
month = {November},
year = {2017},
journal = {Leibniz Transactions on Embedded Systems},
publisher = {LITES},
url = {http://www.es.mdu.se/publications/4887-}
}