An optimal randomized routing algorithm for the Mesh and a class of efficient Mesh-like routing networks: Extended abstract

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

Volumn 287 LNCS, Issue , 1987, Pages 226-241

  Rajasekaran, Sanguthevar ^a   Tsantilas, Thanasis ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GRAPHICS; MESH GENERATION; NETWORK ROUTING; PROBABILITY; QUEUEING THEORY; ROUTING ALGORITHMS; SOFTWARE ENGINEERING;

EXTENDED ABSTRACTS; HIGH PROBABILITY; OBLIVIOUS ROUTING; PARALLEL COMMUNICATION; PERMUTATION ROUTING; RANDOMIZED ALGORITHMS; RANDOMIZED ROUTING; ROUTING NETWORKS;

MESH NETWORKING;

EID: 84909777336     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-18625-5_53     Document Type: Conference Paper

References (12)

1. Lang, H. -W. et al., “Systolic Sorting on a Mesh Connected Network,” IEEE Transactions on Computers, volume c-34, no. 7, 1985.
2. Krizanc, D., Private Communication, 1986.
3. Kumar, M., and Hirschberg, D. S., “An Efficient Implementation of Batcher’s Odd-Even Merge Algorithm and its Application in Parallel Sorting Schemes,” IEEE Transactions on Computers, volume c-32, 1983.
4. Ma, Y., Sen, S., and Scherson, D., “The Distance Bound for Sorting on Mesh Connected Processor Arrays is Tight,” Proc. of the IEEE FOCS, 1986.
5. Nassimi, D., and Sahni, S., “Bitonic Sort on a Mesh Connected Parallel Computer,” IEEE Transactions on Computers, volume c-27, no. 1, 1979.
6. Nassimi, D., and Sahni, S., “Data Broadcasting in SIMD Computers,” IEEE Transactions on Computers, volume c-30, no. 2, 1981.
7. Pippenger, N., “Parallel Communication with Limited Buffers,” Proc. IEEE Symposium on FOCS, 1984, pp. 127–136.
8. Sado, K., and Igarishi, Y., “Some Parallel Sorts on a Mesh Connected Processor Array and their Time Efficiency,” to appear in Journal of Parallel and Distributed Computing, 1987.
9. Schnorr, C. P., and Shamir, A., “An Optimal Sorting Algorithm for Mesh Connected Computers,” Proc. of the ACM STOC, 1986.
10. Thompson, C. D., and Kung, H. T., “Sorting on a Mesh Connected Parallel Computer,” Communications of the ACM, volume 20, no. 4, 1977.
11. Thompson, C. D., “The VLSI Complexity of Sorting,” IEEE Transactions on Computers, volume c-32, no. 12, 1983.
12. Valiant, L. G., and Brebner, G. J., “Universal Schemes for Parallel Communication,” Proc. of the ACM STOC, 1981.