A Novel Routing Scheme on the Star and Pancake Networks and its Applications
暂无分享,去创建一个
Selim G. Akl | Ke Qiu | S. Akl | K. Qiu
[1] Sajal K. Das,et al. Parallel graph algorithms for hypercube computers , 1990, Parallel Comput..
[2] Ivan Stojmenovic,et al. Data communication and computational geometry on the star and pancake interconnection networks , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.
[3] Ke Qiu. The star and pancake interconnection networks: properties and algorithms , 1992 .
[4] Ellis Horowitz,et al. Fundamentals of Computer Algorithms , 1978 .
[5] Sheldon B. Akers,et al. The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.
[6] Sajal K. Das,et al. Two minimum spanning forest algorithms on fixed-size hypercube computers , 1990, Parallel Comput..
[7] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.
[8] 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).
[9] Selim G. Akl,et al. Parallel Minimum Spanning Forest Algorithms on the Star and Pancake Interconnection Networks , 1992, CONPAR.
[10] Sheldon B. Akers,et al. A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.