Performance of a Class of Highly-Parallel Divide-and-Conquer Algorithms

Thornley, John (1995) Performance of a Class of Highly-Parallel Divide-and-Conquer Algorithms. Technical Report. California Institute of Technology. [CaltechCSTR:1995.cs-tr-95-10]

Full text available as:

	Postscript - Requires a viewer, such as GhostView
	Other (Adobe PDF (362KB))

Abstract

A wide range of important problems have efficient methods of solution based on the divide-and-conquer strategy. However, the traditional approach to parallel divide-and-conquer does not scale well due to the sequential component of the algorithms. We investigate the performance of a non-traditional, highly-parallel divide-and-conquer strategy that we refer to as "one-deep parallel divide-and-conquer". As representative examples, we measure and analyze the performance of highly-parallel variants of the quicksort and mergesort algorithms on a shared-memory multiprocessor. Both algorithms deliver impressive speedups. We present a systematic approach to modeling the performance of one-deep parallel divide-and-conquer algorithms and we demonstrate this approach with the two parallel sorting algorithms.

EPrint Type:	Monograph (Technical Report)
Subjects:	All Records
ID Code:	239
Deposited By:	Caltech Library System
Deposited On:	14 May 2001
Record Number:	CaltechCSTR:1995.cs-tr-95-10
Official Persistent URL:	http://resolver.caltech.edu/CaltechCSTR:1995.cs-tr-95-10
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.

Archive Staff Only: edit this record