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

Indrusiak, Leandro; Burns, Alan; Nikolic, Borislav

http://hdl.handle.net/10400.22/12354

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
COM26_CISTER_2018.pdf		166.54 KB	Adobe PDF	Download

Send Feedback

Authors

Indrusiak, Leandro

Burns, Alan

Nikolic, Borislav

Abstract(s)

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.