Document Type

Report

Date

7-1991

Embargo Period

5-2-2012

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.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-91-21

Source

local

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.