Title :
Two packet routing algorithms on a mesh-connected computer
Author :
Gu, Qian-Ping ; Gu, Jun
Author_Institution :
Dept. of Comput. Sci., Aizu Univ., Fukoshima, Japan
fDate :
4/1/1995 12:00:00 AM
Abstract :
We give two algorithms for the 1-1 routing problems on a mesh-connected computer. The first algorithm, with queue size 28, solves the 1-1 routing problem on an n×n mesh-connected computer in 2n+O(1) steps. This improves the previous queue size of 75. The second algorithm solves the 1-1 routing problem in 2n-2 steps with queue size 12 ts/s where ts is the time for sorting an s×s mesh into a row major order for all s⩾1. This result improves the previous queue size 18.67 ts/s
Keywords :
computational complexity; packet switching; parallel algorithms; sorting; 1-1 routing problems; mesh-connected computer; packet routing algorithms; sorting; Algorithm design and analysis; Computational modeling; Concurrent computing; Costs; Hardware; Large-scale systems; Parallel algorithms; Routing; Sorting; Very large scale integration;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
