Buffer-aware bounds to multi-point progressive blocking in priority-preemptive NoCs

Leandro Soares Indrusiak; Alan Burns; Borislav Nikolic

Buffer-aware bounds to multi-point progressive blocking in priority-preemptive NoCs

Leandro Soares Indrusiak, Alan Burns, Borislav Nikolic

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This paper aims to reduce the pessimism of the analysis of the multi-point progressive blocking (MPB) problem in real-time priority-preemptive wormhole networks-on-chip. It shows that the amount of buffering on each network node can influence the worst-case interference that packets can suffer along their routes, and it proposes a novel analytical model that can quantify such interference as a function of the buffer size. It shows that, perhaps counter-intuitively, smaller buffers can result in lower upper-bounds on interference and thus improved schedulability. Didactic examples and large-scale experiments provide evidence of the strength of the proposed approach.

Original language	English
Title of host publication	Proceedings of the 2018 Design, Automation & Test in Europe Conference (DATE)
Pages	219-224
Publication status	Published - Mar 2018
Event	Design, Automation and Test in Europe - Dresden, Germany Duration: 19 Mar 2018 → 23 Mar 2018

Conference

Conference	Design, Automation and Test in Europe
Abbreviated title	DATE
Country/Territory	Germany
Period	19/03/18 → 23/03/18

Access to Document

IndrusiakDATEv4 - Camera Ready
© 2017, IEEE.This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details
Accepted author manuscript, 1.09 MB

Leandro Soares Indrusiak
- Computer Science - Honorary Visiting Professor
Person

2 Finished

Mixed Criticality Cyber- Physical Systems
Burns, A., Bate, I. J., Davis, R. I. & Soares Indrusiak, L.
EPSRC
1/10/16 → 30/09/19
Project: Research project (funded) › Research
MCC: Mixed Criticality Embedded Systems on Many-Core Platforms
Burns, A., Bate, I. J., Davis, R. I., Soares Indrusiak, L. & Harbin, J. R.
EPSRC
1/04/13 → 30/09/16
Project: Research project (funded) › Research

Cite this

@inproceedings{a93fc0c6cae843fdbe6a80b0ba7d4966,

title = "Buffer-aware bounds to multi-point progressive blocking in priority-preemptive NoCs",

abstract = "This paper aims to reduce the pessimism of the analysis of the multi-point progressive blocking (MPB) problem in real-time priority-preemptive wormhole networks-on-chip. It shows that the amount of buffering on each network node can influence the worst-case interference that packets can suffer along their routes, and it proposes a novel analytical model that can quantify such interference as a function of the buffer size. It shows that, perhaps counter-intuitively, smaller buffers can result in lower upper-bounds on interference and thus improved schedulability. Didactic examples and large-scale experiments provide evidence of the strength of the proposed approach.",

author = "{Soares Indrusiak}, Leandro and Alan Burns and Borislav Nikolic",

year = "2018",

month = mar,

language = "English",

pages = "219--224",

booktitle = "Proceedings of the 2018 Design, Automation & Test in Europe Conference (DATE)",

note = "Design, Automation and Test in Europe, DATE ; Conference date: 19-03-2018 Through 23-03-2018",

}

TY - GEN

T1 - Buffer-aware bounds to multi-point progressive blocking in priority-preemptive NoCs

AU - Soares Indrusiak, Leandro

AU - Burns, Alan

AU - Nikolic, Borislav

PY - 2018/3

Y1 - 2018/3

N2 - This paper aims to reduce the pessimism of the analysis of the multi-point progressive blocking (MPB) problem in real-time priority-preemptive wormhole networks-on-chip. It shows that the amount of buffering on each network node can influence the worst-case interference that packets can suffer along their routes, and it proposes a novel analytical model that can quantify such interference as a function of the buffer size. It shows that, perhaps counter-intuitively, smaller buffers can result in lower upper-bounds on interference and thus improved schedulability. Didactic examples and large-scale experiments provide evidence of the strength of the proposed approach.

AB - This paper aims to reduce the pessimism of the analysis of the multi-point progressive blocking (MPB) problem in real-time priority-preemptive wormhole networks-on-chip. It shows that the amount of buffering on each network node can influence the worst-case interference that packets can suffer along their routes, and it proposes a novel analytical model that can quantify such interference as a function of the buffer size. It shows that, perhaps counter-intuitively, smaller buffers can result in lower upper-bounds on interference and thus improved schedulability. Didactic examples and large-scale experiments provide evidence of the strength of the proposed approach.

M3 - Conference contribution

SP - 219

EP - 224

BT - Proceedings of the 2018 Design, Automation & Test in Europe Conference (DATE)

T2 - Design, Automation and Test in Europe

Y2 - 19 March 2018 through 23 March 2018

ER -

Buffer-aware bounds to multi-point progressive blocking in priority-preemptive NoCs

Abstract

Conference

Access to Document

Profiles

Leandro Soares Indrusiak

Projects

Mixed Criticality Cyber- Physical Systems

MCC: Mixed Criticality Embedded Systems on Many-Core Platforms

Cite this