Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


Sample sort on meshes

Sibeyn, Jop F.

MPI-I-95-1-012. June 1995, 14 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
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.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-95-1-012.pdfMPI-I-95-1-012.pdfMPI-I-95-1-012.dvi.gz39 KBytes; 134 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Sibeyn, Jop F.},
  TITLE = {Sample sort on meshes},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-95-1-012},
  MONTH = {June},
  YEAR = {1995},
  ISSN = {0946-011X},