Parallel Algorithms to Set Up the Benes Permutation Network
暂无分享,去创建一个
[1] Michael J. Flynn,et al. Very high-speed computing systems , 1966 .
[2] Karl N. Levitt,et al. A study of the data commutation problems in a self-repairable multiprocessor , 1899, AFIPS '68 (Spring).
[3] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.
[4] Abraham Waksman,et al. A Permutation Network , 1968, JACM.
[5] Harold S. Stone,et al. Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.
[6] D. C. Opferman,et al. On a class of rearrangeable switching networks part I: Control algorithm , 1971 .
[7] H. T. Kung,et al. Sorting on a mesh-connected parallel computer , 1977, CACM.
[8] Clark D. Thomborson,et al. Generalized Connection Networks for Parallel Processor Intercommunication , 1978, IEEE Trans. Computers.
[9] Sartaj Sahni,et al. Bitonic Sort on a Mesh-Connected Parallel Computer , 1979, IEEE Transactions on Computers.
[10] Howard Jay Siegel,et al. A Model of SIMD Machines and a Comparison of Various Interconnection Networks , 1979, IEEE Transactions on Computers.
[11] Sartaj Sahni,et al. Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer , 1980, SIAM J. Comput..
[12] Sartaj Sahni,et al. Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.
[13] David Stevenson,et al. The Phoenix Project , 1981, CARN.
[14] Leslie G. Valiant,et al. A fast parallel algorithm for routing in permutation networks , 1981, IEEE Transactions on Computers.
[15] Sartaj Sahni,et al. A Self-Routing Benes Network and Parallel Permutation Algorithms , 1981, IEEE Transactions on Computers.
[16] Sartaj Sahni,et al. Optimal BPC Permutations on a Cube Connected SIMD Computer , 1982, IEEE Transactions on Computers.
[17] Sartaj Sahni,et al. Parallel permutation and sorting algorithms and a new generalized connection network , 1982, JACM.