An Analytical Model of Adaptive Wormhole Routing with Deadlock Recovery (Research Note)
暂无分享,去创建一个
This paper proposes a new analytical model to predict the mean message latency in k-ary n-cubes with Compressionless routing, a recovery-based fully-adaptive routing proposed by Kim et al [2].
[1] Wayne H. Wolf,et al. An Automaton Model for Scheduling Constraints in Synchronous Machines , 1995, IEEE Trans. Computers.
[2] Henk Tijms,et al. Stochastic modelling and analysis: a computational approach , 1986 .
[3] Andrew A. Chien,et al. Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing , 1997, IEEE Trans. Parallel Distributed Syst..
[4] Leonard Kleinrock,et al. Theory, Volume 1, Queueing Systems , 1975 .