Add to ORKGThis paper provides an overview of lower and upper bounds for mesh-connected processor networks. Most attention goes to routing and sorting problems, but other problems are mentioned as well. Results from 1977 to 1995 are covered. We provide numerous results, references and open problems. The text is completed with an index. This is a worked-out version of the author's contribution to a joint paper with Grammatikakis, Hsu and Kraetzl on multicomputer routing, submitted to JPDC
Mesh connected computers have become attractive models of computing because of their varied special ...
Abstract. We present algorithms for sorting and routing on two-dimen-sional mesh-connected parallel ...
We show that sorting an input of size N = 0 2 can be performed by an 0 X 0 mesh-connected processor ...
This paper provides an overview of lower and upper bounds for mesh-connected processor networks. Mos...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1992. Simultaneously published...
. We present sorting algorithms on the recently introduced multi-mesh, a network consisting of n 2 ...
Sorting on interconnection networks has been solved `optimally'. However, the `lower-order' terms ...
In all recent near-optimal sorting algorithms for meshes, the packets are sorted with respect to som...
In this paper we present randomized algorithms for k \Gamma k routing, k \Gamma k sorting, and cut ...
In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing ...
We show that sorting an input of size N = n superscript 2 can be performed by an n X n mesh-connect...
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional n...
In all recent near-optimal sorting algorithms for meshes, the packets are sorted with respect to...
This paper provides an overview of lower and upper bounds for algorithms for mesh-connected processo...
. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architect...
Mesh connected computers have become attractive models of computing because of their varied special ...
Abstract. We present algorithms for sorting and routing on two-dimen-sional mesh-connected parallel ...
We show that sorting an input of size N = 0 2 can be performed by an 0 X 0 mesh-connected processor ...
This paper provides an overview of lower and upper bounds for mesh-connected processor networks. Mos...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1992. Simultaneously published...
. We present sorting algorithms on the recently introduced multi-mesh, a network consisting of n 2 ...
Sorting on interconnection networks has been solved `optimally'. However, the `lower-order' terms ...
In all recent near-optimal sorting algorithms for meshes, the packets are sorted with respect to som...
In this paper we present randomized algorithms for k \Gamma k routing, k \Gamma k sorting, and cut ...
In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing ...
We show that sorting an input of size N = n superscript 2 can be performed by an n X n mesh-connect...
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional n...
In all recent near-optimal sorting algorithms for meshes, the packets are sorted with respect to...
This paper provides an overview of lower and upper bounds for algorithms for mesh-connected processo...
. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architect...
Mesh connected computers have become attractive models of computing because of their varied special ...
Abstract. We present algorithms for sorting and routing on two-dimen-sional mesh-connected parallel ...
We show that sorting an input of size N = 0 2 can be performed by an 0 X 0 mesh-connected processor ...