Time-space optimal parallel merging and sorting:
Abstract: "A parallel algorithm is time-space optimal if it achieves optimal speedup and if it uses only a constant amount of extra space per processor even when the number of processors is fixed. Previously published parallel merging and sorting algorithms fail to meet at least one of these cr...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Knoxville, TN
1990
|
| Schriftenreihe: | University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS
1990,102 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "A parallel algorithm is time-space optimal if it achieves optimal speedup and if it uses only a constant amount of extra space per processor even when the number of processors is fixed. Previously published parallel merging and sorting algorithms fail to meet at least one of these criteria. In this paper, we present a parallel merging algorithm that, on an EREW PRAM with k processors, merges two sorted lists of total length n in O(n/k + log n). We also describe a stable version of our parallel merging algorithm that is similarly time- space optimal on an EREW PRAM. These two parallel merges naturally lead to time-space optimal parallel sorting algorithms." |
| Beschreibung: | 27 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009225175 | ||
| 003 | DE-604 | ||
| 005 | 19960215 | ||
| 007 | t | ||
| 008 | 940313s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24652181 | ||
| 035 | |a (DE-599)BVBBV009225175 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Guan, Xiaojun |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Time-space optimal parallel merging and sorting |c Xiaojun Guan and Michael A. Langston |
| 264 | 1 | |a Knoxville, TN |c 1990 | |
| 300 | |a 27 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS |v 1990,102 | |
| 520 | 3 | |a Abstract: "A parallel algorithm is time-space optimal if it achieves optimal speedup and if it uses only a constant amount of extra space per processor even when the number of processors is fixed. Previously published parallel merging and sorting algorithms fail to meet at least one of these criteria. In this paper, we present a parallel merging algorithm that, on an EREW PRAM with k processors, merges two sorted lists of total length n in O(n/k + log n). We also describe a stable version of our parallel merging algorithm that is similarly time- space optimal on an EREW PRAM. These two parallel merges naturally lead to time-space optimal parallel sorting algorithms." | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 700 | 1 | |a Langston, Michael A. |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: CS |t University of Tennessee <Knoxville, Tenn.> |v 1990,102 |w (DE-604)BV008903301 |9 1990,102 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006134284 | ||
Datensatz im Suchindex
| _version_ | 1804123668320616448 |
|---|---|
| any_adam_object | |
| author | Guan, Xiaojun Langston, Michael A. |
| author_facet | Guan, Xiaojun Langston, Michael A. |
| author_role | aut aut |
| author_sort | Guan, Xiaojun |
| author_variant | x g xg m a l ma mal |
| building | Verbundindex |
| bvnumber | BV009225175 |
| ctrlnum | (OCoLC)24652181 (DE-599)BVBBV009225175 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01732nam a2200313 cb4500</leader><controlfield tag="001">BV009225175</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960215 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24652181</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009225175</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Guan, Xiaojun</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Time-space optimal parallel merging and sorting</subfield><subfield code="c">Xiaojun Guan and Michael A. Langston</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Knoxville, TN</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">27 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">University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS</subfield><subfield code="v">1990,102</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A parallel algorithm is time-space optimal if it achieves optimal speedup and if it uses only a constant amount of extra space per processor even when the number of processors is fixed. Previously published parallel merging and sorting algorithms fail to meet at least one of these criteria. In this paper, we present a parallel merging algorithm that, on an EREW PRAM with k processors, merges two sorted lists of total length n in O(n/k + log n). We also describe a stable version of our parallel merging algorithm that is similarly time- space optimal on an EREW PRAM. These two parallel merges naturally lead to time-space optimal parallel sorting algorithms."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Langston, Michael A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: CS</subfield><subfield code="t">University of Tennessee <Knoxville, Tenn.></subfield><subfield code="v">1990,102</subfield><subfield code="w">(DE-604)BV008903301</subfield><subfield code="9">1990,102</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006134284</subfield></datafield></record></collection> |
| id | DE-604.BV009225175 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:26Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006134284 |
| oclc_num | 24652181 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 27 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS |
| spelling | Guan, Xiaojun Verfasser aut Time-space optimal parallel merging and sorting Xiaojun Guan and Michael A. Langston Knoxville, TN 1990 27 S. txt rdacontent n rdamedia nc rdacarrier University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS 1990,102 Abstract: "A parallel algorithm is time-space optimal if it achieves optimal speedup and if it uses only a constant amount of extra space per processor even when the number of processors is fixed. Previously published parallel merging and sorting algorithms fail to meet at least one of these criteria. In this paper, we present a parallel merging algorithm that, on an EREW PRAM with k processors, merges two sorted lists of total length n in O(n/k + log n). We also describe a stable version of our parallel merging algorithm that is similarly time- space optimal on an EREW PRAM. These two parallel merges naturally lead to time-space optimal parallel sorting algorithms." Algorithms Parallel processing (Electronic computers) Langston, Michael A. Verfasser aut Computer Science Department: CS University of Tennessee <Knoxville, Tenn.> 1990,102 (DE-604)BV008903301 1990,102 |
| spellingShingle | Guan, Xiaojun Langston, Michael A. Time-space optimal parallel merging and sorting Algorithms Parallel processing (Electronic computers) |
| title | Time-space optimal parallel merging and sorting |
| title_auth | Time-space optimal parallel merging and sorting |
| title_exact_search | Time-space optimal parallel merging and sorting |
| title_full | Time-space optimal parallel merging and sorting Xiaojun Guan and Michael A. Langston |
| title_fullStr | Time-space optimal parallel merging and sorting Xiaojun Guan and Michael A. Langston |
| title_full_unstemmed | Time-space optimal parallel merging and sorting Xiaojun Guan and Michael A. Langston |
| title_short | Time-space optimal parallel merging and sorting |
| title_sort | time space optimal parallel merging and sorting |
| topic | Algorithms Parallel processing (Electronic computers) |
| topic_facet | Algorithms Parallel processing (Electronic computers) |
| volume_link | (DE-604)BV008903301 |
| work_keys_str_mv | AT guanxiaojun timespaceoptimalparallelmergingandsorting AT langstonmichaela timespaceoptimalparallelmergingandsorting |