The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
우리는 온칩 웜홀 네트워크에서 흐름별 플릿 및 패킷 최악의 지연 경계를 조사합니다. 많은 하드 실시간 임베디드 애플리케이션에서 요구되는 것처럼 비용이 제한된 시스템의 최악의 조건에서 보증을 제공하려면 이러한 조사가 필수적입니다. 먼저 흐름 제어, 링크 및 버퍼 공유에 대한 분석 모델을 제안합니다. 이러한 분석 모델을 기반으로 흐름 제어, 링크 및 버퍼 공유의 결합된 효과를 포착하는 개방형 서비스 분석 모델을 얻습니다. 서비스 분석 모델을 사용하여 개별 흐름에 대한 등가 서비스 곡선을 계산한 다음 플릿 및 패킷 지연 범위를 도출합니다. 실험 결과는 분석 범위가 정확하고 엄격하다는 것을 확인합니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Yue QIAN, Zhonghai LU, Wenhua DOU, "Worst-Case Flit and Packet Delay Bounds in Wormhole Networks on Chip" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 12, pp. 3211-3220, December 2009, doi: 10.1587/transfun.E92.A.3211.
Abstract: We investigate per-flow flit and packet worst-case delay bounds in on-chip wormhole networks. Such investigation is essential in order to provide guarantees under worst-case conditions in cost-constrained systems, as required by many hard real-time embedded applications. We first propose analysis models for flow control, link and buffer sharing. Based on these analysis models, we obtain an open-ended service analysis model capturing the combined effect of flow control, link and buffer sharing. With the service analysis model, we compute equivalent service curves for individual flows, and then derive their flit and packet delay bounds. Our experimental results verify that our analytical bounds are correct and tight.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.3211/_p
부
@ARTICLE{e92-a_12_3211,
author={Yue QIAN, Zhonghai LU, Wenhua DOU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Worst-Case Flit and Packet Delay Bounds in Wormhole Networks on Chip},
year={2009},
volume={E92-A},
number={12},
pages={3211-3220},
abstract={We investigate per-flow flit and packet worst-case delay bounds in on-chip wormhole networks. Such investigation is essential in order to provide guarantees under worst-case conditions in cost-constrained systems, as required by many hard real-time embedded applications. We first propose analysis models for flow control, link and buffer sharing. Based on these analysis models, we obtain an open-ended service analysis model capturing the combined effect of flow control, link and buffer sharing. With the service analysis model, we compute equivalent service curves for individual flows, and then derive their flit and packet delay bounds. Our experimental results verify that our analytical bounds are correct and tight.},
keywords={},
doi={10.1587/transfun.E92.A.3211},
ISSN={1745-1337},
month={December},}
부
TY - JOUR
TI - Worst-Case Flit and Packet Delay Bounds in Wormhole Networks on Chip
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3211
EP - 3220
AU - Yue QIAN
AU - Zhonghai LU
AU - Wenhua DOU
PY - 2009
DO - 10.1587/transfun.E92.A.3211
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2009
AB - We investigate per-flow flit and packet worst-case delay bounds in on-chip wormhole networks. Such investigation is essential in order to provide guarantees under worst-case conditions in cost-constrained systems, as required by many hard real-time embedded applications. We first propose analysis models for flow control, link and buffer sharing. Based on these analysis models, we obtain an open-ended service analysis model capturing the combined effect of flow control, link and buffer sharing. With the service analysis model, we compute equivalent service curves for individual flows, and then derive their flit and packet delay bounds. Our experimental results verify that our analytical bounds are correct and tight.
ER -