Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Syracuse University

1991

Electrical Engineering and Computer Science - Technical Reports

Parallel algorithms

Articles 1 - 3 of 3

Full-Text Articles in Physical Sciences and Mathematics

Parallel Divide And Conquer, Per Brinch Hansen Dec 1991

Parallel Divide And Conquer, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

We develop a generic divide and conquer algorithm for a parallel tree machine. From the generic algorithm we derive balanced, parallel versions of quicksort and the fast Fourier transform by substitution of data types, variables and statements. The performance of these algorithms is analyzed and measured on a Computing Surface configured as a tree machine with distributed memory.


Do Hypercubes Sort Faster Than Tree Machines?, Per Brinch Hansen Dec 1991

Do Hypercubes Sort Faster Than Tree Machines?, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

We develop a balanced, parallel quicksort algorithm for a hypercube and compare it with a similar algorithm for a binary tree machine. The performance of the hypercube algorithm is measured on a Computing Surface.


A Generic Multiplication Pipeline, Per Brinch Hansen Jul 1991

A Generic Multiplication Pipeline, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

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.