Optimal parallel algorithms for two processor scheduling with tree precedence constraints:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Deutsch |
| Veröffentlicht: |
München
1995
|
| Schriftenreihe: | Technische Universität <München>: TUM-I
9531 |
| Schlagwörter: | |
| Abstract: | Abstract: "Consider the problem of finding a minimum length schedule for n unit execution time tasks on m processors with tree-like precedence constraints. A sequential algorithm can solve this problem in linear time. The fastest known parallel algorithm needs O(log n) time using n² processors. For the case m=2 we present two work optimal parallel algorithms that produce greedy optimal schedules for intrees and outtrees. Both run in O(log n) time using n/log n processors of an EREW PRAM." |
| Beschreibung: | Literaturverz. S. 20 - 22 |
| Umfang: | 24 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010841163 | ||
| 003 | DE-604 | ||
| 005 | 20040416 | ||
| 007 | t| | ||
| 008 | 960701s1995 gw d||| t||| 00||| ger d | ||
| 016 | 7 | |a 947799079 |2 DE-101 | |
| 035 | |a (OCoLC)35746906 | ||
| 035 | |a (DE-599)BVBBV010841163 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 |a DE-91G | ||
| 088 | |a TUM I 9531 | ||
| 100 | 1 | |a Mayr, Ernst W. |d 1950- |e Verfasser |0 (DE-588)109817923 |4 aut | |
| 245 | 1 | 0 | |a Optimal parallel algorithms for two processor scheduling with tree precedence constraints |c Ernst W. Mayr ; Hans Stadtherr |
| 264 | 1 | |a München |c 1995 | |
| 300 | |a 24 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Technische Universität <München>: TUM-I |v 9531 | |
| 500 | |a Literaturverz. S. 20 - 22 | ||
| 520 | 3 | |a Abstract: "Consider the problem of finding a minimum length schedule for n unit execution time tasks on m processors with tree-like precedence constraints. A sequential algorithm can solve this problem in linear time. The fastest known parallel algorithm needs O(log n) time using n² processors. For the case m=2 we present two work optimal parallel algorithms that produce greedy optimal schedules for intrees and outtrees. Both run in O(log n) time using n/log n processors of an EREW PRAM." | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 4 | |a Scheduling | |
| 650 | 4 | |a Trees (Graph theory) | |
| 700 | 1 | |a Stadtherr, Hans |d 1966- |e Verfasser |0 (DE-588)123204291 |4 aut | |
| 830 | 0 | |a Technische Universität <München>: TUM-I |v 9531 |w (DE-604)BV006185376 |9 9531 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007246851 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6080-1995,31 |
|---|---|
| DE-BY-TUM_katkey | 1457013 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040020532069 |
| _version_ | 1821932841696493568 |
| any_adam_object | |
| author | Mayr, Ernst W. 1950- Stadtherr, Hans 1966- |
| author_GND | (DE-588)109817923 (DE-588)123204291 |
| author_facet | Mayr, Ernst W. 1950- Stadtherr, Hans 1966- |
| author_role | aut aut |
| author_sort | Mayr, Ernst W. 1950- |
| author_variant | e w m ew ewm h s hs |
| building | Verbundindex |
| bvnumber | BV010841163 |
| ctrlnum | (OCoLC)35746906 (DE-599)BVBBV010841163 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01775nam a2200385 cb4500</leader><controlfield tag="001">BV010841163</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040416 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">960701s1995 gw d||| t||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">947799079</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35746906</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010841163</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">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">TUM I 9531</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mayr, Ernst W.</subfield><subfield code="d">1950-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)109817923</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimal parallel algorithms for two processor scheduling with tree precedence constraints</subfield><subfield code="c">Ernst W. Mayr ; Hans Stadtherr</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24 S.</subfield><subfield code="b">graph. Darst.</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">Technische Universität <München>: TUM-I</subfield><subfield code="v">9531</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 20 - 22</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Consider the problem of finding a minimum length schedule for n unit execution time tasks on m processors with tree-like precedence constraints. A sequential algorithm can solve this problem in linear time. The fastest known parallel algorithm needs O(log n) time using n² processors. For the case m=2 we present two work optimal parallel algorithms that produce greedy optimal schedules for intrees and outtrees. Both run in O(log n) time using n/log n processors of an EREW PRAM."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</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">Scheduling</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">Stadtherr, Hans</subfield><subfield code="d">1966-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)123204291</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9531</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9531</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007246851</subfield></datafield></record></collection> |
| id | DE-604.BV010841163 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T10:01:44Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007246851 |
| oclc_num | 35746906 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM |
| owner_facet | DE-12 DE-91G DE-BY-TUM |
| physical | 24 S. graph. Darst. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series | Technische Universität <München>: TUM-I |
| series2 | Technische Universität <München>: TUM-I |
| spellingShingle | Mayr, Ernst W. 1950- Stadtherr, Hans 1966- Optimal parallel algorithms for two processor scheduling with tree precedence constraints Technische Universität <München>: TUM-I Computational complexity Parallel processing (Electronic computers) Scheduling Trees (Graph theory) |
| title | Optimal parallel algorithms for two processor scheduling with tree precedence constraints |
| title_auth | Optimal parallel algorithms for two processor scheduling with tree precedence constraints |
| title_exact_search | Optimal parallel algorithms for two processor scheduling with tree precedence constraints |
| title_full | Optimal parallel algorithms for two processor scheduling with tree precedence constraints Ernst W. Mayr ; Hans Stadtherr |
| title_fullStr | Optimal parallel algorithms for two processor scheduling with tree precedence constraints Ernst W. Mayr ; Hans Stadtherr |
| title_full_unstemmed | Optimal parallel algorithms for two processor scheduling with tree precedence constraints Ernst W. Mayr ; Hans Stadtherr |
| title_short | Optimal parallel algorithms for two processor scheduling with tree precedence constraints |
| title_sort | optimal parallel algorithms for two processor scheduling with tree precedence constraints |
| topic | Computational complexity Parallel processing (Electronic computers) Scheduling Trees (Graph theory) |
| topic_facet | Computational complexity Parallel processing (Electronic computers) Scheduling Trees (Graph theory) |
| volume_link | (DE-604)BV006185376 |
| work_keys_str_mv | AT mayrernstw optimalparallelalgorithmsfortwoprocessorschedulingwithtreeprecedenceconstraints AT stadtherrhans optimalparallelalgorithmsfortwoprocessorschedulingwithtreeprecedenceconstraints |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik, Berichte
| Signatur: |
0111 2001 B 6080-1995,31 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |