Fast parallel permutation algorithms:
Abstract: "We investigate the problem of permuting n data items, each covering D global memory cells, on an EREW PRAM with n/log n processors and less than Dn additional storage. We present a family of algorithms (A[subscript k])[subscript k], where k = 1,2, ..., log[superscript *] n, such that...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1993
|
| Schriftenreihe: | Report CS-R / Centrum voor Wiskunde en Informatica, Department of Computer Science
93,3 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We investigate the problem of permuting n data items, each covering D global memory cells, on an EREW PRAM with n/log n processors and less than Dn additional storage. We present a family of algorithms (A[subscript k])[subscript k], where k = 1,2, ..., log[superscript *] n, such that A[subscript k] needs time D log n log[superscript (k)]n. Here log[superscript (k)]n denotes k times application of log to n, and [formula]. All algorithms need [theta](n) operations which is optimal. The storage requirements of A[subscript k] are n global bits, n/log[superscript (k-1)]n global memory cells if k [> or =] 2, and D log n/log[superscript (k-1)]n (resp. D) local memory cells per processor if k [> or =] 2 (resp. k = 1) Hence, the family (A[subscript k])[subscript k] reveals a time- space tradeoff. The result can be generalized to machines with p <n/log n processors such that the run time is (Dn/p)log[superscript (k)]n, (Dn/p)/log[superscript (k-1)]n local cells per processor are needed, and the global storage requirements remain as given above. |
| Beschreibung: | 7 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035016883 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 080822s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)31372922 | ||
| 035 | |a (DE-599)BSZ035550090 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Keller, Jörg |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Fast parallel permutation algorithms |c J. Keller |
| 264 | 1 | |a Amsterdam |c 1993 | |
| 300 | |a 7 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Report CS-R / Centrum voor Wiskunde en Informatica, Department of Computer Science |v 93,3 | |
| 520 | 3 | |a Abstract: "We investigate the problem of permuting n data items, each covering D global memory cells, on an EREW PRAM with n/log n processors and less than Dn additional storage. We present a family of algorithms (A[subscript k])[subscript k], where k = 1,2, ..., log[superscript *] n, such that A[subscript k] needs time D log n log[superscript (k)]n. Here log[superscript (k)]n denotes k times application of log to n, and [formula]. All algorithms need [theta](n) operations which is optimal. The storage requirements of A[subscript k] are n global bits, n/log[superscript (k-1)]n global memory cells if k [> or =] 2, and D log n/log[superscript (k-1)]n (resp. D) local memory cells per processor if k [> or =] 2 (resp. k = 1) | |
| 520 | 3 | |a Hence, the family (A[subscript k])[subscript k] reveals a time- space tradeoff. The result can be generalized to machines with p <n/log n processors such that the run time is (Dn/p)log[superscript (k)]n, (Dn/p)/log[superscript (k-1)]n local cells per processor are needed, and the global storage requirements remain as given above. | |
| 650 | 4 | |a Computer algorithms | |
| 810 | 2 | |a Centrum voor Wiskunde en Informatica, Department of Computer Science |t Report CS-R |v 93,3 |w (DE-604)BV008928356 |9 93,3 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016686039 | ||
Datensatz im Suchindex
| _version_ | 1804137940435075072 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Keller, Jörg |
| author_facet | Keller, Jörg |
| author_role | aut |
| author_sort | Keller, Jörg |
| author_variant | j k jk |
| building | Verbundindex |
| bvnumber | BV035016883 |
| ctrlnum | (OCoLC)31372922 (DE-599)BSZ035550090 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01955nam a2200289 cb4500</leader><controlfield tag="001">BV035016883</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080822s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31372922</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BSZ035550090</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Keller, Jörg</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fast parallel permutation algorithms</subfield><subfield code="c">J. Keller</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">7 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">Report CS-R / Centrum voor Wiskunde en Informatica, Department of Computer Science</subfield><subfield code="v">93,3</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We investigate the problem of permuting n data items, each covering D global memory cells, on an EREW PRAM with n/log n processors and less than Dn additional storage. We present a family of algorithms (A[subscript k])[subscript k], where k = 1,2, ..., log[superscript *] n, such that A[subscript k] needs time D log n log[superscript (k)]n. Here log[superscript (k)]n denotes k times application of log to n, and [formula]. All algorithms need [theta](n) operations which is optimal. The storage requirements of A[subscript k] are n global bits, n/log[superscript (k-1)]n global memory cells if k [> or =] 2, and D log n/log[superscript (k-1)]n (resp. D) local memory cells per processor if k [> or =] 2 (resp. k = 1)</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Hence, the family (A[subscript k])[subscript k] reveals a time- space tradeoff. The result can be generalized to machines with p <n/log n processors such that the run time is (Dn/p)log[superscript (k)]n, (Dn/p)/log[superscript (k-1)]n local cells per processor are needed, and the global storage requirements remain as given above.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica, Department of Computer Science</subfield><subfield code="t">Report CS-R</subfield><subfield code="v">93,3</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">93,3</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016686039</subfield></datafield></record></collection> |
| id | DE-604.BV035016883 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T21:45:46Z |
| indexdate | 2024-07-09T21:20:17Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016686039 |
| oclc_num | 31372922 |
| open_access_boolean | |
| physical | 7 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Report CS-R / Centrum voor Wiskunde en Informatica, Department of Computer Science |
| spelling | Keller, Jörg Verfasser aut Fast parallel permutation algorithms J. Keller Amsterdam 1993 7 S. txt rdacontent n rdamedia nc rdacarrier Report CS-R / Centrum voor Wiskunde en Informatica, Department of Computer Science 93,3 Abstract: "We investigate the problem of permuting n data items, each covering D global memory cells, on an EREW PRAM with n/log n processors and less than Dn additional storage. We present a family of algorithms (A[subscript k])[subscript k], where k = 1,2, ..., log[superscript *] n, such that A[subscript k] needs time D log n log[superscript (k)]n. Here log[superscript (k)]n denotes k times application of log to n, and [formula]. All algorithms need [theta](n) operations which is optimal. The storage requirements of A[subscript k] are n global bits, n/log[superscript (k-1)]n global memory cells if k [> or =] 2, and D log n/log[superscript (k-1)]n (resp. D) local memory cells per processor if k [> or =] 2 (resp. k = 1) Hence, the family (A[subscript k])[subscript k] reveals a time- space tradeoff. The result can be generalized to machines with p <n/log n processors such that the run time is (Dn/p)log[superscript (k)]n, (Dn/p)/log[superscript (k-1)]n local cells per processor are needed, and the global storage requirements remain as given above. Computer algorithms Centrum voor Wiskunde en Informatica, Department of Computer Science Report CS-R 93,3 (DE-604)BV008928356 93,3 |
| spellingShingle | Keller, Jörg Fast parallel permutation algorithms Computer algorithms |
| title | Fast parallel permutation algorithms |
| title_auth | Fast parallel permutation algorithms |
| title_exact_search | Fast parallel permutation algorithms |
| title_exact_search_txtP | Fast parallel permutation algorithms |
| title_full | Fast parallel permutation algorithms J. Keller |
| title_fullStr | Fast parallel permutation algorithms J. Keller |
| title_full_unstemmed | Fast parallel permutation algorithms J. Keller |
| title_short | Fast parallel permutation algorithms |
| title_sort | fast parallel permutation algorithms |
| topic | Computer algorithms |
| topic_facet | Computer algorithms |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT kellerjorg fastparallelpermutationalgorithms |