Periodic merging networks
Identifieur interne : 002761 ( Main/Exploration ); précédent : 002760; suivant : 002762Periodic merging networks
Auteurs : Mirosław Kutyłowski [Allemagne] ; Krzysztof Lory [Pologne, Allemagne] ; Brigitte Oesterdiekhoff [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1996.
Abstract
Abstract: We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcher's Odd-Even Merge and Bitonic Merge running in log(2n) time. Due to the obvious log n lower bound for the runtime, this is time-optimal. We present new merging networks that have a novel property of being periodic: for some (small) constant k, each processing unit of the network performs the same operations at steps t and t+tk (as long as t+k does not exceed the runtime.) The only operations executed are compare-exchange operations, just like in the case of the Batcher's networks. The architecture of the networks is very simple, easy to be laid out. The runtimes achieved are c · log n, for a small constant c.
Url:
DOI: 10.1007/BFb0009510
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001211
- to stream Istex, to step Curation: 001099
- to stream Istex, to step Checkpoint: 001035
- to stream Main, to step Merge: 002C35
- to stream Main, to step Curation: 002761
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Periodic merging networks</title><author><name sortKey="Kutylowski, Miroslaw" sort="Kutylowski, Miroslaw" uniqKey="Kutylowski M" first="Mirosław" last="Kutyłowski">Mirosław Kutyłowski</name></author><author><name sortKey="Lory, Krzysztof" sort="Lory, Krzysztof" uniqKey="Lory K" first="Krzysztof" last="Lory">Krzysztof Lory</name></author><author><name sortKey="Oesterdiekhoff, Brigitte" sort="Oesterdiekhoff, Brigitte" uniqKey="Oesterdiekhoff B" first="Brigitte" last="Oesterdiekhoff">Brigitte Oesterdiekhoff</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:957AC6C4A810F26B5A31B4BB26D97DD77D0FCD1B</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1007/BFb0009510</idno><idno type="url">https://api.istex.fr/document/957AC6C4A810F26B5A31B4BB26D97DD77D0FCD1B/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001211</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001211</idno><idno type="wicri:Area/Istex/Curation">001099</idno><idno type="wicri:Area/Istex/Checkpoint">001035</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001035</idno><idno type="wicri:doubleKey">0302-9743:1996:Kutylowski M:periodic:merging:networks</idno><idno type="wicri:Area/Main/Merge">002C35</idno><idno type="wicri:Area/Main/Curation">002761</idno><idno type="wicri:Area/Main/Exploration">002761</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Periodic merging networks</title><author><name sortKey="Kutylowski, Miroslaw" sort="Kutylowski, Miroslaw" uniqKey="Kutylowski M" first="Mirosław" last="Kutyłowski">Mirosław Kutyłowski</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Heinz Nixdorf Institute and Department of Mathematics & Computer Science, University of Paderborn, D-33095, Paderborn</wicri:regionArea><wicri:noRegion>33095, Paderborn</wicri:noRegion><wicri:noRegion>Paderborn</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Lory, Krzysztof" sort="Lory, Krzysztof" uniqKey="Lory K" first="Krzysztof" last="Lory">Krzysztof Lory</name><affiliation wicri:level="1"><country xml:lang="fr">Pologne</country><wicri:regionArea>Institute of Computer Science, University of Wrocław</wicri:regionArea><wicri:noRegion>University of Wrocław</wicri:noRegion></affiliation><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Dept. of Computer Science, University of Trier, D-54286, Trier</wicri:regionArea><orgName type="university">Université de Trèves</orgName><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Oesterdiekhoff, Brigitte" sort="Oesterdiekhoff, Brigitte" uniqKey="Oesterdiekhoff B" first="Brigitte" last="Oesterdiekhoff">Brigitte Oesterdiekhoff</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Heinz Nixdorf Institute and Department of Mathematics & Computer Science, University of Paderborn, D-33095, Paderborn</wicri:regionArea><wicri:noRegion>33095, Paderborn</wicri:noRegion><wicri:noRegion>Paderborn</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1996</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">957AC6C4A810F26B5A31B4BB26D97DD77D0FCD1B</idno><idno type="DOI">10.1007/BFb0009510</idno><idno type="ChapterID">35</idno><idno type="ChapterID">Chap35</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcher's Odd-Even Merge and Bitonic Merge running in log(2n) time. Due to the obvious log n lower bound for the runtime, this is time-optimal. We present new merging networks that have a novel property of being periodic: for some (small) constant k, each processing unit of the network performs the same operations at steps t and t+tk (as long as t+k does not exceed the runtime.) The only operations executed are compare-exchange operations, just like in the case of the Batcher's networks. The architecture of the networks is very simple, easy to be laid out. The runtimes achieved are c · log n, for a small constant c.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Pologne</li></country><region><li>Rhénanie-Palatinat</li></region><settlement><li>Trèves (Allemagne)</li></settlement><orgName><li>Université de Trèves</li></orgName></list><tree><country name="Allemagne"><noRegion><name sortKey="Kutylowski, Miroslaw" sort="Kutylowski, Miroslaw" uniqKey="Kutylowski M" first="Mirosław" last="Kutyłowski">Mirosław Kutyłowski</name></noRegion><name sortKey="Kutylowski, Miroslaw" sort="Kutylowski, Miroslaw" uniqKey="Kutylowski M" first="Mirosław" last="Kutyłowski">Mirosław Kutyłowski</name><name sortKey="Lory, Krzysztof" sort="Lory, Krzysztof" uniqKey="Lory K" first="Krzysztof" last="Lory">Krzysztof Lory</name><name sortKey="Lory, Krzysztof" sort="Lory, Krzysztof" uniqKey="Lory K" first="Krzysztof" last="Lory">Krzysztof Lory</name><name sortKey="Oesterdiekhoff, Brigitte" sort="Oesterdiekhoff, Brigitte" uniqKey="Oesterdiekhoff B" first="Brigitte" last="Oesterdiekhoff">Brigitte Oesterdiekhoff</name><name sortKey="Oesterdiekhoff, Brigitte" sort="Oesterdiekhoff, Brigitte" uniqKey="Oesterdiekhoff B" first="Brigitte" last="Oesterdiekhoff">Brigitte Oesterdiekhoff</name></country><country name="Pologne"><noRegion><name sortKey="Lory, Krzysztof" sort="Lory, Krzysztof" uniqKey="Lory K" first="Krzysztof" last="Lory">Krzysztof Lory</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002761 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002761 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:957AC6C4A810F26B5A31B4BB26D97DD77D0FCD1B
|texte= Periodic merging networks
}}
| This area was generated with Dilib version V0.6.31. |  |