Randomized selection on the mesh-connected processor array:
Abstract: "We show that selection on an input of size N = n² can be performed by a N node mesh-connected processor array in 2n + o(n) steps, with high probability. The best previously known algorithm for this involved sorting, and required 3n + o(n) steps."
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Rochester, NY
1990
|
| Series: | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report
364 |
| Subjects: | |
| Summary: | Abstract: "We show that selection on an input of size N = n² can be performed by a N node mesh-connected processor array in 2n + o(n) steps, with high probability. The best previously known algorithm for this involved sorting, and required 3n + o(n) steps." |
| Physical Description: | 12 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008974833 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24448808 | ||
| 035 | |a (DE-599)BVBBV008974833 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Krizanc, Danny |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Randomized selection on the mesh-connected processor array |c Danny Krizanc and Lata Narayanan |
| 264 | 1 | |a Rochester, NY |c 1990 | |
| 300 | |a 12 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 364 | |
| 520 | 3 | |a Abstract: "We show that selection on an input of size N = n² can be performed by a N node mesh-connected processor array in 2n + o(n) steps, with high probability. The best previously known algorithm for this involved sorting, and required 3n + o(n) steps." | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Array processors | |
| 700 | 1 | |a Narayanan, Lata |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Rochester <Rochester, NY> |v 364 |w (DE-604)BV008902697 |9 364 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005926363 | ||
Record in the Search Index
| _version_ | 1804123312916267008 |
|---|---|
| any_adam_object | |
| author | Krizanc, Danny Narayanan, Lata |
| author_facet | Krizanc, Danny Narayanan, Lata |
| author_role | aut aut |
| author_sort | Krizanc, Danny |
| author_variant | d k dk l n ln |
| building | Verbundindex |
| bvnumber | BV008974833 |
| ctrlnum | (OCoLC)24448808 (DE-599)BVBBV008974833 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01305nam a2200313 cb4500</leader><controlfield tag="001">BV008974833</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)24448808</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008974833</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">Krizanc, Danny</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Randomized selection on the mesh-connected processor array</subfield><subfield code="c">Danny Krizanc and Lata Narayanan</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">12 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">364</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We show that selection on an input of size N = n² can be performed by a N node mesh-connected processor array in 2n + o(n) steps, with high probability. The best previously known algorithm for this involved sorting, and required 3n + o(n) steps."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Array processors</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Narayanan, Lata</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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">364</subfield><subfield code="w">(DE-604)BV008902697</subfield><subfield code="9">364</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005926363</subfield></datafield></record></collection> |
| id | DE-604.BV008974833 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:47Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005926363 |
| oclc_num | 24448808 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 12 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |
| spelling | Krizanc, Danny Verfasser aut Randomized selection on the mesh-connected processor array Danny Krizanc and Lata Narayanan Rochester, NY 1990 12 S. txt rdacontent n rdamedia nc rdacarrier University of Rochester <Rochester, NY> / Department of Computer Science: Technical report 364 Abstract: "We show that selection on an input of size N = n² can be performed by a N node mesh-connected processor array in 2n + o(n) steps, with high probability. The best previously known algorithm for this involved sorting, and required 3n + o(n) steps." Algorithms Array processors Narayanan, Lata Verfasser aut Department of Computer Science: Technical report University of Rochester <Rochester, NY> 364 (DE-604)BV008902697 364 |
| spellingShingle | Krizanc, Danny Narayanan, Lata Randomized selection on the mesh-connected processor array Algorithms Array processors |
| title | Randomized selection on the mesh-connected processor array |
| title_auth | Randomized selection on the mesh-connected processor array |
| title_exact_search | Randomized selection on the mesh-connected processor array |
| title_full | Randomized selection on the mesh-connected processor array Danny Krizanc and Lata Narayanan |
| title_fullStr | Randomized selection on the mesh-connected processor array Danny Krizanc and Lata Narayanan |
| title_full_unstemmed | Randomized selection on the mesh-connected processor array Danny Krizanc and Lata Narayanan |
| title_short | Randomized selection on the mesh-connected processor array |
| title_sort | randomized selection on the mesh connected processor array |
| topic | Algorithms Array processors |
| topic_facet | Algorithms Array processors |
| volume_link | (DE-604)BV008902697 |
| work_keys_str_mv | AT krizancdanny randomizedselectiononthemeshconnectedprocessorarray AT narayananlata randomizedselectiononthemeshconnectedprocessorarray |