On Dividing and Conquering Independently

Murray Cole

doi:10.1007/BFb0002794

On Dividing and Conquering Independently

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We suggest that the components of the well known divide-and-conquer paradigm can be profitably presented as independent constructs in a skeletal parallel programming model. We investigate this proposal through the expression of Batcher's bitonic sorting algorithm.

Original language	English
Title of host publication	Euro-Par'97 Parallel Processing
Subtitle of host publication	Third International Euro-Par Conference Passau, Germany, August 26–29, 1997 Proceedings
Place of Publication	London, UK, UK
Publisher	Springer
Pages	634-637
Number of pages	4
ISBN (Electronic)	3-540-63440-1
ISBN (Print)	978-3-540-63440-9
DOIs	https://doi.org/10.1007/BFb0002794
Publication status	Published - 1997

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Berlin Heidelberg
Volume	1300
ISSN (Print)	0302-9743

Access to Document

10.1007/BFb0002794

http://link.springer.com/chapter/10.1007%2FBFb0002794

Cite this

@inproceedings{55ba14d993bb49cfb48dc55fc42c0b96,

title = "On Dividing and Conquering Independently",

abstract = "We suggest that the components of the well known divide-and-conquer paradigm can be profitably presented as independent constructs in a skeletal parallel programming model. We investigate this proposal through the expression of Batcher's bitonic sorting algorithm.",

author = "Murray Cole",

year = "1997",

doi = "10.1007/BFb0002794",

language = "English",

isbn = "978-3-540-63440-9",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "634--637",

booktitle = "Euro-Par'97 Parallel Processing",

address = "United Kingdom",

}

TY - GEN

T1 - On Dividing and Conquering Independently

AU - Cole, Murray

PY - 1997

Y1 - 1997

N2 - We suggest that the components of the well known divide-and-conquer paradigm can be profitably presented as independent constructs in a skeletal parallel programming model. We investigate this proposal through the expression of Batcher's bitonic sorting algorithm.

AB - We suggest that the components of the well known divide-and-conquer paradigm can be profitably presented as independent constructs in a skeletal parallel programming model. We investigate this proposal through the expression of Batcher's bitonic sorting algorithm.

U2 - 10.1007/BFb0002794

DO - 10.1007/BFb0002794

M3 - Conference contribution

SN - 978-3-540-63440-9

T3 - Lecture Notes in Computer Science

SP - 634

EP - 637

BT - Euro-Par'97 Parallel Processing

PB - Springer

CY - London, UK, UK

ER -

On Dividing and Conquering Independently

Abstract

Publication series

Access to Document

Fingerprint

Cite this