Document Type

Report

Date

7-1989

Embargo Period

4-30-2012

Keywords

Parallel mergesort, Multiprocessor algorithm, Performance analysis, Communication time, Decomposition time

Language

English

Disciplines

Computer Sciences

Description/Abstract

The paper describes a performance model of a fine-grained, parallel mergesort which sorts N elements in 0(N) time using 0(logN) processors. The model predicts both the communication time involved in merging the elements and the decomposition time required to activate and terminate the binary tree of processes. The parallel algorithm is written in Joyce and runs on an Encore Multimax.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-89-03

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.