Meng Liu, Matthias Becker, Moris Behnam, Thomas Nolte. A tighter recursive calculus to compute the worst case traversal time of real-time traffic over NoCs. In 22nd Asia and South Pacific Design Automation Conference, ASP-DAC 2017, Chiba, Japan, January 16-19, 2017. pages 275-282, IEEE, 2017. [doi]
@inproceedings{LiuBBN17,
title = {A tighter recursive calculus to compute the worst case traversal time of real-time traffic over NoCs},
author = {Meng Liu and Matthias Becker and Moris Behnam and Thomas Nolte},
year = {2017},
doi = {10.1109/ASPDAC.2017.7858332},
url = {http://dx.doi.org/10.1109/ASPDAC.2017.7858332},
researchr = {https://researchr.org/publication/LiuBBN17},
cites = {0},
citedby = {0},
pages = {275-282},
booktitle = {22nd Asia and South Pacific Design Automation Conference, ASP-DAC 2017, Chiba, Japan, January 16-19, 2017},
publisher = {IEEE},
isbn = {978-1-5090-1558-0},
}