Automatic extraction of functional parallelism from ordinary programs
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 ef...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on parallel and distributed systems 1992-03, Vol.3 (2), p.166-178 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 178 |
|---|---|
| container_issue | 2 |
| container_start_page | 166 |
| container_title | IEEE transactions on parallel and distributed systems |
| container_volume | 3 |
| creator | Girkar, M. Polychronopoulos, C.D. |
| description | 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 to a variety of parallel architectures. 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 are emphasized. Algorithms for the formation of tasks and their execution conditions based on data and control dependence constraints are presented. The issue of optimization of such conditions is discussed, and optimization algorithms are proposed. The HTG is used as the intermediate representation of parallel Fortran and C programs for generating parallel source as well as parallel machine code.< > |
| doi_str_mv | 10.1109/71.127258 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_127258</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>127258</ieee_id><sourcerecordid>28703653</sourcerecordid><originalsourceid>FETCH-LOGICAL-c430t-8813a9510cc9b7a8a2af3b12eb1777d9d9fb16130fce5493a6523425402b40ad3</originalsourceid><addsrcrecordid>eNqF0E1LxDAQBuAgCq6rB6-eigfBQ9dMPprmuMj6AQte9BzSNNFI26xJCvrv7VrBo6cZmIeX4UXoHPAKAMsbASsggvD6AC2A87okUNPDaceMl5KAPEYnKb1jDIxjtkCb9ZhDr7M3hf3MUZvsw1AEV7hx-Nl1V-x01F1nO5_6wsXQFyG2ftDxq9jF8Bp1n07RkdNdsme_c4le7jbPtw_l9un-8Xa9LQ2jOJd1DVRLDtgY2Qhda6IdbYDYBoQQrWyla6ACip2xnEmqK04oI5xh0jCsW7pEl3NuSNmrZHy25s2EYbAmK04rIHU1oasZTd99jDZl1ftkbNfpwYYxKVILTCtO_4dcggC8T7yeoYkhpWid2kXfTwUowGpfuxKg5tonezFbb639c_PxG2InfDI</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>25917106</pqid></control><display><type>article</type><title>Automatic extraction of functional parallelism from ordinary programs</title><source>IEEE Electronic Library (IEL)</source><creator>Girkar, M. ; Polychronopoulos, C.D.</creator><creatorcontrib>Girkar, M. ; Polychronopoulos, C.D.</creatorcontrib><description>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 to a variety of parallel architectures. 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 are emphasized. Algorithms for the formation of tasks and their execution conditions based on data and control dependence constraints are presented. The issue of optimization of such conditions is discussed, and optimization algorithms are proposed. The HTG is used as the intermediate representation of parallel Fortran and C programs for generating parallel source as well as parallel machine code.< ></description><identifier>ISSN: 1045-9219</identifier><identifier>EISSN: 1558-2183</identifier><identifier>DOI: 10.1109/71.127258</identifier><identifier>CODEN: ITDSEO</identifier><language>eng</language><publisher>United States: IEEE</publisher><subject>990200 - Mathematics & Computers ; ALGORITHMS ; ARRAY PROCESSORS ; AUTOMATION ; Computational modeling ; COMPUTER ARCHITECTURE ; COMPUTER CODES ; Concurrent computing ; Data mining ; GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE ; MATHEMATICAL LOGIC ; OPTIMIZATION ; Parallel architectures ; Parallel languages ; Parallel machines ; PARALLEL PROCESSING ; Parallel programming ; Program processors ; PROGRAMMING</subject><ispartof>IEEE transactions on parallel and distributed systems, 1992-03, Vol.3 (2), p.166-178</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c430t-8813a9510cc9b7a8a2af3b12eb1777d9d9fb16130fce5493a6523425402b40ad3</citedby><cites>FETCH-LOGICAL-c430t-8813a9510cc9b7a8a2af3b12eb1777d9d9fb16130fce5493a6523425402b40ad3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/127258$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>230,314,780,784,796,885,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/127258$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://www.osti.gov/biblio/5361286$$D View this record in Osti.gov$$Hfree_for_read</backlink></links><search><creatorcontrib>Girkar, M.</creatorcontrib><creatorcontrib>Polychronopoulos, C.D.</creatorcontrib><title>Automatic extraction of functional parallelism from ordinary programs</title><title>IEEE transactions on parallel and distributed systems</title><addtitle>TPDS</addtitle><description>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 to a variety of parallel architectures. 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 are emphasized. Algorithms for the formation of tasks and their execution conditions based on data and control dependence constraints are presented. The issue of optimization of such conditions is discussed, and optimization algorithms are proposed. The HTG is used as the intermediate representation of parallel Fortran and C programs for generating parallel source as well as parallel machine code.< ></description><subject>990200 - Mathematics & Computers</subject><subject>ALGORITHMS</subject><subject>ARRAY PROCESSORS</subject><subject>AUTOMATION</subject><subject>Computational modeling</subject><subject>COMPUTER ARCHITECTURE</subject><subject>COMPUTER CODES</subject><subject>Concurrent computing</subject><subject>Data mining</subject><subject>GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE</subject><subject>MATHEMATICAL LOGIC</subject><subject>OPTIMIZATION</subject><subject>Parallel architectures</subject><subject>Parallel languages</subject><subject>Parallel machines</subject><subject>PARALLEL PROCESSING</subject><subject>Parallel programming</subject><subject>Program processors</subject><subject>PROGRAMMING</subject><issn>1045-9219</issn><issn>1558-2183</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1992</creationdate><recordtype>article</recordtype><recordid>eNqF0E1LxDAQBuAgCq6rB6-eigfBQ9dMPprmuMj6AQte9BzSNNFI26xJCvrv7VrBo6cZmIeX4UXoHPAKAMsbASsggvD6AC2A87okUNPDaceMl5KAPEYnKb1jDIxjtkCb9ZhDr7M3hf3MUZvsw1AEV7hx-Nl1V-x01F1nO5_6wsXQFyG2ftDxq9jF8Bp1n07RkdNdsme_c4le7jbPtw_l9un-8Xa9LQ2jOJd1DVRLDtgY2Qhda6IdbYDYBoQQrWyla6ACip2xnEmqK04oI5xh0jCsW7pEl3NuSNmrZHy25s2EYbAmK04rIHU1oasZTd99jDZl1ftkbNfpwYYxKVILTCtO_4dcggC8T7yeoYkhpWid2kXfTwUowGpfuxKg5tonezFbb639c_PxG2InfDI</recordid><startdate>19920301</startdate><enddate>19920301</enddate><creator>Girkar, M.</creator><creator>Polychronopoulos, C.D.</creator><general>IEEE</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>OTOTI</scope></search><sort><creationdate>19920301</creationdate><title>Automatic extraction of functional parallelism from ordinary programs</title><author>Girkar, M. ; Polychronopoulos, C.D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c430t-8813a9510cc9b7a8a2af3b12eb1777d9d9fb16130fce5493a6523425402b40ad3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1992</creationdate><topic>990200 - Mathematics & Computers</topic><topic>ALGORITHMS</topic><topic>ARRAY PROCESSORS</topic><topic>AUTOMATION</topic><topic>Computational modeling</topic><topic>COMPUTER ARCHITECTURE</topic><topic>COMPUTER CODES</topic><topic>Concurrent computing</topic><topic>Data mining</topic><topic>GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE</topic><topic>MATHEMATICAL LOGIC</topic><topic>OPTIMIZATION</topic><topic>Parallel architectures</topic><topic>Parallel languages</topic><topic>Parallel machines</topic><topic>PARALLEL PROCESSING</topic><topic>Parallel programming</topic><topic>Program processors</topic><topic>PROGRAMMING</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Girkar, M.</creatorcontrib><creatorcontrib>Polychronopoulos, C.D.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>OSTI.GOV</collection><jtitle>IEEE transactions on parallel and distributed systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Girkar, M.</au><au>Polychronopoulos, C.D.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Automatic extraction of functional parallelism from ordinary programs</atitle><jtitle>IEEE transactions on parallel and distributed systems</jtitle><stitle>TPDS</stitle><date>1992-03-01</date><risdate>1992</risdate><volume>3</volume><issue>2</issue><spage>166</spage><epage>178</epage><pages>166-178</pages><issn>1045-9219</issn><eissn>1558-2183</eissn><coden>ITDSEO</coden><abstract>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 to a variety of parallel architectures. 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 are emphasized. Algorithms for the formation of tasks and their execution conditions based on data and control dependence constraints are presented. The issue of optimization of such conditions is discussed, and optimization algorithms are proposed. The HTG is used as the intermediate representation of parallel Fortran and C programs for generating parallel source as well as parallel machine code.< ></abstract><cop>United States</cop><pub>IEEE</pub><doi>10.1109/71.127258</doi><tpages>13</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1045-9219 |
| ispartof | IEEE transactions on parallel and distributed systems, 1992-03, Vol.3 (2), p.166-178 |
| issn | 1045-9219 1558-2183 |
| language | eng |
| recordid | cdi_ieee_primary_127258 |
| source | IEEE Electronic Library (IEL) |
| subjects | 990200 - Mathematics & Computers ALGORITHMS ARRAY PROCESSORS AUTOMATION Computational modeling COMPUTER ARCHITECTURE COMPUTER CODES Concurrent computing Data mining GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE MATHEMATICAL LOGIC OPTIMIZATION Parallel architectures Parallel languages Parallel machines PARALLEL PROCESSING Parallel programming Program processors PROGRAMMING |
| title | Automatic extraction of functional parallelism from ordinary programs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T21%3A19%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Automatic%20extraction%20of%20functional%20parallelism%20from%20ordinary%20programs&rft.jtitle=IEEE%20transactions%20on%20parallel%20and%20distributed%20systems&rft.au=Girkar,%20M.&rft.date=1992-03-01&rft.volume=3&rft.issue=2&rft.spage=166&rft.epage=178&rft.pages=166-178&rft.issn=1045-9219&rft.eissn=1558-2183&rft.coden=ITDSEO&rft_id=info:doi/10.1109/71.127258&rft_dat=%3Cproquest_RIE%3E28703653%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=25917106&rft_id=info:pmid/&rft_ieee_id=127258&rfr_iscdi=true |