Umessage transfer algorithms an the recursive diagonal torus

IEICE Transactions on Information and Systems

Volumn E79-D, Issue 2, 1996, Pages 107-116

  Yang, Yulu ^a   Amano, Hideharu ^a  

^a KEIO UNIVERSITY   (Japan)

Author keywords

Broadcast; Deadlock free; Interconnection network; Routing algorithm

Indexed keywords

ALGORITHMS; BROADCASTING; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; PARALLEL PROCESSING SYSTEMS;

DEADLOCK FREE; MESSAGE TRANSFER ALGORITHMS; RECURSIVE DIAGONAL TORUS; ROUTING ALGORITHM;

INTERCONNECTION NETWORKS;

EID: 0030081697     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. Paragon XP/S Product Overview, Intel Corp., 1991.
2. W.J. Dally, A. Chien, S. Fiske, W. Horwat, J. Kenn, M, Larivee, R. Lethin, P. Nuth, and S. Wills, The J-machine: a fine-grain concurrent computer, Proc. IFIP llth Computer Congress, pp. 1147-1153, Aug. 1989.
3. H. Ishihata, T. Horie, S. Inano, T. Shimizu, S. Kalo, and M. Ikesaka, Third generation message passing computer AP 1000, Proc. International Symposium on Supercomputing, pp.46-55, Nov. 1991.
4. L.M. Ni and P.K. McKinley, A survey of wormhole routing techniques in direct network, IEEE Computer, vol.26, pp.62-76, Feb. 1993.
5. M.R. Samatham and O.K. Pladhan, The De Bruijn multiprocessor network: versatile parallel processing and sorting network for VLSI, IEEE Trans. Comput., vol.38, no.4, pp.567-581, April 1989.
6. C.E. Leiserson, Fat-trees: universal networks for hardware-efficient supercomputing, IEEE Trans. Comput., vol.34, no.10, pp.892-901, Oct. 1985.
7. S.B. Akers, D. Harel, and B. Krishnamurthy, The star graph: an attractive alternative to the n-cube, Proc. ICPP '87, pp.393-400, Aug. 1987.
8. Y. Yang, H. Amano, H. Shibamura, and T. Sueyoshi, Recursive diagonal torus: an interconnection network for massively parallel computers, Proc. IEEE the 5th Symposium on Parallel and Distributed Processing, pp.591-594, Dec. 1993.
9. W.J. Dally and C.L. Seitz, Deadlock-free message routing in multiprocessor interconnection networks, IEEE Trans. Comput., vol.36, no.5, pp.547-553, May 1987.
10. K. Hiraki, H. Amano, M. Ruga, T. Sueyoshi, T. Kudoh, H. Nakashima, H. Nakajo, H. Matsuda, T. Matsumoto, and S. Mori, Overview of the JUMP-1, an MPP prototype for general-purpose parallel computations, Proc. of the 1994 International Symposium on Parallel Architectures Algorithms and Networks (ISPAN '94), pp.427-434, Dec. 1994.
11. Y. Yang, H. Amano, H. Shibamura, and T. Sueyoshi, RDT: an interconnection network for massively parallel computers, IEICE Trans., vol.J78-D-I, no.2, pp.118-128, Feb. 1995. (in Japanese)
12. Y. Yang and H. Amano, Message transfer algorithms on the recursive diagonal torus, Proc. of the 1994 International Symposium on Parallel Architectures Algorithms and Networks (ISPAN '94), pp.310-317, Dec. 1994.
13. Y. Yang, T. Kudoh, K. Nishimura, H. Nishi, and H. Amano, A study in mathematic definition and topology of the RDT interconnection network for massively parallel computers, IEICE Technical Report, WSIA-94-13 July 1994. (in Japanese)
14. T. Kudoh, H. Amano, T. Matsumoto, K. Hiraki, Y. Yang, K. Nishimura, K. Yoshimura, and Y. Fukushima, Hierarchical bit-map directory schemes on the RDT interconnection network for a massively parallel processor JUMP-1, Proc. ICPP'95, vol.1, pp.186-193, Aug. 1995.