ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 学術雑誌論文

A Practical Tree Contraction Algorithm for Parallel Skeletons on Trees of Unbounded Degree

http://hdl.handle.net/10173/1369
http://hdl.handle.net/10173/1369
4b3ede7a-a0d0-4e07-9824-ea589470760c
名前 / ファイル ライセンス アクション
27-26.pdf 27-26.pdf (218.3 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2016-03-25
タイトル
タイトル A Practical Tree Contraction Algorithm for Parallel Skeletons on Trees of Unbounded Degree
言語
言語 eng
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
著者 Morihata, Akimasa

× Morihata, Akimasa

Morihata, Akimasa

Search repository
Matsuzaki, Kiminori

× Matsuzaki, Kiminori

Matsuzaki, Kiminori

Search repository
抄録
内容記述タイプ Abstract
内容記述 Algorithmic skeletons are ready-made parallel computation patterns. Since each skeleton can be evaluated efficiently on parallel computation environments, we can develop effcient parallel programs only by specifying our computation by a combination of skeletons. Although effectiveness of algorithmic skeletons, especially those manipulating arrays and lists, is now well-recognized, those for trees of unbounded degree have not been firmly established. Most of the existing studies transform them to binary trees through preprocessing. But this approach is not practical. The transformation not only makes developments of parallel programs diffcult but also affects the performance of the parallel programs developed. In this paper, we propose a parallel tree contraction algorithm named Rake-Shunt contraction algorithm. It is generalization of the Shunt contraction algorithm, which has been used as the algorithmic basis of the binary-tree skeletons, and inherits several good properties such as scalability with respect to the number of processors and simplicity of the implementation. Moreover, it can deal with arbitrary trees and requires no modification of their shapes. Our preliminary experiments show that our algorithm leads to an implementation of the tree reduction, one of the most important tree skeletons, that is easier to use and more effcient than the previous method based on the transformation to binary trees.
書誌情報 Procedia Computer Science

巻 4, p. 7-16, 発行日 2011
DOI
関連タイプ isIdenticalTo
識別子タイプ DOI
関連識別子 10.1016/j.procs.2011.04.002
権利(URI)
権利情報 http://creativecommons.org/licenses/by-nc-nd/3.0/ | http://creativecommons.org/licenses/by-nc-nd/3.0/
著者版フラグ
出版タイプ VoR
出版タイプResource http://purl.org/coar/version/c_970fb48d4fbd8a85
出版者
出版者 Elsevier B.V.
戻る
0
views
See details
Views

Versions

Ver.1 2023-05-15 13:40:29.489116
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR 2.0
  • OAI-PMH JPCOAR 1.0
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3