An optimal routing algorithm for mesh-connected Parallel computers-Reference-Cited by-同舟云学术

An optimal routing algorithm for mesh-connected Parallel computers

Published:1980-01 Issue:1 Volume:27 Page:6-29
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Nassimi David¹,Sahni Sartaj²

Affiliation:

1. Department of Electrical Engineering and Computer Science, North-western University, Evanston, IL and University of Minnesota, Minneapolis, Minnesota

2. Department of Computer Science, 136 Lind Hall, 207 Church St SE, University of Minnesota, Minneapolis, MN

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference16 articles.

1. The ILLIAC IV Computer

2. BATCHER K E Sorting networks and their apphcauons Proc AFIPS 1968 SJCC Vol 32 AFIPS Press Montvale N J pp 307-314 BATCHER K E Sorting networks and their apphcauons Proc AFIPS 1968 SJCC Vol 32 AFIPS Press Montvale N J pp 307-314

3. BENES V E MathematzcaI Theory of Connecting Networks and Telephone Traffic Academic Press New York 1965 BENES V E MathematzcaI Theory of Connecting Networks and Telephone Traffic Academic Press New York 1965

4. Very h~gh-speed computing systems;FLYNN;Proc IEEE,1966

Cited by 72 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Banded Linear Systems;Parallelism in Matrix Computations;2015-07-26

2. An efficient method for representing and transmitting message patterns on multiprocessor interconnection networks;Fundamental Problems in Computing;2009

3. Permutation algorithms on optical multi-trees;Computers & Mathematics with Applications;2008-11

4. Summation and routing on a partitioned optical passive stars network with large group size;IEEE Transactions on Parallel and Distributed Systems;2003-12

5. Optimal processor mapping for linear-complement communication on hypercubes;IEEE Transactions on Parallel and Distributed Systems;2001-05