New schedulability analysis for MrsP

Zhao, Shuai; Garrido Balaguer, Jorge; Burns, Alan y Wellings, Andy (2017). New schedulability analysis for MrsP. En: "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.

Descripción

Título: New schedulability analysis for MrsP
Autor/es:
  • Zhao, Shuai
  • Garrido Balaguer, Jorge
  • Burns, Alan
  • Wellings, Andy
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: 23rd International Conference on Embedded and Real-Time Computing Systems and Applications
Fechas del Evento: 16/08/2017 - 18/08/2017
Lugar del Evento: Hsinchu, Taiwan
Título del Libro: 23rd International Conference on Embedded and Real-Time Computing Systems and Applications
Fecha: 2017
Materias:
Escuela: E.T.S.I. Telecomunicación (UPM)
Departamento: Ingeniería de Sistemas Telemáticos [hasta 2014]
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (2MB) | Vista Previa

Resumen

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.

Más información

ID de Registro: 50009
Identificador DC: http://oa.upm.es/50009/
Identificador OAI: oai:oa.upm.es:50009
Identificador DOI: 10.1109/RTCSA.2017.8046311
URL Oficial: https://ieeexplore.ieee.org/document/8046311/
Depositado por: Memoria Investigacion
Depositado el: 07 May 2018 16:14
Ultima Modificación: 07 May 2018 16:14
  • GEO_UP4
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • InvestigaM
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM