New schedulability analysis for MrsP

Zhao, Shuai and Garrido Balaguer, Jorge and Burns, Alan and Wellings, Andy (2017). New schedulability analysis for MrsP. In: "23rd International Conference on Embedded and Real-Time Computing Systems and Applications", 16/08/2017 - 18/08/2017, Hsinchu, Taiwan. pp. 1-10. https://doi.org/10.1109/RTCSA.2017.8046311.

Description

Title: New schedulability analysis for MrsP
Author/s:
  • Zhao, Shuai
  • Garrido Balaguer, Jorge
  • Burns, Alan
  • Wellings, Andy
Item Type: Presentation at Congress or Conference (Article)
Event Title: 23rd International Conference on Embedded and Real-Time Computing Systems and Applications
Event Dates: 16/08/2017 - 18/08/2017
Event Location: Hsinchu, Taiwan
Title of Book: 23rd International Conference on Embedded and Real-Time Computing Systems and Applications
Date: 2017
Subjects:
Faculty: E.T.S.I. Telecomunicación (UPM)
Department: Ingeniería de Sistemas Telemáticos [hasta 2014]
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (2MB) | Preview

Abstract

In this paper we consider a spin-based multi-processor locking protocol, named the Multiprocessor resource sharing Protocol (MrsP). MrsP adopts a helping-mechanism where the preempted resource holder can migrate. The original schedulability analysis of MrsP carries considerable pessimism as it has been developed assuming limited knowledge of the resource usage for each remote task. In this paper new MrsP schedulability analysis is developed that takes into account such knowledge to provide a less pessimistic analysis than that of the original analysis. Our experiments show that, theoretically, the new analysis offers better (at least identical) schedulability than the FIFO non-preemptive protocol, and can outperform FIFO preemptive spin locks under systems with either intensive resource contention or long critical sections. The paper also develops analysis to include the overhead of MrsP?s helping mechanism. Although MrsP?s helping mechanism theoretically increases schedulability, our evaluation shows that this increase may be negated when the overheads of migrations are taken into account. To mitigate this, we have modified the MrsP protocol to introduce a short non-preemptive section following migration. Our experiments demonstrate that with migration cost, MrsP may not be favourable for short critical sections but provides a better schedulability than other FIFO spin-based protocols when long critical sections are applied.

More information

Item ID: 50009
DC Identifier: http://oa.upm.es/50009/
OAI Identifier: oai:oa.upm.es:50009
DOI: 10.1109/RTCSA.2017.8046311
Official URL: https://ieeexplore.ieee.org/document/8046311/
Deposited by: Memoria Investigacion
Deposited on: 07 May 2018 16:14
Last Modified: 07 May 2018 16:14
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM