Optimal routing algorithms for mesh-connected processor arrays: Extended abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 319 LNCS, Issue , 1988, Pages 411-422

  Krizanc, Danny ^a   Rajasekaran, Sanguthevar ^a   Tsantilas, Thanasis ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY; QUEUEING THEORY; ROUTING ALGORITHMS; VLSI CIRCUITS;

CONSTANT-SIZE QUEUES; DETERMINISTIC ROUTING; EXTENDED ABSTRACTS; HIGH PROBABILITY; OBLIVIOUS ALGORITHMS; OPTIMAL ROUTING ALGORITHM; PARALLEL COMMUNICATION; VERTICAL DIRECTION;

COMPUTER ARCHITECTURE;

EID: 84990690765     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0040408     Document Type: Conference Paper

References (14)

1. K. E. BATCHER, Design of a Massively Parallel Processor, IEEE Trans. Comp., 29 (1980), pp. 836-840.
2. M. KUNDE, Optimal Sorting On Multi-Dimensionally Mesh-Connected Computers, STACS 1987, Lecture Notes in Computer Science 247, pp. 408-419, Springer-Verlag.
3. M. KUNDE, Routing and Sorting on Mesh-Connected Arrays, Aegean Workshop on Computing (AWOC 1988), to appear.
4. D. NASSIMI and S. SAHNI, An Optimal Routing Algorithm for Mesh-Connected Parallel Computers, J. ACM, 27 (1980) pp. 6-29.
5. S. E. ORCUTT, Implementation of Permutation Functions in Illiac IV-Type Computers, IEEE Trans. Comp., 25 (1976) pp. 929-936.
6. C. S. RAGHAVENDRA and V. K. P. KUMAR, Permutations on Illiac IV-Type Networks, IEEE Trans. Comp., 35 (1986) pp. 662-669.
7. S. RAJASEKARAN and TH. TSANTILAS, An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks, 7th Conference on Foundations of Software Technology and Theoretical Computer Science, Pune, India, Lecture Notes in Computer Science 287, pp. 226-241, Springer-Verlag.
8. C. P. SCHNORR and A. SHAMIR, An Optimal Sorting Algorithm for Mesh Connected Computers, In Proc. 18th ACM Symposium on Theory of Computing, 1986, pp. 255-263.
9. J. T. SCHWARTZ, Ultracomputers, ACM Trans. Prog. Lang. Syst., 2 (1980), pp. 484-521.
10. L. SNYDER, Supercomputers and VLSI: The Effect of Large-Scale Integration on Computer Architecture, in Advances in Computers, vol. 23 (1984), M. C. Yovits, ed., Academic Press, pp. 1-33.
11. C. D. THOMPSON and H. T. KUNG, Sorting on a Mesh-Connected Parallel Computer, Comm. ACM, 20 (1977) pp. 263-270.
12. L. G. VALIANT, A Scheme for Fast Parallel Communication, SIAM J. Comp. 11 (1982), pp. 350-361.
13. L. G. VALIANT, Parallel Computation, In Proc. 7th IBM Symposium on Mathematical Foundations of Computer Science, 1982, pp. 171-189. Also, Tech. Report TR-16-82, Aiken Computation Laboratory, Harvard University, Cambridge, Mass.
14. L. G. VALIANT and G. J. BREBNER, Universal Schemes for Parallel Communication, In Proc. 13th ACM Symposium on Theory of Computing, 1981, pp. 263-277.