Asynchronous parallel disk sorting

Sanders, Peter; Dementiev, Roman

アイテム詳細

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

一時保存へ追加

このアイテムの新しいバージョンが利用可能です:
https://pure.mpg.de/pubman/item/item_1819260_4

詳細要約

公開

報告書

Asynchronous parallel disk sorting

MPS-Authors

/persons/resource/persons45344

Sanders, Peter
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44293

Dementiev, Roman
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.

フルテキスト (公開)

2003-1-001
(全文テキスト（全般）), 10KB

付随資料 (公開)

There is no public supplementary material available

引用

Sanders, P., & Dementiev, R.(2003). Asynchronous parallel disk sorting (MPI-I-2003-1-001). Saarbrücken: Max-Planck-Institut für Informatik.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-6C80-5

要旨

We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algorithms have either suboptimal I/O volume or cannot guarantee that I/O and computations can always be overlapped. We give an efficient implementation that can (at least) compete with the best practical implementations but gives additional performance guarantees. For the experiments we have configured a state of the art machine that can sustain full bandwidth I/O with eight disks and is very cost effective.