A Programming Methodology for Designing Block Recursive Algorithms on Various Computer Networks

In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms on various computer networks. In our previous works, we propose a programming methodology for designing block recursive algorithms on sharedmemory and distributed-memory multiprocessors without considering the interconnection of processors. We extend the work to consider the block recursive algorithms on direct networks and multistage interconnection networks. We use parallel prefix computation as an example to illustrate the methodology. First, we represent the prefix computation problem as a computational matrix which may not be suitable for deriving algorithms on specific computer networks. In this methodology, we add two steps to derive tensor product formulas of parallel prefix algorithms on computer networks: (1) decompose the computational matrix into two submatrices, and (2) construct an augmented matrix. The augmented matrix can be facto...

• Type: Conference
• Year: 2002
• Where: ICPPW
• Authors: Min-Hsuan Fan, Chua-Huang Huang, Yeh-Ching Chung
• Keywords: Block Recursive Algorithms, ICPPW 2002, Tensor Product, Tensor Product Formulas