62 Hits in 9.1 sec

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

Meng Liu, Matthias Becker, Moris Behnam, Thomas Nolte
2017 Real-time systems  
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.  ...  Most of the existing works regarding priority-based NoCs use a flit-level preemptive scheduling.  ...  , and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.  ... 
doi:10.1007/s11241-017-9276-5 fatcat:6zwuyknjqbbd3gktopxjsj2qhu

Buffer-Aware Worst-Case Timing Analysis of Wormhole NoCs Using Network Calculus

Frederic Giroudot, Ahlem Mifdaoui
2018 2018 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)  
In that respect, we introduce in this paper a new buffer-aware timing analysis of wormhole NoCs based on Network Calculus.  ...  Moreover, we aim to handle such an issue for wormhole NoCs, implementing a fixed priority-preemptive arbitration of Virtual Channels (VCs), that can be assigned to an arbitrary number of traffic classes  ...  Our gratitude also goes to Emmanuel Lochin (ISAE -Université de Toulouse) for setting up the collaboration with Data61 and University of Sydney.  ... 
doi:10.1109/rtas.2018.00010 dblp:conf/rtas/GiroudotM18 fatcat:c5xj2l4iknexnhkqua4i2lfuxe

A Novel Flow Control Mechanism to Avoid Multi-Point Progressive Blocking in Hard Real-Time Priority-Preemptive NoCs

A. Burns, L. S. Indrusiak, N. Smirnov, J. Harrison
2020 2020 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)  
The recently uncovered problem of multi-point progressive blocking (MPB) has significantly increased the complexity of schedulability analysis of priority-preemptive wormhole networks-on-chip.  ...  Comparative analysis of FPGA implementations show that the hardware overheads of the proposed NoC router are comparable or lower than those of the baseline, while analytical comparison shows that the proposed  ...  Unfortunately for many protocols that were not originally designed for real-time behaviour the necessary analysis can be both complex and inherently pessimistic; this is the case with the wormhole NoC  ... 
doi:10.1109/rtas48715.2020.00-11 dblp:conf/rtas/BurnsISH20 fatcat:oikioivt5ncctkj3l5cqbqygdq

Tightness and computation assessment of worst-case delay bounds in wormhole networks-on-chip

Frederic Giroudot, Ahlem Mifdaoui
2019 Proceedings of the 27th International Conference on Real-Time Networks and Systems - RTNS '19  
The latter allows the computation of delay bounds for a large panel of wormhole NoCs, e.g., handling priority-sharing, Virtual Channel Sharing and buffer backpressure.  ...  This paper addresses the problem of worst-case timing analysis in wormhole Networks-On-Chip (NoCs).  ...  This case study was used in several previous works to test NoC real-time analysis models, and recently in [13] . It consists of 38 flows on a 4 × 4 manycore platform with a 2D-mesh NoC.  ... 
doi:10.1145/3356401.3356408 dblp:conf/rtns/GiroudotM19 fatcat:axbnhl5ezvf7lo2g24nbkt6rdu

Graph-based Approach for Buffer-aware Timing Analysis of Heterogeneous Wormhole NoCs under Bursty Traffic [article]

Frederic Giroudot, Ahlem Mifdaoui
2019 arXiv   pre-print
This paper addresses the problem of worst-case timing analysis of heterogeneous wormhole NoCs, i.e., routers with different buffer sizes and transmission speeds, when consecutive packet queuing (CPQ) occurs  ...  We tackle this problem through extending the applicability domain of our previous work for computing maximum delay bounds using Network Calculus, called Buffer-aware worst-case Timing Analysis (BATA).  ...  For instance, we can specify distinct buffer sizes, link and router capacities and processing delays values on a single NoC.  ... 
arXiv:1911.02430v1 fatcat:54qssdv3hfantk4nacf5muhxfe

Slot-Based Transmission Protocol for Real-Time NoCs - SBT-NoC

Borislav Nikolic, Robin Hofmann, Rolf Ernst, Michael Wagner
2019 Euromicro Conference on Real-Time Systems  
bounded low latencies of high-priority time-critical flows, which is a sine qua non for the inclusion of NoCs, and multiprocessors in general, in the real-time domain.  ...  The main advantage of SBT-NoC is that, while not requiring any sophisticated hardware support (e.g. virtual channels, a flit-level arbitration), it makes NoCs amenable to real-time analysis and guarantees  ...  Finally, in order to compare the performance of SBT-NoC with some other available approaches for real-time NoCs, we included priority preemptive NoCs with flit-level arbitration and per flow dedicated  ... 
doi:10.4230/lipics.ecrts.2019.26 dblp:conf/ecrts/NikolicHE19 fatcat:qvbdhljlnre4tc4hkfhsro3jbi

Simultaneous Progressing Switching Protocols for Timing Predictable Real-Time Network-on-Chips [article]

Niklas Ueter, Georg von der Brueggen, Jian-Jia Chen, Tulika Mitra, and Vanchinathan Venkataramani
2019 arXiv   pre-print
However, not only the distributed structure but also the link switching on the NoCs have imposed a great challenge in the design and analysis for real-time systems.  ...  The flexibility of such link-based arbitrations allows each packet to be distributed over multiple routers but also increases the number of possible link states (the number of flits in a buffer) that have  ...  Another research line to analyze the worst-case response time of wormhole-switched fixed-priority NoC with preemptive virtual channels is to apply Network Calculus and Compositional Performance Analysis  ... 
arXiv:1909.09457v2 fatcat:gk7ud22uyzgytgeu35262nukxm

On Routing Flexibility of Wormhole-Switched Priority-Preemptive NoCs

Borislav Nikolic, Luis Miguel Pinho, Leandro Soares Indrusiak
2016 2016 IEEE 22nd International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)  
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  ...  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  ...  BACKGROUND AND PRELIMINARIES In this section, we cover the real-time analysis of wormhole-switched priority-preemptive NoCs with fixed priorities.  ... 
doi:10.1109/rtcsa.2016.37 dblp:conf/rtcsa/NikolicPI16 fatcat:gmjfadcv4jd55i7fnow6ke3xda

Fast Simulation of Networks-on-Chip with Priority-Preemptive Arbitration

Leandro Soares Indrusiak, James Harbin, Osmar Marchi Dos Santos
2015 ACM Transactions on Design Automation of Electronic Systems  
Article: Indrusiak, Leandro Soares, Harbin, James and Dos Santos, Osmar Marchi (2015) Fast simulation of networks-on-chip with priority-preemptive  ...  We then explore such feature to produce simplified and lightweight simulation models that can produce latency figures with more than 90% accuracy and simulate more than 1000 times faster when compared  ...  Zordan and Luciano Copello Ost for the discussions and comments on this approach and this paper, and to the anonymous reviewers for their valuable suggestions and criticism.  ... 
doi:10.1145/2755559 fatcat:kxvjzjrrwbhd5kq76agpfp2ceq

Real-Time Communication Analysis for On-Chip Networks with Wormhole Switching

Zheng Shi, Alan Burns
2008 Second ACM/IEEE International Symposium on Networks-on-Chip (nocs 2008)  
Utilizing this analysis scheme, we can flexibly evaluate at design time the schedulability of a set of traffic-flows with different QoS requirements on a real-time SoC/NoC communication platform.  ...  In this paper, we discuss a real-time on-chip communication service with a priority-based wormhole switching policy. A novel off-line schedulability analysis approach is presented.  ...  In this paper, we introduce an analysis approach for real-time on-chip communication with wormhole switching and fixed priority scheduling.  ... 
doi:10.1109/nocs.2008.4492735 fatcat:j4fljmwf3fcwhbyuegw2fi6qfm

The network calculator for NoC buffer space evaluation

Nadezhda Matveeva, Lev Kurbanov, Elena Suvorova, Yuriy Sheynin, Valentin Rozanov
2015 2015 17th Conference of Open Innovations Association (FRUCT)  
We suggest the method of buffer space calculation for NoC with arbitrary topology and the algorithm of the corresponding network calculator.  ...  In this paper we discuss the problem of choosing the buffer size in the Network-on-Chip routers.  ...  ACKNOWLEDGMENT The research leading to these results has received financial support from the Ministry of Education and Science of the Russian Federation according to the base part of the state funding  ... 
doi:10.1109/fruct.2015.7117982 dblp:conf/fruct/MatveevaKSSR15 fatcat:rhu6yodvp5ailp3tivbtycd3ti

Mathematical formalisms for performance evaluation of networks-on-chip

Abbas Eslami Kiasari, Axel Jantsch, Zhonghai Lu
2013 ACM Computing Surveys  
The article discusses the basic concepts and results of each formalism and provides examples of how they have been used in Networks-on-Chip (NoCs) performance analysis.  ...  This article reviews four popular mathematical formalisms-queueing theory, network calculus, schedulability analysis, and dataflow analysis-and how they have been applied to the analysis of on-chip communication  ...  ACKNOWLEDGMENT The authors would like to thank the reviewers for their valuable comments and suggestions.  ... 
doi:10.1145/2480741.2480755 fatcat:wwlsqn7arng7hcgu4lxwbpdf3u

Real-Time Guarantees in Routerless Networks-on-Chip [article]

Leandro Soares Indrusiak, Alan Burns
2022 arXiv   pre-print
Extensive comparative analysis is provided, considering different architectures for routerless networks and a state-of-the-art wormhole network based on priority-preemptive routers as a baseline.  ...  It presents a novel analytical framework that can provide latency upper bounds to real-time packet flows sent over routerless networks-on-chip, and it uses that framework to evaluate the ability of such  ...  priority-preemptive NoC when it comes to real-time schedulability, even in the cases with shared injection link.  ... 
arXiv:2209.10430v1 fatcat:4vz4sqg7rzathbtvz2j6tlkcf4

End-to-end schedulability tests for multiprocessor embedded systems based on networks-on-chip with priority-preemptive arbitration

Leandro Soares Indrusiak
2014 Journal of systems architecture  
In safety-critical applications with hard real-time constraints, this is clearly not sufficient because there is an expectation that the application should be schedulable on that platform in all possible  ...  platform configuration, whether all application tasks and communication messages always meet their hard real-time constraints in every possible scenario.  ...  and Norazizi Sayuti for the discussions and help with the experimental work supporting subsection 5.2.  ... 
doi:10.1016/j.sysarc.2014.05.002 fatcat:vrthcy3scvhxxfvwkus4stmfuy

Network Delays and Link Capacities in Application-Specific Wormhole NoCs

Zvika Guz, Isask'har Walter, Evgeny Bolotin, Israel Cidon, Ran Ginosar, Avinoam Kolodny
2007 VLSI design (Print)  
This paper presents a novel analytical delay model for virtual channeled wormhole networks with nonuniform links and applies the analysis in devising an efficient capacity allocation algorithm which assigns  ...  The algorithm should minimize the communication resource costs under Quality-of-Service timing constraints.  ...  SIGNAL Router Arbitration Policy: Each output port schedules transmission of flits according to the availability of buffers in the next router and the service level priority of the pending flits.  ... 
doi:10.1155/2007/90941 fatcat:3gwwytffi5ggbi4p7fi2hezp4m
« Previous Showing results 1 — 15 out of 62 results