Document Type
Report
Date
7-1991
Keywords
Parallel algorithms, Programming paradigms, Generic algorithms, Tuple multiplication, Matrix multiplication, All-pairs shortest paths
Language
English
Disciplines
Computer Sciences
Description/Abstract
This paper illustrates the benefits of developing generic algorithms for parallel programming paradigms which can be adapted to different applications. We consider a combinatorial problem called tuple multiplication. This paradigm includes matrix multiplication and the all-pairs shortest paths problem as special cases. We develop a generic pipeline for tuple multiplication. From the generic algorithm we derive pipelines for matrix multiplication and shortest paths computation by making substitutions of data types and functions. The performance of the matrix multiplication pipeline is analyzed and measured on a Computing Surface.
Recommended Citation
Hansen, Per Brinch, "A Generic Multiplication Pipeline" (1991). Electrical Engineering and Computer Science - Technical Reports. 111.
https://surface.syr.edu/eecs_techreports/111
Source
local
Additional Information
School of Computer and Information Science, Syracuse University, SU-CIS-91-21