EDF as an arbitration policy for wormhole-switched priority-preemptive NoCs

Nikolic, Borislav; Petters, Stefan M.

doi:10.1145/2656045.2656056

Cited by 16 publications

(12 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper considers PDR as a metric of network reliability, since CT switching in general-purpose heterogeneous networks confronts vastly different challenges than classical CT switching. For example, CT switching in NoC deals with a set of schedulable flows that can already satisfy the performance goals like end-to-end latency [28]. In our case, however, schedulability cannot be guaranteed due to the complex network topology and high randomness in packet arrivals and routing paths.…”

Section: A Nzl Packets and Flit Forwardingmentioning

confidence: 97%

Flit Scheduling for Cut-Through Switching: Towards Near-Zero End-to-End Latency

2019

View full text Add to dashboard Cite

Achieving low end-to-end latency with high reliability is one of the key objectives for future mission-critical applications, like the Tactile Internet and real-time interactive Virtual/Augmented Reality (VR/AR). To serve the purpose, cut-through (CT) switching is a promising approach to significantly reduce the transmission delay of store-and-forward switching, via flit-ization of a packet and concurrent forwarding of the flits belonging to the same packet. CT switching, however, has been applied only to well-controlled scenarios like network-on-chip and data center networks, and hence flit scheduling in heterogeneous environments (e.g., the Internet and wide area network) has been given little attention. This paper tries to fill the gap to facilitate the adoption of CT switching in the general-purpose data networks. In particular, we first introduce a packet discarding technique that sheds the packet expected to violate its delay requirement and then propose two flit scheduling algorithms, f EDF (flit-based Earliest Deadline First) and f SPF (flit-based Shortest Processing-time First), aiming at enhancing both reliability and end-to-end latency. Considering packet delivery ratio (PDR) as a reliability metric, we performed extensive simulations to show that the proposed scheduling algorithms can enhance PDR by up to 30.11% (when the delay requirement is 7 ms) and the average end-to-end latency by up to 13.86% (when the delay requirement is 10 ms), against first-in first-out (FIFO) scheduling. INDEX TERMSComputer networks, cut-through switching, end-to-end latency, packet switching, performance evaluation, scheduling algorithm.

show abstract

Section: A Nzl Packets and Flit Forwardingmentioning

confidence: 97%

Flit Scheduling for Cut-Through Switching: Towards Near-Zero End-to-End Latency

2019

View full text Add to dashboard Cite

show abstract

“…Then, Shi et al [14] extended the model so as to make it applicable to flow-sets with arbitrary deadlines, while Nikolić et al [15] reduced hardware requirements of this model. 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

“…For interconnected mediums based on platforms that consist of multiple cores, the effects of communication contention are mild and can be disregarded from a real-time analysis [3]. Yet, contention became more apparent, considering the number of processors integrated within multiprocessor platforms doubled or kept increasing even more, and the application complexity will keep growing rapidly in the anticipated future.…”

Section: Introductionmentioning

confidence: 99%

Application Mapping and Scheduling for Network-on-Chip-Based Multiprocessor System-on-Chip With Fine-Grain Communication Optimization

Yang

Liu

Jiang

et al. 2016

IEEE Trans. VLSI Syst.

View full text Add to dashboard Cite

Network-on-chip (NoC) is promising for the communication paradigm of the next-generation multiprocessor system-on-chip (MPSoC). As communication has become an integral part of on-chip computing, and even the performance bottleneck, researchers are paying much attention to its implementation and optimization. Traditional techniques that model communication inaccurately will lead to unexpected runtime performance, which is on average 90.8% worse than the predicted results based on observation, and are not suitable for the deep optimization of communication-intensive scenarios. In this paper, techniques are presented for the NoC-based MPSoCs that integrate optimization on interprocessor communications with the objective of minimizing the schedule length. A fine-grained integer-linear programming (ILP) model is proposed to properly address the communication latency with a network contention, which generates runtime scheduling with trivial performance difference from the predictions. We further propose a heuristic algorithm, unified priority-based scheduling (UPS), to effectively solve the contention problem in polynomial time by assigning priorities to messages. Evaluation results show that the solutions obtained by the ILP model outperform the state-of-the-art techniques by 31.1%, and UPS improves application performance by 34.7% and 44.4% compared with acquainted first-in-first-out (FIFO)-based and random-based methods. In addition, UPS achieves averagely 8.3% approximated results with the optimal solutions generated by ILP. A case study on H.264 high-definition television (HDTV) decoder and the digital signal processor (DSP) filter benchmarks achieves significant improvement on the performance and the results prediction accuracy, as well as the prominent reduction in the number of network contention and energy consumption.

show abstract

EDF as an arbitration policy for wormhole-switched priority-preemptive NoCs

Cited by 16 publications

References 17 publications

Flit Scheduling for Cut-Through Switching: Towards Near-Zero End-to-End Latency

Flit Scheduling for Cut-Through Switching: Towards Near-Zero End-to-End Latency

On Routing Flexibility of Wormhole-Switched Priority-Preemptive NoCs

Application Mapping and Scheduling for Network-on-Chip-Based Multiprocessor System-on-Chip With Fine-Grain Communication Optimization

Contact Info

Product

Resources

About