000143419 001__ 143419
000143419 005__ 20180913055605.0
000143419 037__ $$aCONF
000143419 245__ $$aA Method for Calculating Hard QoS Guarantees for Networks-on-Chip
000143419 269__ $$a2009
000143419 260__ $$c2009
000143419 336__ $$aConference Papers
000143419 520__ $$aMany Networks-on-Chip (NoC) applications exhibit one or more critical traffic flows that require hard Quality of Service (QoS). Guaranteeing bandwidth and latency for such real time flows is crucial. In this paper, we present novel methods to efficiently calculate worst-case bandwidth and latency bounds and thereby provide hard QoS guarantees. Importantly, the proposed methods apply even to best-effort NoC architectures,with no extra hardware dedicated to QoS support. By applying our methods to several realistic NoC designs, we show substantial improvements (on average, more than 30% in bandwidth and 50% in latency) in bound tightness with respect to existing approaches.
000143419 6531_ $$aSoC
000143419 6531_ $$aNoC
000143419 6531_ $$aQoS
000143419 6531_ $$aWormhole switching
000143419 6531_ $$aReal-time guarantees
000143419 6531_ $$aPerformance analytical model
000143419 700__ $$0(EPFLAUTH)190571$$aRahmati, Dara$$g190571
000143419 700__ $$0242414$$aMurali, Srinivasan$$g171633
000143419 700__ $$0243773$$aBenini, Luca$$g171049
000143419 700__ $$0241996$$aAngiolini, Federico$$g169841
000143419 700__ $$0240269$$aDe Micheli, Giovanni$$g167918
000143419 700__ $$0(EPFLAUTH)194088$$aSarbazi-Azad, Hamid$$g194088
000143419 7112_ $$aInternational Conference on CAD (ICCAD)$$cSan Jose, California, USA$$dNovember 2-5, 2009
000143419 773__ $$tProceedings of the International Conference on CAD (ICCAD)
000143419 8564_ $$s838001$$uhttps://infoscience.epfl.ch/record/143419/files/paper_383.pdf$$yn/a$$zn/a
000143419 909C0 $$0252283$$pLSI1$$xU11140
000143419 909CO $$ooai:infoscience.tind.io:143419$$pconf$$pSTI$$pIC
000143419 917Z8 $$x112915
000143419 937__ $$aEPFL-CONF-143419
000143419 973__ $$aEPFL$$rREVIEWED$$sPUBLISHED
000143419 980__ $$aCONF