The HTG: an intermediate representation for programs based on control and data dependences
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:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Urbana, Ill.
1991
|
| Schriftenreihe: | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report
1046 |
| 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 paper presents the Hierarchical Task Graph (HTG) as an intermediate parallel program representation which encapsulates minimal data and control dependences, and which can be used for the extraction and exploitation of functional, or task-level parallelism The hierarchical nature of the HTG facilitates efficient task- granularity control during code generation, and thus applicability for a variety of parallel architectures. This paper focuses on the construction of the HTG at a given hierarchy level, the derivation of the execution conditions of tasks which maximizes task-level parallelism, and the optimization of these conditions which results in reducing synchronization overhead imposed by data and control dependences. We present algorithms for the formation of tasks and their execution conditions based on data and control dependence constraints. Subsequently we discuss the issue of optimization of such conditions and propose optimization algorithms The HTG, which is being implemented in the Parafrase-2 compiler, is used as the intermediate representation of parallel Fortran and C programs for generating parallel source as well as parallel machine code. |
| Beschreibung: | 31 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009224748 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24660707 | ||
| 035 | |a (DE-599)BVBBV009224748 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Milind, Girkar |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The HTG |b an intermediate representation for programs based on control and data dependences |c Milind Girkar and Constantine D. Polychronopoulos |
| 264 | 1 | |a Urbana, Ill. |c 1991 | |
| 300 | |a 31 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 1046 | |
| 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 paper presents the Hierarchical Task Graph (HTG) as an intermediate parallel program representation which encapsulates minimal data and control dependences, and which can be used for the extraction and exploitation of functional, or task-level parallelism | |
| 520 | 3 | |a The hierarchical nature of the HTG facilitates efficient task- granularity control during code generation, and thus applicability for a variety of parallel architectures. This paper focuses on the construction of the HTG at a given hierarchy level, the derivation of the execution conditions of tasks which maximizes task-level parallelism, and the optimization of these conditions which results in reducing synchronization overhead imposed by data and control dependences. We present algorithms for the formation of tasks and their execution conditions based on data and control dependence constraints. Subsequently we discuss the issue of optimization of such conditions and propose optimization algorithms | |
| 520 | 3 | |a The HTG, which is being implemented in the Parafrase-2 compiler, is used as the intermediate representation of parallel Fortran and C programs for generating parallel source as well as parallel machine code. | |
| 650 | 4 | |a Compilers (Computer programs) | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 650 | 4 | |a Synchronization | |
| 700 | 1 | |a Polychronopoulos, Constantine D. |d 1958- |e Verfasser |0 (DE-588)120999773 |4 aut | |
| 830 | 0 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 1046 |w (DE-604)BV008930033 |9 1046 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006133921 | ||
Datensatz im Suchindex
| _version_ | 1804123667797377024 |
|---|---|
| any_adam_object | |
| author | Milind, Girkar Polychronopoulos, Constantine D. 1958- |
| author_GND | (DE-588)120999773 |
| author_facet | Milind, Girkar Polychronopoulos, Constantine D. 1958- |
| author_role | aut aut |
| author_sort | Milind, Girkar |
| author_variant | g m gm c d p cd cdp |
| building | Verbundindex |
| bvnumber | BV009224748 |
| ctrlnum | (OCoLC)24660707 (DE-599)BVBBV009224748 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02777nam a2200349 cb4500</leader><controlfield tag="001">BV009224748</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24660707</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009224748</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">Milind, Girkar</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The HTG</subfield><subfield code="b">an intermediate representation for programs based on control and data dependences</subfield><subfield code="c">Milind Girkar and Constantine D. Polychronopoulos</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">31 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">1046</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 paper presents the Hierarchical Task Graph (HTG) as an intermediate parallel program representation which encapsulates minimal data and control dependences, and which can be used for the extraction and exploitation of functional, or task-level parallelism</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The hierarchical nature of the HTG facilitates efficient task- granularity control during code generation, and thus applicability for a variety of parallel architectures. This paper focuses on the construction of the HTG at a given hierarchy level, the derivation of the execution conditions of tasks which maximizes task-level parallelism, and the optimization of these conditions which results in reducing synchronization overhead imposed by data and control dependences. We present algorithms for the formation of tasks and their execution conditions based on data and control dependence constraints. Subsequently we discuss the issue of optimization of such conditions and propose optimization algorithms</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The HTG, which is being implemented in the Parafrase-2 compiler, is used as the intermediate representation of parallel Fortran and C programs for generating parallel source as well as parallel machine 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 programming (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Synchronization</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Polychronopoulos, Constantine D.</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120999773</subfield><subfield code="4">aut</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">1046</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">1046</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006133921</subfield></datafield></record></collection> |
| id | DE-604.BV009224748 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:25Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006133921 |
| oclc_num | 24660707 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 31 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 | Milind, Girkar Verfasser aut The HTG an intermediate representation for programs based on control and data dependences Milind Girkar and Constantine D. Polychronopoulos Urbana, Ill. 1991 31 S. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 1046 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 paper presents the Hierarchical Task Graph (HTG) as an intermediate parallel program representation which encapsulates minimal data and control dependences, and which can be used for the extraction and exploitation of functional, or task-level parallelism The hierarchical nature of the HTG facilitates efficient task- granularity control during code generation, and thus applicability for a variety of parallel architectures. This paper focuses on the construction of the HTG at a given hierarchy level, the derivation of the execution conditions of tasks which maximizes task-level parallelism, and the optimization of these conditions which results in reducing synchronization overhead imposed by data and control dependences. We present algorithms for the formation of tasks and their execution conditions based on data and control dependence constraints. Subsequently we discuss the issue of optimization of such conditions and propose optimization algorithms The HTG, which is being implemented in the Parafrase-2 compiler, is used as the intermediate representation of parallel Fortran and C programs for generating parallel source as well as parallel machine code. Compilers (Computer programs) Parallel programming (Computer science) Synchronization Polychronopoulos, Constantine D. 1958- Verfasser (DE-588)120999773 aut Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 1046 (DE-604)BV008930033 1046 |
| spellingShingle | Milind, Girkar Polychronopoulos, Constantine D. 1958- The HTG an intermediate representation for programs based on control and data dependences Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report Compilers (Computer programs) Parallel programming (Computer science) Synchronization |
| title | The HTG an intermediate representation for programs based on control and data dependences |
| title_auth | The HTG an intermediate representation for programs based on control and data dependences |
| title_exact_search | The HTG an intermediate representation for programs based on control and data dependences |
| title_full | The HTG an intermediate representation for programs based on control and data dependences Milind Girkar and Constantine D. Polychronopoulos |
| title_fullStr | The HTG an intermediate representation for programs based on control and data dependences Milind Girkar and Constantine D. Polychronopoulos |
| title_full_unstemmed | The HTG an intermediate representation for programs based on control and data dependences Milind Girkar and Constantine D. Polychronopoulos |
| title_short | The HTG |
| title_sort | the htg an intermediate representation for programs based on control and data dependences |
| title_sub | an intermediate representation for programs based on control and data dependences |
| topic | Compilers (Computer programs) Parallel programming (Computer science) Synchronization |
| topic_facet | Compilers (Computer programs) Parallel programming (Computer science) Synchronization |
| volume_link | (DE-604)BV008930033 |
| work_keys_str_mv | AT milindgirkar thehtganintermediaterepresentationforprogramsbasedoncontrolanddatadependences AT polychronopoulosconstantined thehtganintermediaterepresentationforprogramsbasedoncontrolanddatadependences |