Analysis of worst-case delay bounds for best-effort communication in wormhole networks on chip
暂无分享,去创建一个
[1] Luciano Lenzini,et al. Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks , 2006, Perform. Evaluation.
[2] Cheng-Shang Chang,et al. Performance guarantees in communication networks , 2000, Eur. Trans. Telecommun..
[3] Kees Goossens,et al. AEthereal network on chip: concepts, architectures, and implementations , 2005, IEEE Design & Test of Computers.
[4] D. Marpe,et al. Video coding with H.264/AVC: tools, performance, and complexity , 2004, IEEE Circuits and Systems Magazine.
[5] Jean-Yves Le Boudec,et al. Network Calculus: A Theory of Deterministic Queuing Systems for the Internet , 2001 .
[6] Axel Jantsch,et al. TDM Virtual-Circuit Configuration for Network-on-Chip , 2008, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.
[7] Wenhua Dou,et al. Analysis of communication delay bounds for network on chips , 2009, 2009 Asia and South Pacific Design Automation Conference.
[8] Zhonghai Lu,et al. Feasibility analysis of messages for on-chip networks using wormhole routing , 2005, Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005..
[9] Anujan Varma,et al. Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[10] Tobias Bjerregaard,et al. A survey of research and practices of Network-on-chip , 2006, CSUR.