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!
cited_by cdi_FETCH-LOGICAL-c290t-cb7a63a4a1cf8113134ddd48b482636098be4a3dc7dd7ecae10523315344c0093
cites cdi_FETCH-LOGICAL-c290t-cb7a63a4a1cf8113134ddd48b482636098be4a3dc7dd7ecae10523315344c0093
container_end_page
container_issue
container_start_page
container_title Journal of functional programming
container_volume 28
creator HINZE, RALF
MARTIN, CLARE
description 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.
doi_str_mv 10.1017/S0956796818000163
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2309687437</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cupid>10_1017_S0956796818000163</cupid><sourcerecordid>2309687437</sourcerecordid><originalsourceid>FETCH-LOGICAL-c290t-cb7a63a4a1cf8113134ddd48b482636098be4a3dc7dd7ecae10523315344c0093</originalsourceid><addsrcrecordid>eNp1kE9Lw0AQxRdRsFY_gLeABw8SnclsdjdHLf6Dggf1HDa705jaJnU3Vfz2prTgQTwNzPu9N8wT4hThEgH11TMUudKFMmgAABXtiRFKVaRa5bQvRhs53eiH4ijG-cCYLDcjcXFje_fG4Twmnfcpf3KbLDnUTVsnLfdfXXhPwrC1C_bH4mBmF5FPdnMsXu9uXyYP6fTp_nFyPU1dVkCfukpbRVZadDODSEjSey9NJU2mSEFhKpaWvNPea3aWEfKMCHOS0gEUNBZn29xV6D7WHPty3q1DO5wsM4LhBy1JDxRuKRe6GAPPylVoljZ8lwjlppPyTyeDh3Yeu6xC42v-jf7f9QN4FGE-</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2309687437</pqid></control><display><type>article</type><title>Batcher's odd-even merging network revealed</title><source>Cambridge Journals Online</source><creator>HINZE, RALF ; MARTIN, CLARE</creator><creatorcontrib>HINZE, RALF ; MARTIN, CLARE</creatorcontrib><description>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.</description><identifier>ISSN: 0956-7968</identifier><identifier>EISSN: 1469-7653</identifier><identifier>DOI: 10.1017/S0956796818000163</identifier><language>eng</language><publisher>Cambridge, UK: Cambridge University Press</publisher><subject>Classification ; Concurrency ; Functional Pearl ; Sorting algorithms</subject><ispartof>Journal of functional programming, 2018-01, Vol.28, Article e14</ispartof><rights>Copyright © Cambridge University Press 2018</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c290t-cb7a63a4a1cf8113134ddd48b482636098be4a3dc7dd7ecae10523315344c0093</citedby><cites>FETCH-LOGICAL-c290t-cb7a63a4a1cf8113134ddd48b482636098be4a3dc7dd7ecae10523315344c0093</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.cambridge.org/core/product/identifier/S0956796818000163/type/journal_article$$EHTML$$P50$$Gcambridge$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,72832</link.rule.ids></links><search><creatorcontrib>HINZE, RALF</creatorcontrib><creatorcontrib>MARTIN, CLARE</creatorcontrib><title>Batcher's odd-even merging network revealed</title><title>Journal of functional programming</title><addtitle>J. Funct. Prog</addtitle><description>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.</description><subject>Classification</subject><subject>Concurrency</subject><subject>Functional Pearl</subject><subject>Sorting algorithms</subject><issn>0956-7968</issn><issn>1469-7653</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNp1kE9Lw0AQxRdRsFY_gLeABw8SnclsdjdHLf6Dggf1HDa705jaJnU3Vfz2prTgQTwNzPu9N8wT4hThEgH11TMUudKFMmgAABXtiRFKVaRa5bQvRhs53eiH4ijG-cCYLDcjcXFje_fG4Twmnfcpf3KbLDnUTVsnLfdfXXhPwrC1C_bH4mBmF5FPdnMsXu9uXyYP6fTp_nFyPU1dVkCfukpbRVZadDODSEjSey9NJU2mSEFhKpaWvNPea3aWEfKMCHOS0gEUNBZn29xV6D7WHPty3q1DO5wsM4LhBy1JDxRuKRe6GAPPylVoljZ8lwjlppPyTyeDh3Yeu6xC42v-jf7f9QN4FGE-</recordid><startdate>20180101</startdate><enddate>20180101</enddate><creator>HINZE, RALF</creator><creator>MARTIN, CLARE</creator><general>Cambridge University Press</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>20180101</creationdate><title>Batcher's odd-even merging network revealed</title><author>HINZE, RALF ; MARTIN, CLARE</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c290t-cb7a63a4a1cf8113134ddd48b482636098be4a3dc7dd7ecae10523315344c0093</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Classification</topic><topic>Concurrency</topic><topic>Functional Pearl</topic><topic>Sorting algorithms</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>HINZE, RALF</creatorcontrib><creatorcontrib>MARTIN, CLARE</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Journal of functional programming</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>HINZE, RALF</au><au>MARTIN, CLARE</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Batcher's odd-even merging network revealed</atitle><jtitle>Journal of functional programming</jtitle><addtitle>J. Funct. Prog</addtitle><date>2018-01-01</date><risdate>2018</risdate><volume>28</volume><artnum>e14</artnum><issn>0956-7968</issn><eissn>1469-7653</eissn><abstract>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.</abstract><cop>Cambridge, UK</cop><pub>Cambridge University Press</pub><doi>10.1017/S0956796818000163</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0956-7968
ispartof Journal of functional programming, 2018-01, Vol.28, Article e14
issn 0956-7968
1469-7653
language eng
recordid cdi_proquest_journals_2309687437
source Cambridge Journals Online
subjects Classification
Concurrency
Functional Pearl
Sorting algorithms
title Batcher's odd-even merging network revealed
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T01%3A43%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Batcher's%20odd-even%20merging%20network%20revealed&rft.jtitle=Journal%20of%20functional%20programming&rft.au=HINZE,%20RALF&rft.date=2018-01-01&rft.volume=28&rft.artnum=e14&rft.issn=0956-7968&rft.eissn=1469-7653&rft_id=info:doi/10.1017/S0956796818000163&rft_dat=%3Cproquest_cross%3E2309687437%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c290t-cb7a63a4a1cf8113134ddd48b482636098be4a3dc7dd7ecae10523315344c0093%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2309687437&rft_id=info:pmid/&rft_cupid=10_1017_S0956796818000163&rfr_iscdi=true