Investigating the Correctness and Efficiency of MrsP in Fully Partitioned Systems

Shuai Zhao; Andrew John Wellings

Investigating the Correctness and Efficiency of MrsP in Fully Partitioned Systems

Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

MrsP is a FIFO spin-based protocol that adopts a helping mechanism, where a resource holder can migrate to a remote processor to keep executing if it is preempted. In practice, allowing resource-holding tasks to migrate can raise implementation issues and run-time corner cases. In this paper, we present an investigation of the correctness and efficiency of implementing MrsP in fully partitioned systems. We identify potential race conditions and corner cases of the protocol due to the use of migrations. Then, new facilities are proposed to pre- vent the issues and to provide more efficient resource-accessing behaviours. Finally, evaluations are performed to demonstrate the impact of the run-time issues and to testify the effect of proposed facilities.

Original language	English
Publication status	Published - 17 Nov 2017
Event	10th York Doctoral Symposium on Computer Science and Electronic Engineering - University of York, York, United Kingdom Duration: 17 Nov 2017 → 17 Nov 2017 https://www.cs.york.ac.uk/yds/yds2017/

Conference

Conference	10th York Doctoral Symposium on Computer Science and Electronic Engineering
Abbreviated title	YDS 2017
Country/Territory	United Kingdom
City	York
Period	17/11/17 → 17/11/17
Internet address	https://www.cs.york.ac.uk/yds/yds2017/

Access to Document

YDS_2017_paper_4Final published version, 1.06 MB

Cite this

@conference{9824285067d3482ba6f2eff546b9ceb7,

title = "Investigating the Correctness and Efficiency of MrsP in Fully Partitioned Systems",

abstract = "MrsP is a FIFO spin-based protocol that adopts a helping mechanism, where a resource holder can migrate to a remote processor to keep executing if it is preempted. In practice, allowing resource-holding tasks to migrate can raise implementation issues and run-time corner cases. In this paper, we present an investigation of the correctness and efficiency of implementing MrsP in fully partitioned systems. We identify potential race conditions and corner cases of the protocol due to the use of migrations. Then, new facilities are proposed to pre- vent the issues and to provide more efficient resource-accessing behaviours. Finally, evaluations are performed to demonstrate the impact of the run-time issues and to testify the effect of proposed facilities.",

author = "Shuai Zhao and Wellings, {Andrew John}",

year = "2017",

month = nov,

day = "17",

language = "English",

note = "10th York Doctoral Symposium on Computer Science and Electronic Engineering, YDS 2017 ; Conference date: 17-11-2017 Through 17-11-2017",

url = "https://www.cs.york.ac.uk/yds/yds2017/",

}

TY - CONF

T1 - Investigating the Correctness and Efficiency of MrsP in Fully Partitioned Systems

AU - Zhao, Shuai

AU - Wellings, Andrew John

PY - 2017/11/17

Y1 - 2017/11/17

N2 - MrsP is a FIFO spin-based protocol that adopts a helping mechanism, where a resource holder can migrate to a remote processor to keep executing if it is preempted. In practice, allowing resource-holding tasks to migrate can raise implementation issues and run-time corner cases. In this paper, we present an investigation of the correctness and efficiency of implementing MrsP in fully partitioned systems. We identify potential race conditions and corner cases of the protocol due to the use of migrations. Then, new facilities are proposed to pre- vent the issues and to provide more efficient resource-accessing behaviours. Finally, evaluations are performed to demonstrate the impact of the run-time issues and to testify the effect of proposed facilities.

AB - MrsP is a FIFO spin-based protocol that adopts a helping mechanism, where a resource holder can migrate to a remote processor to keep executing if it is preempted. In practice, allowing resource-holding tasks to migrate can raise implementation issues and run-time corner cases. In this paper, we present an investigation of the correctness and efficiency of implementing MrsP in fully partitioned systems. We identify potential race conditions and corner cases of the protocol due to the use of migrations. Then, new facilities are proposed to pre- vent the issues and to provide more efficient resource-accessing behaviours. Finally, evaluations are performed to demonstrate the impact of the run-time issues and to testify the effect of proposed facilities.

M3 - Paper

T2 - 10th York Doctoral Symposium on Computer Science and Electronic Engineering

Y2 - 17 November 2017 through 17 November 2017

ER -