The power of collision: randomized parallel algorithms for chaining and integer sorting
Abstract: "We address the problem of sorting n integers each in the range [0, ..., m-1] in parallel on the PRAM model of computation. We present a randomized algorithm that runs with very high probability in time O(lgn/lglgn + lglgm) with a processor-time product of O(nlglgm) and O(n) space on...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Rochester, NY
1990
|
| Series: | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report
336 |
| Subjects: | |
| Summary: | Abstract: "We address the problem of sorting n integers each in the range [0, ..., m-1] in parallel on the PRAM model of computation. We present a randomized algorithm that runs with very high probability in time O(lgn/lglgn + lglgm) with a processor-time product of O(nlglgm) and O(n) space on the CRCW (Collision) PRAM [7]. The main features of this algorithm is [sic] that it matches the run-time and processor requirements of the algorithms in the existing literature [2,10], while it assumes a weaker model of computation and uses a linear amount of space The techniques used to extend to improved randomized algorithms for the problem of chaining [11,15], which is the following: given an array x1, ..., xn, such that m of the locations contain non-zero elements, to chain together all the non-zero elements into a linked list. We give randomized algorithms that run in O(1) time using n processors, whenever m is not too close to n. |
| Physical Description: | 16 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008950531 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24448885 | ||
| 035 | |a (DE-599)BVBBV008950531 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Raman, Rajeev |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The power of collision |b randomized parallel algorithms for chaining and integer sorting |
| 264 | 1 | |a Rochester, NY |c 1990 | |
| 300 | |a 16 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |v 336 | |
| 520 | 3 | |a Abstract: "We address the problem of sorting n integers each in the range [0, ..., m-1] in parallel on the PRAM model of computation. We present a randomized algorithm that runs with very high probability in time O(lgn/lglgn + lglgm) with a processor-time product of O(nlglgm) and O(n) space on the CRCW (Collision) PRAM [7]. The main features of this algorithm is [sic] that it matches the run-time and processor requirements of the algorithms in the existing literature [2,10], while it assumes a weaker model of computation and uses a linear amount of space | |
| 520 | 3 | |a The techniques used to extend to improved randomized algorithms for the problem of chaining [11,15], which is the following: given an array x1, ..., xn, such that m of the locations contain non-zero elements, to chain together all the non-zero elements into a linked list. We give randomized algorithms that run in O(1) time using n processors, whenever m is not too close to n. | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Sorting (Electronic computers) | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Rochester <Rochester, NY> |v 336 |w (DE-604)BV008902697 |9 336 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005906094 | ||
Record in the Search Index
| _version_ | 1804123283934674944 |
|---|---|
| any_adam_object | |
| author | Raman, Rajeev |
| author_facet | Raman, Rajeev |
| author_role | aut |
| author_sort | Raman, Rajeev |
| author_variant | r r rr |
| building | Verbundindex |
| bvnumber | BV008950531 |
| ctrlnum | (OCoLC)24448885 (DE-599)BVBBV008950531 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01966nam a2200313 cb4500</leader><controlfield tag="001">BV008950531</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24448885</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008950531</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">Raman, Rajeev</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The power of collision</subfield><subfield code="b">randomized parallel algorithms for chaining and integer sorting</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Rochester, NY</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 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 Rochester <Rochester, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">336</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We address the problem of sorting n integers each in the range [0, ..., m-1] in parallel on the PRAM model of computation. We present a randomized algorithm that runs with very high probability in time O(lgn/lglgn + lglgm) with a processor-time product of O(nlglgm) and O(n) space on the CRCW (Collision) PRAM [7]. The main features of this algorithm is [sic] that it matches the run-time and processor requirements of the algorithms in the existing literature [2,10], while it assumes a weaker model of computation and uses a linear amount of space</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The techniques used to extend to improved randomized algorithms for the problem of chaining [11,15], which is the following: given an array x1, ..., xn, such that m of the locations contain non-zero elements, to chain together all the non-zero elements into a linked list. We give randomized algorithms that run in O(1) time using n processors, whenever m is not too close to n.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sorting (Electronic computers)</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University of Rochester <Rochester, NY></subfield><subfield code="v">336</subfield><subfield code="w">(DE-604)BV008902697</subfield><subfield code="9">336</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005906094</subfield></datafield></record></collection> |
| id | DE-604.BV008950531 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:19Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005906094 |
| oclc_num | 24448885 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 16 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |
| spelling | Raman, Rajeev Verfasser aut The power of collision randomized parallel algorithms for chaining and integer sorting Rochester, NY 1990 16 S. txt rdacontent n rdamedia nc rdacarrier University of Rochester <Rochester, NY> / Department of Computer Science: Technical report 336 Abstract: "We address the problem of sorting n integers each in the range [0, ..., m-1] in parallel on the PRAM model of computation. We present a randomized algorithm that runs with very high probability in time O(lgn/lglgn + lglgm) with a processor-time product of O(nlglgm) and O(n) space on the CRCW (Collision) PRAM [7]. The main features of this algorithm is [sic] that it matches the run-time and processor requirements of the algorithms in the existing literature [2,10], while it assumes a weaker model of computation and uses a linear amount of space The techniques used to extend to improved randomized algorithms for the problem of chaining [11,15], which is the following: given an array x1, ..., xn, such that m of the locations contain non-zero elements, to chain together all the non-zero elements into a linked list. We give randomized algorithms that run in O(1) time using n processors, whenever m is not too close to n. Algorithms Sorting (Electronic computers) Department of Computer Science: Technical report University of Rochester <Rochester, NY> 336 (DE-604)BV008902697 336 |
| spellingShingle | Raman, Rajeev The power of collision randomized parallel algorithms for chaining and integer sorting Algorithms Sorting (Electronic computers) |
| title | The power of collision randomized parallel algorithms for chaining and integer sorting |
| title_auth | The power of collision randomized parallel algorithms for chaining and integer sorting |
| title_exact_search | The power of collision randomized parallel algorithms for chaining and integer sorting |
| title_full | The power of collision randomized parallel algorithms for chaining and integer sorting |
| title_fullStr | The power of collision randomized parallel algorithms for chaining and integer sorting |
| title_full_unstemmed | The power of collision randomized parallel algorithms for chaining and integer sorting |
| title_short | The power of collision |
| title_sort | the power of collision randomized parallel algorithms for chaining and integer sorting |
| title_sub | randomized parallel algorithms for chaining and integer sorting |
| topic | Algorithms Sorting (Electronic computers) |
| topic_facet | Algorithms Sorting (Electronic computers) |
| volume_link | (DE-604)BV008902697 |
| work_keys_str_mv | AT ramanrajeev thepowerofcollisionrandomizedparallelalgorithmsforchainingandintegersorting |