ausblenden:
Schlagwörter:
-
Zusammenfassung:
This paper provides an overview of lower and upper bounds for
algorithms for mesh-connected processor networks. Most of our
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 Miltos D. Grammatikakis, D. Frank Hsu and
Miro Kraetzl on multicomputer routing, submitted to the Journal
of Parallel and Distributed Computing.
