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
Nous étudions les limites de retard par flux et les pires cas de retard des paquets dans les réseaux de trous de ver sur puce. Une telle enquête est essentielle afin de fournir des garanties dans les pires conditions dans des systèmes à coûts limités, comme l'exigent de nombreuses applications embarquées en temps réel. Nous proposons d’abord des modèles d’analyse pour le contrôle de flux, le partage de liens et de tampons. Sur la base de ces modèles d'analyse, nous obtenons un modèle d'analyse de service ouvert capturant l'effet combiné du contrôle de flux, du partage de liens et de tampons. Avec le modèle d'analyse de service, nous calculons des courbes de service équivalentes pour des flux individuels, puis en déduisons leurs limites de délai de vol et de paquet. Nos résultats expérimentaux vérifient que nos limites analytiques sont correctes et serrées.
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.
Copier
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
Copier
@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},}
Copier
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 -