Batcher's odd-even merging network revealed

Comparison networks offer an attractive framework for studying parallel sorting algorithms. The visual presentation of such hard-wired networks makes processes easy to conceptualize without the overhead of programming syntax or the semantic complications of concurrency. Though simple in appearance t...

Full description

Saved in:
Bibliographic Details
Published in:Journal of functional programming 2018-01, Vol.28, Article e14
Main Authors: HINZE, RALF, MARTIN, CLARE
Format: Article
Language:English
Subjects:
Classification
Concurrency
Functional Pearl
Sorting algorithms
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Comparison networks offer an attractive framework for studying parallel sorting algorithms. The visual presentation of such hard-wired networks makes processes easy to conceptualize without the overhead of programming syntax or the semantic complications of concurrency. Though simple in appearance they have a surprisingly rich structure. In this pearl we delve a little into their theory.
ISSN:0956-7968
1469-7653
DOI:10.1017/S0956796818000163