Efficient Parallel Prefix Algorithms in the Multiport and Multiport Postal Models
碩士 === 國立臺灣科技大學 === 電子工程技術研究所 === 86 === Given n values v1, v2, ... , vn and an associative binary operation, denoted by o, the prefix problem is to compute the n prefixes v1 o v2 o ... o vi, 1 <= i <= n. We are interested in prefix computation on message-passing fully connected mu...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1998
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/17179015384029330309 |