Parallel tree slicing:
Abstract: "Let T be an ordered rooted tree of height h with n vertices. Vertex v is said to be at level i of T if the path from the root to v contains i edges. We introduce the tree slicing problem of parallel computing: compute, for all i [element of] [0, ..., h], the ordered list of vertices...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
København
1995
|
| Series: | Datalogisk Institut <København>: DIKU-Rapport
1995,13 |
| Subjects: | |
| Summary: | Abstract: "Let T be an ordered rooted tree of height h with n vertices. Vertex v is said to be at level i of T if the path from the root to v contains i edges. We introduce the tree slicing problem of parallel computing: compute, for all i [element of] [0, ..., h], the ordered list of vertices at level i of T. Tree slicing is a natural generalization of list ranking to trees, and is intended for scheduling level-wise computations on trees, as for example counting the number of vertices at each level. A work-, time-, and space-optimal parallel algorithm is presented that solves the tree slicing problem in O(log n) time and O(n) space with O(n/log n) processors on the EREW PRAM model. The result is obtained by transforming the tree slicing problem to a special integer sorting problem that is solved within these resource bounds." |
| Physical Description: | 5 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010685415 | ||
| 003 | DE-604 | ||
| 005 | 20011115 | ||
| 007 | t | ||
| 008 | 960326s1995 |||| 00||| eng d | ||
| 035 | |a (OCoLC)38561910 | ||
| 035 | |a (DE-599)BVBBV010685415 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Katajainen, Jyrki |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parallel tree slicing |c Jyrki Katajainen, Mikkel Thorup & Jesper Larsson Träff |
| 264 | 1 | |a København |c 1995 | |
| 300 | |a 5 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1995,13 | |
| 520 | 3 | |a Abstract: "Let T be an ordered rooted tree of height h with n vertices. Vertex v is said to be at level i of T if the path from the root to v contains i edges. We introduce the tree slicing problem of parallel computing: compute, for all i [element of] [0, ..., h], the ordered list of vertices at level i of T. Tree slicing is a natural generalization of list ranking to trees, and is intended for scheduling level-wise computations on trees, as for example counting the number of vertices at each level. A work-, time-, and space-optimal parallel algorithm is presented that solves the tree slicing problem in O(log n) time and O(n) space with O(n/log n) processors on the EREW PRAM model. The result is obtained by transforming the tree slicing problem to a special integer sorting problem that is solved within these resource bounds." | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 4 | |a Trees (Graph theory) | |
| 700 | 1 | |a Thorup, Mikkel |d 1973- |e Verfasser |0 (DE-588)1044557877 |4 aut | |
| 700 | 1 | |a Träff, Jesper Larsson |e Verfasser |4 aut | |
| 830 | 0 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1995,13 |w (DE-604)BV010011493 |9 1995,13 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007131978 | ||
Record in the Search Index
| _version_ | 1804125163117084672 |
|---|---|
| any_adam_object | |
| author | Katajainen, Jyrki Thorup, Mikkel 1973- Träff, Jesper Larsson |
| author_GND | (DE-588)1044557877 |
| author_facet | Katajainen, Jyrki Thorup, Mikkel 1973- Träff, Jesper Larsson |
| author_role | aut aut aut |
| author_sort | Katajainen, Jyrki |
| author_variant | j k jk m t mt j l t jl jlt |
| building | Verbundindex |
| bvnumber | BV010685415 |
| ctrlnum | (OCoLC)38561910 (DE-599)BVBBV010685415 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01962nam a2200337 cb4500</leader><controlfield tag="001">BV010685415</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20011115 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960326s1995 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38561910</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010685415</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Katajainen, Jyrki</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel tree slicing</subfield><subfield code="c">Jyrki Katajainen, Mikkel Thorup & Jesper Larsson Träff</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">København</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">5 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">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1995,13</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Let T be an ordered rooted tree of height h with n vertices. Vertex v is said to be at level i of T if the path from the root to v contains i edges. We introduce the tree slicing problem of parallel computing: compute, for all i [element of] [0, ..., h], the ordered list of vertices at level i of T. Tree slicing is a natural generalization of list ranking to trees, and is intended for scheduling level-wise computations on trees, as for example counting the number of vertices at each level. A work-, time-, and space-optimal parallel algorithm is presented that solves the tree slicing problem in O(log n) time and O(n) space with O(n/log n) processors on the EREW PRAM model. The result is obtained by transforming the tree slicing problem to a special integer sorting problem that is solved within these resource bounds."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Thorup, Mikkel</subfield><subfield code="d">1973-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1044557877</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Träff, Jesper Larsson</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1995,13</subfield><subfield code="w">(DE-604)BV010011493</subfield><subfield code="9">1995,13</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007131978</subfield></datafield></record></collection> |
| id | DE-604.BV010685415 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:57:11Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007131978 |
| oclc_num | 38561910 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 5 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series | Datalogisk Institut <København>: DIKU-Rapport |
| series2 | Datalogisk Institut <København>: DIKU-Rapport |
| spelling | Katajainen, Jyrki Verfasser aut Parallel tree slicing Jyrki Katajainen, Mikkel Thorup & Jesper Larsson Träff København 1995 5 S. txt rdacontent n rdamedia nc rdacarrier Datalogisk Institut <København>: DIKU-Rapport 1995,13 Abstract: "Let T be an ordered rooted tree of height h with n vertices. Vertex v is said to be at level i of T if the path from the root to v contains i edges. We introduce the tree slicing problem of parallel computing: compute, for all i [element of] [0, ..., h], the ordered list of vertices at level i of T. Tree slicing is a natural generalization of list ranking to trees, and is intended for scheduling level-wise computations on trees, as for example counting the number of vertices at each level. A work-, time-, and space-optimal parallel algorithm is presented that solves the tree slicing problem in O(log n) time and O(n) space with O(n/log n) processors on the EREW PRAM model. The result is obtained by transforming the tree slicing problem to a special integer sorting problem that is solved within these resource bounds." Data structures (Computer science) Parallel processing (Electronic computers) Trees (Graph theory) Thorup, Mikkel 1973- Verfasser (DE-588)1044557877 aut Träff, Jesper Larsson Verfasser aut Datalogisk Institut <København>: DIKU-Rapport 1995,13 (DE-604)BV010011493 1995,13 |
| spellingShingle | Katajainen, Jyrki Thorup, Mikkel 1973- Träff, Jesper Larsson Parallel tree slicing Datalogisk Institut <København>: DIKU-Rapport Data structures (Computer science) Parallel processing (Electronic computers) Trees (Graph theory) |
| title | Parallel tree slicing |
| title_auth | Parallel tree slicing |
| title_exact_search | Parallel tree slicing |
| title_full | Parallel tree slicing Jyrki Katajainen, Mikkel Thorup & Jesper Larsson Träff |
| title_fullStr | Parallel tree slicing Jyrki Katajainen, Mikkel Thorup & Jesper Larsson Träff |
| title_full_unstemmed | Parallel tree slicing Jyrki Katajainen, Mikkel Thorup & Jesper Larsson Träff |
| title_short | Parallel tree slicing |
| title_sort | parallel tree slicing |
| topic | Data structures (Computer science) Parallel processing (Electronic computers) Trees (Graph theory) |
| topic_facet | Data structures (Computer science) Parallel processing (Electronic computers) Trees (Graph theory) |
| volume_link | (DE-604)BV010011493 |
| work_keys_str_mv | AT katajainenjyrki paralleltreeslicing AT thorupmikkel paralleltreeslicing AT traffjesperlarsson paralleltreeslicing |