Improved Parallel Prefix on the Multicomputer
碩士 === 國立臺灣科技大學 === 資訊工程系 === 97 === Give n values x1, x2,…, xn and an associative binary operation ♁, the prefix computation is to compute x1 ♁ x2 ♁…♁ xi, 1 ≤ i ≤ n. Because prefix computation has many applications, a large number of algorithms, called parallel prefix algorithms, have been develope...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/85524845863607435071 |