Matching the Bisection Bound for Routing and Sorting on the Mesh

d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh connected processor array. In these three problems, each processor is assumed to contain k packets at the beginning and k packets are destined for any proces

• Type: Conference
• Year: 1992
• Where: SPAA
• Authors: Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn
• Keywords: Distributed And Parallel Computing, Mesh Connected Processor, Rajasekaran Jop F, Randomized Algorithms, SPAA 1992