An Algebraic Theory for Formulating Parallel Prefix Algorithms

• Main Authors: Jei-Zhii Lee, 李介志
• Other Authors: Huang C.-H.
• Format: Others
• Language: en_US
• Published: 1999
• Online Access: http://ndltd.ncl.edu.tw/handle/19356118370395414703

碩士 === 國立東華大學 === 資訊工程學系 === 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 mapped into corresponding programming constructs. Hence, it provides a framework of designing and implementing parallel programs. In this paper, a parallel prefix algorithm is specified as a tensor product formula which is then translated into parallel programs for various computer architectures. These architectures may include vector processors, shared-memory multiprocessors, and distributed-memory multiprocessors.