Fast deterministic selection on a mesh-connected processor array:
Abstract: "We present a deterministic algorithm for selecting the element of rank k among N = n² elements, 1 [<or =] k [<or =] N, on an n x n mesh-connected processor array in (1.44 + [epsilon])n parallel computation steps, for any constant [epsilon]> 0, using constant sized queues. Th...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Rochester, NY
1991
|
| Series: | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report
371 |
| Subjects: | |
| Summary: | Abstract: "We present a deterministic algorithm for selecting the element of rank k among N = n² elements, 1 [<or =] k [<or =] N, on an n x n mesh-connected processor array in (1.44 + [epsilon])n parallel computation steps, for any constant [epsilon]> 0, using constant sized queues. This is a considerable improvement over the best previous deterministic algorithm, which was base dupon sorting and required 3n steps. Our algorithm can be generalized to solve the problem of selection on higher dimensional meshes, achieving time bounds better than the known results in each case." |
| Physical Description: | 12 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008992622 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)26188887 | ||
| 035 | |a (DE-599)BVBBV008992622 | ||
| 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 Fast deterministic selection on a mesh-connected processor array |c Danny Krizanc ; Lata Narayanan ; Rajeev Raman |
| 264 | 1 | |a Rochester, NY |c 1991 | |
| 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 371 | |
| 520 | 3 | |a Abstract: "We present a deterministic algorithm for selecting the element of rank k among N = n² elements, 1 [<or =] k [<or =] N, on an n x n mesh-connected processor array in (1.44 + [epsilon])n parallel computation steps, for any constant [epsilon]> 0, using constant sized queues. This is a considerable improvement over the best previous deterministic algorithm, which was base dupon sorting and required 3n steps. Our algorithm can be generalized to solve the problem of selection on higher dimensional meshes, achieving time bounds better than the known results in each case." | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 700 | 1 | |a Narayanan, Lata |e Verfasser |4 aut | |
| 700 | 1 | |a Raman, Rajeev |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Rochester <Rochester, NY> |v 371 |w (DE-604)BV008902697 |9 371 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005941552 | ||
Record in the Search Index
| _version_ | 1804123335094697984 |
|---|---|
| any_adam_object | |
| author | Krizanc, Danny Narayanan, Lata Raman, Rajeev |
| author_facet | Krizanc, Danny Narayanan, Lata Raman, Rajeev |
| author_role | aut aut aut |
| author_sort | Krizanc, Danny |
| author_variant | d k dk l n ln r r rr |
| building | Verbundindex |
| bvnumber | BV008992622 |
| ctrlnum | (OCoLC)26188887 (DE-599)BVBBV008992622 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01694nam a2200313 cb4500</leader><controlfield tag="001">BV008992622</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26188887</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008992622</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">Fast deterministic selection on a mesh-connected processor array</subfield><subfield code="c">Danny Krizanc ; Lata Narayanan ; Rajeev Raman</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Rochester, NY</subfield><subfield code="c">1991</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">371</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present a deterministic algorithm for selecting the element of rank k among N = n² elements, 1 [<or =] k [<or =] N, on an n x n mesh-connected processor array in (1.44 + [epsilon])n parallel computation steps, for any constant [epsilon]> 0, using constant sized queues. This is a considerable improvement over the best previous deterministic algorithm, which was base dupon sorting and required 3n steps. Our algorithm can be generalized to solve the problem of selection on higher dimensional meshes, achieving time bounds better than the known results in each case."</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">Narayanan, Lata</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Raman, Rajeev</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">371</subfield><subfield code="w">(DE-604)BV008902697</subfield><subfield code="9">371</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941552</subfield></datafield></record></collection> |
| id | DE-604.BV008992622 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941552 |
| oclc_num | 26188887 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 12 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |
| spelling | Krizanc, Danny Verfasser aut Fast deterministic selection on a mesh-connected processor array Danny Krizanc ; Lata Narayanan ; Rajeev Raman Rochester, NY 1991 12 S. txt rdacontent n rdamedia nc rdacarrier University of Rochester <Rochester, NY> / Department of Computer Science: Technical report 371 Abstract: "We present a deterministic algorithm for selecting the element of rank k among N = n² elements, 1 [<or =] k [<or =] N, on an n x n mesh-connected processor array in (1.44 + [epsilon])n parallel computation steps, for any constant [epsilon]> 0, using constant sized queues. This is a considerable improvement over the best previous deterministic algorithm, which was base dupon sorting and required 3n steps. Our algorithm can be generalized to solve the problem of selection on higher dimensional meshes, achieving time bounds better than the known results in each case." Parallel processing (Electronic computers) Narayanan, Lata Verfasser aut Raman, Rajeev Verfasser aut Department of Computer Science: Technical report University of Rochester <Rochester, NY> 371 (DE-604)BV008902697 371 |
| spellingShingle | Krizanc, Danny Narayanan, Lata Raman, Rajeev Fast deterministic selection on a mesh-connected processor array Parallel processing (Electronic computers) |
| title | Fast deterministic selection on a mesh-connected processor array |
| title_auth | Fast deterministic selection on a mesh-connected processor array |
| title_exact_search | Fast deterministic selection on a mesh-connected processor array |
| title_full | Fast deterministic selection on a mesh-connected processor array Danny Krizanc ; Lata Narayanan ; Rajeev Raman |
| title_fullStr | Fast deterministic selection on a mesh-connected processor array Danny Krizanc ; Lata Narayanan ; Rajeev Raman |
| title_full_unstemmed | Fast deterministic selection on a mesh-connected processor array Danny Krizanc ; Lata Narayanan ; Rajeev Raman |
| title_short | Fast deterministic selection on a mesh-connected processor array |
| title_sort | fast deterministic selection on a mesh connected processor array |
| topic | Parallel processing (Electronic computers) |
| topic_facet | Parallel processing (Electronic computers) |
| volume_link | (DE-604)BV008902697 |
| work_keys_str_mv | AT krizancdanny fastdeterministicselectiononameshconnectedprocessorarray AT narayananlata fastdeterministicselectiononameshconnectedprocessorarray AT ramanrajeev fastdeterministicselectiononameshconnectedprocessorarray |