Sample sort on meshes

Sibeyn, Jop Frederic

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

報告書

Sample sort on meshes

MPS-Authors

/persons/resource/persons45478

Sibeyn, Jop Frederic
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

MPI-I-95-1-012.pdf
(全文テキスト（全般）), 134KB

付随資料 (公開)

There is no public supplementary material available

引用

Sibeyn, J. F.(1995). Sample sort on meshes (MPI-I-1995-1-012). Saarbrücken: Max-Planck-Institut für Informatik.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-A708-A

要旨

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.