Document Type

Report

Date

12-1991

Embargo Period

5-4-2012

Keywords

Parallel algorithms, Programming paradigms, Generic algorithms, Divide and conquer, Quicksort, Fast Fourier transform, Tree machine

Language

English

Disciplines

Computer Sciences

Description/Abstract

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.

Additional Information

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

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.