|
[1] C. E. Leiserson, “Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing,” IEEE Transactions on Computers, vol. 34, no.10, October 1985, pp. 892-901. [2] F. Petrini and M. Vanneschi, “k-ary n-trees: High Performance Networks for Massively Parallel Architectures,” in Proceedings of the 11th International Parallel Processing Symposium, IPPS’97, April 1997, pp. 87-93. [3] InfiniBand. Trade Association, InfiniBand. Architecture Specification Volume 1, Release 1.1, November 2002. [4] InfiniBand. Trade Association, http://www.infinibandta.com. [5] C. E. Leiserson et al., “The Network Architecture of the Connection Machine CM-5,” in Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, June 1992, pp. 272-285. [6] H. L. Muller, P. W. A. Stallard, and D. H. D. Warren, “An evaluation Study of a Link-Based Data Diffusion Machine,” in Proceedings of the 98th International Parallel Processing Symposium, IPPS’94, (Cancun, Mexico), April 1994, pp.115-128. [7] Meiko World Incorporated, Computing Surface 2 reference manuals, preliminary edition, 1993. [8] C. E. Leiserson and B.M. Maggs, “Communication-Efficient Parallel Algorithms for Distributed Random Access Machines,” Algorithmica, vol. 3, 1988, pp.53-77.
|