Gossiping Large Packets on Full-Port Tori

Meyer, Ulrich; Sibeyn, Jop F.

アイテム詳細

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

一時保存へ追加

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

公開

会議論文

Gossiping Large Packets on Full-Port Tori

MPS-Authors

/persons/resource/persons45038

Meyer, Ulrich
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Sibeyn, Jop F.
Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

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

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Meyer, U., & Sibeyn, J. F. (1998). Gossiping Large Packets on Full-Port Tori. In D., Pritchard, & J., Reeve (Eds.), Proceedings of the 4th International Euro-Par Conference (Euro-Par-98) (pp. 1040-1046). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-3797-E

要旨

Near-optimal gossiping algorithms are given for two- and higher dimensional tori. It is assumed that the amount of data each PU is contributing is so large, that start-up time may be neglected. For two-dimensional tori, an earlier algorithm achieved optimality in an intricate way, with a time-dependent routing pattern. In our algorithms, in all steps, the PUs forward the received packets in the same way.