IEEE Transactions on Parallel and Distributed Systems, 2000, 11(7):729-738. The odd-even turn model for adaptive routing. IEEE Transactions on Parallel and Distributed Systems, 2014, 25(8):1935-1944. A decision procedure for deadlock-free routing in wormhole networks. San Francisco, USA:Morgan Kaufmann, 2002. Interconnection networks:An engineering approach. San Francisco, USA:Morgan Kaufmann, 2003. Principles and practices of interconnection networks. Blue gene:A vision for protein science using a petaflop supercomputer. Deadlock-free adaptive routing in meshes based on cost-effective deadlock avoidance schemes//Proceedings of International Conference on Parallel Processing. Computationally efficient locality-aware interconnection topology for multi-processor system-on-chip (MP-SoC). IEEE Transactions on Dependable and Secure Computing, 2011, 8(1):74-88. Deadlock-free adaptive routing in meshes with fault-tolerance ability based on channel overlapping. A survey on architecture for three-dimensional networks-on-chip. A low-radix and low-diameter 3D interconnection network design//Proceedings of the 15th International Symposium on High Performance Computer Architecture. Keywords turn model virtual cut-through switching 2-D mesh deadlock-free partially adaptive routing Therefore, this column-partition turn model improves the performance of the whole network. Simulations show that this routing algorithm reduces the average latency and increases the saturation points compared to routing algorithms based on the odd-even turn model for various traffic patterns. This algorithm avoids deadlocks by restricting the locations for certain turns, which is similar to the odd-even turn method. Then, a column-partition turn model is given to implement deadlock-free minimal partially adaptive routing for a virtual cut-through (VCT)-switched 2-D mesh without extra virtual channels. This paper gives a proof of the algorithm's correctness. This paper presents a simple, intuitive algorithm to determine whether the routing algorithm is deadlock-free. Abstract Existing methods cannot easily determine whether a routing algorithm for a network-on-chip contains a deadlock and the traditional turn model has serious limitations.
0 Comments
Leave a Reply. |