| Collective communication in wormhole-routed massively parallel computers | |
|---|---|
| 學年 | 84 |
| 學期 | 1 |
| 出版（發表）日期 | 1995-12-01 |
| 作品名稱 | Collective communication in wormhole-routed massively parallel computers |
| 作品名稱（其他語言） | |
| 著者 | McKinley, P. K.; Tsai, Yih-Jia; Robinson, D. F. |
| 單位 | 淡江大學資訊工程學系 |
| 出版者 | New York: Institute of Electrical and Electronics Engineers |
| 著錄名稱、卷期、頁數 | Computer 28(12), pp.39-50 |
| 摘要 | Most MPC networks use wormhole routing to reduce the effect of path length on communication time. Researchers have exploited this by designing ingenious algorithms to speed collective communication. Many projects have addressed the design of efficient collective communication algorithms for wormhole-routed systems. By exploiting the relative distance-insensitivity of wormhole routing, these new algorithms often differ fundamentally from their store-and-forward counterparts. We examine software and hardware approaches to implementing collective communication operations. Although we emphasize methods in which the underlying architecture is a direct network, such as a hypercube or mesh, as opposed to an indirect switch-based network, several approaches apply to systems of either type. We illustrate several issues arising in this research area and describe the major classes of algorithms proposed to solve these problems. |
| 關鍵字 | |
| 語言 | en |
| ISSN | 0018-9162 |
| 期刊性質 | |
| 收錄於 | |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | |
| 國別 | USA |
| 公開徵稿 | |
| 出版型式 | |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/71276 ) |
GoogleAnalytics