hide
Free keywords:
-
Abstract:
This 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.
