SLA: A Stage-Level Latency Analysisfor Real-Time Communicationin a Pipelined Resource Model

Kashif, Hany; Gholamian, Sina; Patel, Hiren

doi:10.1109/tc.2014.2315617

Cited by 21 publications

(26 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Targeting fixed-priority based NoCs, the authors in Burns (2008, 2009a, b) present a Response Time Analysis (RTA) based on the well-known analysis for task scheduling (Joseph and Pandya 1986). Kashif et al (2015) have proposed a stage-level latency analysis which can provide tighter estimates of latencies compared to the analysis presented in Shi and Burns (2008). However, the stage-level analysis is based on a condition that, the buffer at each router is large enough such that the transmission of a packet cannot be delayed because the buffer at a downstream router is full.…”

Section: Related Workmentioning

confidence: 99%

“…only holding several flits (Wentzlaff et al 2007;Baron 2010) which does not support the above condition. When the buffer size is not sufficient, the analysis in Kashif et al (2015) can produce optimistic results. Recently, the authors in Xiong et al (2016) have shown that the analysis of Shi and Burns (2008) can be optimistic when a NoC buffer can hold more than a single flit, and they proposed a new method to resolve the optimistic problem.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Using non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NoCs

et al. 2017

View full text Add to dashboard Cite

Network-on-Chip (NoC) is a preferred communication medium for massively parallel platforms. Fixed-priority based scheduling using virtual-channels is one of the promising solutions to support real-time traffic in on-chip networks. Most of the existing works regarding priority-based NoCs use a flit-level preemptive scheduling. Under such a mechanism, preemptions can only happen between the transmissions of successive flits but not during the transmission of a single flit. In this paper, we present a modified framework where the non-preemptive region of each NoC packet increases from a single flit. Using the proposed approach, the response times of certain traffic flows can be reduced, which can thus improve the schedulability of the whole network. As a result, the utilization of NoCs can be improved by admitting more real-time traffic. Schedulability tests regarding the proposed framework are presented along with the proof of the correctness. Additionally, we also propose a path modification approach on top of the non-preemptive region based method to further improve schedulability. A number of experiments have been performed to evaluate the proposed solutions, where we can observe significant improvement on schedulability compared to the original flit-level preemptive NoCs.This work is an extended version of the paper presented at RTCSA 2016 (Liu et al. 2016).

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Using non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NoCs

et al. 2017

View full text Add to dashboard Cite

show abstract

“…Also working on this topic, Shi and Burns [16] and Liu et al [17] derived methods for priority assignment, while Nikolić and Petters [18] introduced a novel arbitration policy and the accompanying worst-case analysis for flows with dynamic priorities. Kashif et al [19] proposed a stage level analysis which performs better than the traditional analysis, but requires sufficiently big buffers to store preempted flows.…”

Section: Related Workmentioning

confidence: 99%

On Routing Flexibility of Wormhole-Switched Priority-Preemptive NoCs

Nikolic

Pinho

Indrusiak

2016

2016 IEEE 22nd International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

View full text Add to dashboard Cite

Flit-level preemptions via virtual channels have been proposed as one viable method to implement priority preemptive arbitration policies in NoC routers, and integrate NoCs in the hard real-time domain. In recent years, researchers have explored several aspects of priority-preemptive NoCs, such as different arbitration techniques, different priority assignmen tmethods (where applicable) and different workload mapping approaches, all with the common objective to use interconnect mediums more efficiently. Yet, the impact of different routing techniques on such a model is still an unexplored topic. Motivated by this reality, in this work we study the effects of routing flexibility on wormhole-switched priority-preemptive NoCs. Abstract-Flit-level preemptions via virtual channels have been proposed as one viable method to implement prioritypreemptive arbitration policies in NoC routers, and integrate NoCs in the hard real-time domain. In recent years, researchers have explored several aspects of priority-preemptive NoCs, such as different arbitration techniques, different priority assignment methods (where applicable) and different workload mapping approaches, all with the common objective to use interconnect mediums more efficiently. Yet, the impact of different routing techniques on such a model is still an unexplored topic. Motivated by this reality, in this work we study the effects of routing flexibility on wormhole-switched priority-preemptive NoCs.

show abstract

“…Over the years, many analytical models of increasing complexity have attempted to calculate upper-bounds to the latency of packets injected in such a NoC [11], [7]. Those models make assumptions about the traffic generated by the realtime applications running on the NoC (e.g.…”

Section: Introductionmentioning

confidence: 99%

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

Indrusiak

Burns

Nikolic

2018

2018 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE)

View full text Add to dashboard Cite

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.

show abstract

SLA: A Stage-Level Latency Analysisfor Real-Time Communicationin a Pipelined Resource Model

Cited by 21 publications

References 17 publications

Using non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NoCs

Using non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NoCs

On Routing Flexibility of Wormhole-Switched Priority-Preemptive NoCs

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

Contact Info

Product

Resources

About