An Algebraic Theory for Formulating Parallel Prefix Algorithms
碩士 === 國立東華大學 === 資訊工程學系 === 87 === We employ a methodology to solving parallel prefix problems by using a tensor product notation. Tensor product notation is suitable to express block-recursive algorithms, data distribution, and interconnection networks. Tensor product operations can be...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
1999
|
Online Access: | http://ndltd.ncl.edu.tw/handle/19356118370395414703 |