论文信息 - A comparison between hypercube and binary de Bruijin networks Ato Y. Arkaah - 字舞流文

A comparison between hypercube and binary de Bruijin networks Ato Y. Arkaah

Lehigh Preserve | Lehigh Preserve

[1] Sajal K. Das,et al. Parallel graph algorithms for hypercube computers , 1990, Parallel Comput..

[2] Sheldon B. Akers,et al. A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[3] C. Siva Ram Murthy,et al. Downloading node programs/data into hypercubes , 1991, Parallel Comput..

[4] Allan Gottlieb,et al. Highly parallel computing , 1989, Benjamin/Cummings Series in computer science and engineering.

[5] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[6] S. Lennart Johnsson,et al. Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[7] G. C. Fox,et al. Solving Problems on Concurrent Processors , 1988 .

[8] John N. Tsitsiklis,et al. Optimal Communication Algorithms for Hypercubes , 1991, J. Parallel Distributed Comput..

[9] Geoffrey C. Fox,et al. Hands-on parallel processing , 1989 .

[10] Quentin F. Stout,et al. Intensive Hypercube Communication. Prearranged Communication in Link-Bound Machines , 1990, J. Parallel Distributed Comput..

[11] Dhiraj K. Pradhan,et al. The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI , 1989, IEEE Trans. Computers.

[12] T.K. Hazra. Programming transputers , 1993, IEEE Potentials.

[13] Sudhakar Yalamanchili,et al. Adaptive routing protocols for hypercube interconnection networks , 1993, Computer.