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

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...

ver descrição completa

Detalhes bibliográficos
Autor principal: Indrusiak, Leandro (author)
Outros Autores: Burns, Alan (author), Nikolic, Borislav (author)
Formato: conferenceObject
Idioma:eng
Publicado em: 2018
Assuntos:
Texto completo:http://hdl.handle.net/10400.22/12354
País:Portugal
Oai:oai:recipp.ipp.pt:10400.22/12354
Descrição
Resumo: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.