Constants in parallel sorting:
Abstract: "The constant factors in the time complexity of three parallel mergesort variants, running on a EREW PRAM, are analysed under a simple cost model. The algorithms studied are linear-time mergesort, odd- even mergesort and polylogarithmic mergesort. The processors of a PRAM are assumed...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
København
1995
|
| Schriftenreihe: | Datalogisk Institut <København>: DIKU-Rapport
1995,27 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The constant factors in the time complexity of three parallel mergesort variants, running on a EREW PRAM, are analysed under a simple cost model. The algorithms studied are linear-time mergesort, odd- even mergesort and polylogarithmic mergesort. The processors of a PRAM are assumed to be word-addressable machines that can execute three-address instructions of our hypothetical assembly language in unit time. For the sake of comparison, sequential quicksort, heapsort and mergesort are examined within the same framework. The number of operations performed by linear-time mergesort, i.e. its work, is at most four times the time required by sequential mergesort. The work of polylogarithmic mergesort is about twenty times that of sequential mergesort. Morever, polylogarithmic mergesort seems to perform relatively well compared to odd-even mergesort, but there are still place [sic] for improvements." |
| Beschreibung: | 10 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011046412 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961108s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)38525429 | ||
| 035 | |a (DE-599)BVBBV011046412 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Katajainen, Jyrki |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Constants in parallel sorting |c Jyrki Katajainen |
| 264 | 1 | |a København |c 1995 | |
| 300 | |a 10 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1995,27 | |
| 520 | 3 | |a Abstract: "The constant factors in the time complexity of three parallel mergesort variants, running on a EREW PRAM, are analysed under a simple cost model. The algorithms studied are linear-time mergesort, odd- even mergesort and polylogarithmic mergesort. The processors of a PRAM are assumed to be word-addressable machines that can execute three-address instructions of our hypothetical assembly language in unit time. For the sake of comparison, sequential quicksort, heapsort and mergesort are examined within the same framework. The number of operations performed by linear-time mergesort, i.e. its work, is at most four times the time required by sequential mergesort. The work of polylogarithmic mergesort is about twenty times that of sequential mergesort. Morever, polylogarithmic mergesort seems to perform relatively well compared to odd-even mergesort, but there are still place [sic] for improvements." | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 4 | |a Sorting (Electronic computers) | |
| 830 | 0 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1995,27 |w (DE-604)BV010011493 |9 1995,27 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007397347 | ||
Datensatz im Suchindex
| _version_ | 1804125536175259648 |
|---|---|
| any_adam_object | |
| author | Katajainen, Jyrki |
| author_facet | Katajainen, Jyrki |
| author_role | aut |
| author_sort | Katajainen, Jyrki |
| author_variant | j k jk |
| building | Verbundindex |
| bvnumber | BV011046412 |
| ctrlnum | (OCoLC)38525429 (DE-599)BVBBV011046412 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01878nam a2200313 cb4500</leader><controlfield tag="001">BV011046412</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961108s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38525429</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011046412</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Katajainen, Jyrki</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Constants in parallel sorting</subfield><subfield code="c">Jyrki Katajainen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">København</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1995,27</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The constant factors in the time complexity of three parallel mergesort variants, running on a EREW PRAM, are analysed under a simple cost model. The algorithms studied are linear-time mergesort, odd- even mergesort and polylogarithmic mergesort. The processors of a PRAM are assumed to be word-addressable machines that can execute three-address instructions of our hypothetical assembly language in unit time. For the sake of comparison, sequential quicksort, heapsort and mergesort are examined within the same framework. The number of operations performed by linear-time mergesort, i.e. its work, is at most four times the time required by sequential mergesort. The work of polylogarithmic mergesort is about twenty times that of sequential mergesort. Morever, polylogarithmic mergesort seems to perform relatively well compared to odd-even mergesort, but there are still place [sic] for improvements."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sorting (Electronic computers)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1995,27</subfield><subfield code="w">(DE-604)BV010011493</subfield><subfield code="9">1995,27</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007397347</subfield></datafield></record></collection> |
| id | DE-604.BV011046412 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:07Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007397347 |
| oclc_num | 38525429 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 10 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series | Datalogisk Institut <København>: DIKU-Rapport |
| series2 | Datalogisk Institut <København>: DIKU-Rapport |
| spelling | Katajainen, Jyrki Verfasser aut Constants in parallel sorting Jyrki Katajainen København 1995 10 S. txt rdacontent n rdamedia nc rdacarrier Datalogisk Institut <København>: DIKU-Rapport 1995,27 Abstract: "The constant factors in the time complexity of three parallel mergesort variants, running on a EREW PRAM, are analysed under a simple cost model. The algorithms studied are linear-time mergesort, odd- even mergesort and polylogarithmic mergesort. The processors of a PRAM are assumed to be word-addressable machines that can execute three-address instructions of our hypothetical assembly language in unit time. For the sake of comparison, sequential quicksort, heapsort and mergesort are examined within the same framework. The number of operations performed by linear-time mergesort, i.e. its work, is at most four times the time required by sequential mergesort. The work of polylogarithmic mergesort is about twenty times that of sequential mergesort. Morever, polylogarithmic mergesort seems to perform relatively well compared to odd-even mergesort, but there are still place [sic] for improvements." Computer algorithms Parallel processing (Electronic computers) Sorting (Electronic computers) Datalogisk Institut <København>: DIKU-Rapport 1995,27 (DE-604)BV010011493 1995,27 |
| spellingShingle | Katajainen, Jyrki Constants in parallel sorting Datalogisk Institut <København>: DIKU-Rapport Computer algorithms Parallel processing (Electronic computers) Sorting (Electronic computers) |
| title | Constants in parallel sorting |
| title_auth | Constants in parallel sorting |
| title_exact_search | Constants in parallel sorting |
| title_full | Constants in parallel sorting Jyrki Katajainen |
| title_fullStr | Constants in parallel sorting Jyrki Katajainen |
| title_full_unstemmed | Constants in parallel sorting Jyrki Katajainen |
| title_short | Constants in parallel sorting |
| title_sort | constants in parallel sorting |
| topic | Computer algorithms Parallel processing (Electronic computers) Sorting (Electronic computers) |
| topic_facet | Computer algorithms Parallel processing (Electronic computers) Sorting (Electronic computers) |
| volume_link | (DE-604)BV010011493 |
| work_keys_str_mv | AT katajainenjyrki constantsinparallelsorting |