Functional parallelism: theoretical foundations and implementations
Abstract: "Thus far, parallelism at the loop level (or data- parallelism) has been almost exclusively the main target of parallelizing compilers. The variety of new parallel architectures and recent progress in interprocedural dependence analysis suggest new directions for the exploitation of p...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Urbana, Ill.
1991
|
| Schriftenreihe: | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report
1182 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Thus far, parallelism at the loop level (or data- parallelism) has been almost exclusively the main target of parallelizing compilers. The variety of new parallel architectures and recent progress in interprocedural dependence analysis suggest new directions for the exploitation of parallelism across loop and procedure boundaries (or functional-parallelism). This thesis studies the problem of extracting functional parallelism from sequential programs. It presents the Hierarchical Task Graph (HTG) as an intermediate parallel program representation which encapsulates data and control dependences, and which can be used for the extraction and exploitation of functional parallelism Control and data dependencies require synchronization between tasks, and hence the problem of eliminating redundant control and data dependences is important. We show that determining precedence relationship is crucial in finding the essential data dependences for synchronization purposes, that there exists a unique minimum set of essential data dependences, and that finding this minimum set is NP-hard and NP-easy. We present heuristic algorithms, which appear to work well in practice, to find the minimum set of data dependences. The control and data dependences are used to derive execution conditions for tasks which maximize functional parallelism We discuss the issue of optimization of such conditions and propose optimization algorithms. The hierarchical nature of the HTG facilitates efficient task-granularity control during code generation, and thus applicability for a variety of parallel architectures. The HTG has been implemented in the Parafrase-2 compiler and is used as the intermediate representation for generating parallel source code. |
| Beschreibung: | Zugl.: Urbana, Ill., Diss., 1992 |
| Beschreibung: | 95 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009008720 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 m||| 00||| eng d | ||
| 035 | |a (OCoLC)25925240 | ||
| 035 | |a (DE-599)BVBBV009008720 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Girkar, Milind B. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Functional parallelism |b theoretical foundations and implementations |c Milind Baburao Girkar |
| 246 | 1 | 3 | |a Reportnr.: UILU ENG 91 8046 |
| 264 | 1 | |a Urbana, Ill. |c 1991 | |
| 300 | |a 95 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 1182 | |
| 500 | |a Zugl.: Urbana, Ill., Diss., 1992 | ||
| 520 | 3 | |a Abstract: "Thus far, parallelism at the loop level (or data- parallelism) has been almost exclusively the main target of parallelizing compilers. The variety of new parallel architectures and recent progress in interprocedural dependence analysis suggest new directions for the exploitation of parallelism across loop and procedure boundaries (or functional-parallelism). This thesis studies the problem of extracting functional parallelism from sequential programs. It presents the Hierarchical Task Graph (HTG) as an intermediate parallel program representation which encapsulates data and control dependences, and which can be used for the extraction and exploitation of functional parallelism | |
| 520 | 3 | |a Control and data dependencies require synchronization between tasks, and hence the problem of eliminating redundant control and data dependences is important. We show that determining precedence relationship is crucial in finding the essential data dependences for synchronization purposes, that there exists a unique minimum set of essential data dependences, and that finding this minimum set is NP-hard and NP-easy. We present heuristic algorithms, which appear to work well in practice, to find the minimum set of data dependences. The control and data dependences are used to derive execution conditions for tasks which maximize functional parallelism | |
| 520 | 3 | |a We discuss the issue of optimization of such conditions and propose optimization algorithms. The hierarchical nature of the HTG facilitates efficient task-granularity control during code generation, and thus applicability for a variety of parallel architectures. The HTG has been implemented in the Parafrase-2 compiler and is used as the intermediate representation for generating parallel source code. | |
| 650 | 4 | |a Compilers (Computer programs) | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 830 | 0 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 1182 |w (DE-604)BV008930033 |9 1182 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005955207 | ||
Datensatz im Suchindex
| _version_ | 1804123355841822720 |
|---|---|
| any_adam_object | |
| author | Girkar, Milind B. |
| author_facet | Girkar, Milind B. |
| author_role | aut |
| author_sort | Girkar, Milind B. |
| author_variant | m b g mb mbg |
| building | Verbundindex |
| bvnumber | BV009008720 |
| ctrlnum | (OCoLC)25925240 (DE-599)BVBBV009008720 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02975nam a2200361 cb4500</leader><controlfield tag="001">BV009008720</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25925240</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009008720</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">Girkar, Milind B.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Functional parallelism</subfield><subfield code="b">theoretical foundations and implementations</subfield><subfield code="c">Milind Baburao Girkar</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Reportnr.: UILU ENG 91 8046</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">95 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">Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report</subfield><subfield code="v">1182</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Urbana, Ill., Diss., 1992</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Thus far, parallelism at the loop level (or data- parallelism) has been almost exclusively the main target of parallelizing compilers. The variety of new parallel architectures and recent progress in interprocedural dependence analysis suggest new directions for the exploitation of parallelism across loop and procedure boundaries (or functional-parallelism). This thesis studies the problem of extracting functional parallelism from sequential programs. It presents the Hierarchical Task Graph (HTG) as an intermediate parallel program representation which encapsulates data and control dependences, and which can be used for the extraction and exploitation of functional parallelism</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Control and data dependencies require synchronization between tasks, and hence the problem of eliminating redundant control and data dependences is important. We show that determining precedence relationship is crucial in finding the essential data dependences for synchronization purposes, that there exists a unique minimum set of essential data dependences, and that finding this minimum set is NP-hard and NP-easy. We present heuristic algorithms, which appear to work well in practice, to find the minimum set of data dependences. The control and data dependences are used to derive execution conditions for tasks which maximize functional parallelism</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We discuss the issue of optimization of such conditions and propose optimization algorithms. The hierarchical nature of the HTG facilitates efficient task-granularity control during code generation, and thus applicability for a variety of parallel architectures. The HTG has been implemented in the Parafrase-2 compiler and is used as the intermediate representation for generating parallel source code.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Compilers (Computer programs)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report</subfield><subfield code="v">1182</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">1182</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005955207</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV009008720 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:28Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005955207 |
| oclc_num | 25925240 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 95 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |
| series2 | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |
| spelling | Girkar, Milind B. Verfasser aut Functional parallelism theoretical foundations and implementations Milind Baburao Girkar Reportnr.: UILU ENG 91 8046 Urbana, Ill. 1991 95 S. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 1182 Zugl.: Urbana, Ill., Diss., 1992 Abstract: "Thus far, parallelism at the loop level (or data- parallelism) has been almost exclusively the main target of parallelizing compilers. The variety of new parallel architectures and recent progress in interprocedural dependence analysis suggest new directions for the exploitation of parallelism across loop and procedure boundaries (or functional-parallelism). This thesis studies the problem of extracting functional parallelism from sequential programs. It presents the Hierarchical Task Graph (HTG) as an intermediate parallel program representation which encapsulates data and control dependences, and which can be used for the extraction and exploitation of functional parallelism Control and data dependencies require synchronization between tasks, and hence the problem of eliminating redundant control and data dependences is important. We show that determining precedence relationship is crucial in finding the essential data dependences for synchronization purposes, that there exists a unique minimum set of essential data dependences, and that finding this minimum set is NP-hard and NP-easy. We present heuristic algorithms, which appear to work well in practice, to find the minimum set of data dependences. The control and data dependences are used to derive execution conditions for tasks which maximize functional parallelism We discuss the issue of optimization of such conditions and propose optimization algorithms. The hierarchical nature of the HTG facilitates efficient task-granularity control during code generation, and thus applicability for a variety of parallel architectures. The HTG has been implemented in the Parafrase-2 compiler and is used as the intermediate representation for generating parallel source code. Compilers (Computer programs) Parallel processing (Electronic computers) (DE-588)4113937-9 Hochschulschrift gnd-content Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 1182 (DE-604)BV008930033 1182 |
| spellingShingle | Girkar, Milind B. Functional parallelism theoretical foundations and implementations Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report Compilers (Computer programs) Parallel processing (Electronic computers) |
| subject_GND | (DE-588)4113937-9 |
| title | Functional parallelism theoretical foundations and implementations |
| title_alt | Reportnr.: UILU ENG 91 8046 |
| title_auth | Functional parallelism theoretical foundations and implementations |
| title_exact_search | Functional parallelism theoretical foundations and implementations |
| title_full | Functional parallelism theoretical foundations and implementations Milind Baburao Girkar |
| title_fullStr | Functional parallelism theoretical foundations and implementations Milind Baburao Girkar |
| title_full_unstemmed | Functional parallelism theoretical foundations and implementations Milind Baburao Girkar |
| title_short | Functional parallelism |
| title_sort | functional parallelism theoretical foundations and implementations |
| title_sub | theoretical foundations and implementations |
| topic | Compilers (Computer programs) Parallel processing (Electronic computers) |
| topic_facet | Compilers (Computer programs) Parallel processing (Electronic computers) Hochschulschrift |
| volume_link | (DE-604)BV008930033 |
| work_keys_str_mv | AT girkarmilindb functionalparallelismtheoreticalfoundationsandimplementations AT girkarmilindb reportnruilueng918046 |