Document Type

Report

Date

12-1991

Embargo Period

5-4-2012

Keywords

Parallel algorithms, Quicksort, Hypercube, Tree machine

Language

English

Disciplines

Computer Sciences

Description/Abstract

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.

Additional Information

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

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.