Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
暂无分享,去创建一个
[1] Leslie G. Valiant,et al. A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..
[2] Wolfgang J. Paul,et al. An efficient general purpose parallel computer , 1981, STOC '81.
[3] Howard Jay Siegel,et al. Many SIMD interconnection networks have been proposed . To put the different approaches into perspective , this analysis compares a number of single-and multistage networks , 2022 .
[4] Sartaj Sahni,et al. Parallel Algorithms to Set Up the Benes Permutation Network , 1982, IEEE Transactions on Computers.
[5] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.
[6] Theodore R. Bashkow,et al. A large scale, homogeneous, fully distributed parallel machine, I , 1977, ISCA '77.
[7] Allan Borodin,et al. Routing, merging and sorting on parallel models of computation , 1982, STOC '82.
[8] Harold S. Stone,et al. Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.
[9] Romas Aleliunas,et al. Randomized parallel communication (Preliminary Version) , 1982, PODC '82.
[10] Leslie G. Valiant,et al. Universal schemes for parallel communication , 1981, STOC '81.
[11] Leslie G. Valiant,et al. A fast parallel algorithm for routing in permutation networks , 1981, IEEE Transactions on Computers.
[12] Franco P. Preparata,et al. The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).