"Hypermeshes": Optical Interconnection Networks for Parallel Computing

Journal of Parallel and Distributed Computing

Volumn 26, Issue 1, 1995, Pages 1-23

  Szymanski, Ted ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002676486     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1995.1043     Document Type: Article

References (37)

1. Bhuyan, L. N., and Agrawal, D. P. Generalized hypercube and hyperbus structures for a computer network, IEEE Trans. Comput. C-33, 4 (Apr. 1984), 323-333.
2. Bhuyan, L. N., and Agrawal, D. P. Design and performance of generalized interconnection networks, IEEE Trans. Comput. C-32, 12 (Dec. 1983), 1081-1090.
3. Bermond, J. C., Bond, J., and Scale, J. F. Large hypergraphs of diameter 1. In B. Boltobas (Ed.). Graph Theory and Combinatorics. Academic Press, New York 1984.
4. Berge, C. Graphs and Hypergraphs. North-Holland, Amsterdam, 1973.
5. Dowd, P. Wavelength division multiple access channel hypercube processor interconnection, IEEE Trans. Comput. 41(10) (Oct. 1992), pp. 1223-1241.
6. Dally, W. J., and Sietz, C. L. Deadlock free message routing in multiprocessor interconnection networks. IEEE Trans. Comput. C-36, 5 (May 1987), 547-553.
7. Lawrie, D. H. Access and alignment of data in an array processor. IEEE Trans. Comput. (Dec. 1975), 1145-1155.
8. Lenfant, J. Parallel permutations of data: A Benes network control algorithm for frequently used permutations. IEEE Trans. Comput. C-27, 7 (July 1978), 637-647.
9. Memmi, G., and Raillard, Y. Some new results on the (d, k) graph problem. IEEE Trans. Comput. C-31, 8 (Aug. 1982), 784-791.
10. Parker, D. S. Notes on shuffle-exchange type switching networks. IEEE Trans. Comput. C-29, 3 (Mar. 1980), 213-222.
11. Pease, M. C. The indirect binary n-cube microprocessor array. IEEE Trans. Comput. C-26 (May 1977), 458-473.
12. Szymanski, T. H. A fiber-optic hypermesh“ for S1MD/MIMD machines. 1990 Supercomputing-90 Conference, New York, Nov. 1990, pp. 710-719.
13. Szymanski, T. H. (log N/log log N) Randomized Routing on De-gree-log N Hypermeshes, 1991 Int. Conference on Parallel Processing, Aug. 1991, pp. 443-450.
14. Szymanski, T. H. The complexity of FFT and related butterfly algorithms on meshes and hypermeshes. 1992 Int. Conference on Parallel Processing, August 1992.
15. Wittie, L. D. Communication structures for large networks of microcomputers. IEEE Trans. Comput. C-30, 4 (Apr. 1981), 264-273.
16. Preparata, F. P., and Vuillemen, J. The cube-connected cycles: A versatile network for parallel computation. Comm. ACM (May 1981), 300-309.
17. Scherson, I. Orthogonal graphs for a class of interconnection networks. IEEE Trans. Parallel Distribut. Systems 2, 1 (Jan. 1991), pp. 3-19.
18. Tanabe, N., Suzuoka, T., Nakamura, S., Kawakura, Y., and Oyanagi, S. Base-m n-cube: High-performance interconnection networks for highly parallel computer prodigy. 1991 Int. Conf. Parallel Processing, August 1991, pp. 509-516.
19. Thompson, C. D., and Rung, H. T. Sorting on a mesh connected processor array. Comm. ACM (1972), 263-271.
20. Kumar, V. K., and Raghavendra, C. S. Array processing with multiple broadcasting. J. Parallel Distribut. Comput. 4 (1987), 173-190.
21. Stout, Q. F. Mesh connected computers with broadcasting. IEEE Trans. Comput. (1983), 826-830.
22. Dowd, P. High performance interprocessor communication through optical wavelength division multiple access channels. 1991 Symp. on Computer Architecture, pp. 96-105.
23. Guo, Z., Melhem, R., Hall, R., Chiarulli D., and Levitan, S. Pipelined communications in optically interconnected arrays. J. Parallel Distribut. Comput. 12 (1991), 269-282.
24. Wailes, J., and Meyer, D. Multiple channel architecture: A new optical interconnection strategy for massively parallel computers. J. Lightwave Tech. 9, 12 (Dec. 1991), 1702-1716.
25. Wang, I., and Yun, D. Y. Y. A 2D reconfigurable array for efficient parallel computing. 1st IEEE Symposium on Parallel and Distributed Processing, Dallas, 1989, pp. 273-280.
26. Arthurs, E. Goodman, M.S. Kobrinski H. and Veechi, V.P. HY-PASS: An optoelectronic hybrid package switching system. IEEE J. on Select. Areas Comm., 6, 9 (Dec. 1988), 1500-1510.
27. Arthurs, E. et. al., Multiwavelength optical crossconnect for parallel-processing computers. Electron. Lett. 24, 2 (Jan. 1988), 119-120.
28. Pedrotti, P. et. al., 16 x 16 optical-fiber crossbar switch operating at 0.85 i, m. J. Lightwave Tech. 8, 9 (Sept. 1990), 1334-1342.
29. Leighton, F. T. Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes. Morgan-Kauffman, Los Altos, CA, 1992.
30. Kleinrock, L. Queueing Systems, Volume II. Wiley-Interscience, New York, 1976.
31. Stone, H. Parallel processing with the perfect shuffle. IEEE Trans. Comput. (Feb. 1971), 153-161.
32. Mackenzie, L. M., Ould-Khaoua, M., Sutherland, R. J., Kelly, T. Cobra: A high-performance interconnection for large multicomputers. Computing Science Research Report 1991/R19, University of Glasgow, Oct. 1991, pp. 1-21.
33. Valiant, L. G., and Brebner, G. J. Universal schemes for parallel communications. Proc. 13th Annual ACM Symp. on Theory of Computing, 1981, pp. 263-277.
34. Corbett, P. F., and Scherson, I. Sorting in mesh connected multiprocessors. IEEE Trans. Parallel Distribut. Systems 3, 5 (Sept. 1992), 622-625.
35. Abraham, S., and Padhmanabhan, K. Performance of multicomputer networks under pin-out constraints. J. Parallel Distribut. Corn-put. 12 (1992), 237-248.
36. Szymanski, T. Graph-theoretic models for photonic networks. In I. Scherson (Ed.). Proceedings of the New Frontiers: A Workshop on Future Directions of Massively Parallel Processing. IEEE Computer Society Press, Los Alamitas, CA, 1993, pp. 85-96.
37. Li, Y., Rao, S., Redmond, I., Wang, T., and Lohmann, A., Free space WDMA optical interconnects using mesh connected bus topology, Int. Conf. Optical Computing, 1994, pp WA2, 191-192.