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
Michael Kaufmann, Sanguthevar Rajasekaran, Jop F.