Formalizing functional parallelism:
Abstract: "The problem of detecting functional parallelism (also referred as DAG parallelism) was studied in [CHH89]. In this paper we formalize the concept of functional parallelism through the notion of precedence in terms of paths in graphs incorporating control and data dependences. Precede...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Urbana, Ill.
1991
|
| Series: | Center for Supercomputing Research and Development <Urbana, Ill,>: CSRD report
1141 |
| Subjects: | |
| Summary: | Abstract: "The problem of detecting functional parallelism (also referred as DAG parallelism) was studied in [CHH89]. In this paper we formalize the concept of functional parallelism through the notion of precedence in terms of paths in graphs incorporating control and data dependences. Precedences were also defined in [CS88] in a different context, however, the definition was dependent on the ideas of parallel execution and time. We show that the problem of determining precedences statically is NP-complete. Determining precedence relationship is useful in finding the essential data dependences for synchronization purposes. We show that there exists a unique minimum set of essential data dependences, finding this minimum set is NP-hard and NP-easy." |
| Physical Description: | 31 Bl. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008992766 | ||
| 003 | DE-604 | ||
| 005 | 19990507 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)25334727 | ||
| 035 | |a (DE-599)BVBBV008992766 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Girkar, Milind |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Formalizing functional parallelism |c Milind Girkar and Constantine Polychronopoulos |
| 264 | 1 | |a Urbana, Ill. |c 1991 | |
| 300 | |a 31 Bl. | ||
| 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 1141 | |
| 520 | 3 | |a Abstract: "The problem of detecting functional parallelism (also referred as DAG parallelism) was studied in [CHH89]. In this paper we formalize the concept of functional parallelism through the notion of precedence in terms of paths in graphs incorporating control and data dependences. Precedences were also defined in [CS88] in a different context, however, the definition was dependent on the ideas of parallel execution and time. We show that the problem of determining precedences statically is NP-complete. Determining precedence relationship is useful in finding the essential data dependences for synchronization purposes. We show that there exists a unique minimum set of essential data dependences, finding this minimum set is NP-hard and NP-easy." | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Compilers (Computer programs) | |
| 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 1141 |w (DE-604)BV008930033 |9 1141 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005941685 | ||
Record in the Search Index
| _version_ | 1804123335244644352 |
|---|---|
| any_adam_object | |
| author | Girkar, Milind Polychronopoulos, Constantine D. 1958- |
| author_GND | (DE-588)120999773 |
| author_facet | Girkar, Milind Polychronopoulos, Constantine D. 1958- |
| author_role | aut aut |
| author_sort | Girkar, Milind |
| author_variant | m g mg c d p cd cdp |
| building | Verbundindex |
| bvnumber | BV008992766 |
| ctrlnum | (OCoLC)25334727 (DE-599)BVBBV008992766 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01864nam a2200325 cb4500</leader><controlfield tag="001">BV008992766</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19990507 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25334727</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008992766</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</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Formalizing functional parallelism</subfield><subfield code="c">Milind Girkar and Constantine 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 Bl.</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">1141</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The problem of detecting functional parallelism (also referred as DAG parallelism) was studied in [CHH89]. In this paper we formalize the concept of functional parallelism through the notion of precedence in terms of paths in graphs incorporating control and data dependences. Precedences were also defined in [CS88] in a different context, however, the definition was dependent on the ideas of parallel execution and time. We show that the problem of determining precedences statically is NP-complete. Determining precedence relationship is useful in finding the essential data dependences for synchronization purposes. We show that there exists a unique minimum set of essential data dependences, finding this minimum set is NP-hard and NP-easy."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</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">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">1141</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">1141</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941685</subfield></datafield></record></collection> |
| id | DE-604.BV008992766 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941685 |
| oclc_num | 25334727 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 31 Bl. |
| 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 Verfasser aut Formalizing functional parallelism Milind Girkar and Constantine Polychronopoulos Urbana, Ill. 1991 31 Bl. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill,>: CSRD report 1141 Abstract: "The problem of detecting functional parallelism (also referred as DAG parallelism) was studied in [CHH89]. In this paper we formalize the concept of functional parallelism through the notion of precedence in terms of paths in graphs incorporating control and data dependences. Precedences were also defined in [CS88] in a different context, however, the definition was dependent on the ideas of parallel execution and time. We show that the problem of determining precedences statically is NP-complete. Determining precedence relationship is useful in finding the essential data dependences for synchronization purposes. We show that there exists a unique minimum set of essential data dependences, finding this minimum set is NP-hard and NP-easy." Algorithms Compilers (Computer programs) Synchronization Polychronopoulos, Constantine D. 1958- Verfasser (DE-588)120999773 aut Center for Supercomputing Research and Development <Urbana, Ill,>: CSRD report 1141 (DE-604)BV008930033 1141 |
| spellingShingle | Girkar, Milind Polychronopoulos, Constantine D. 1958- Formalizing functional parallelism Center for Supercomputing Research and Development <Urbana, Ill,>: CSRD report Algorithms Compilers (Computer programs) Synchronization |
| title | Formalizing functional parallelism |
| title_auth | Formalizing functional parallelism |
| title_exact_search | Formalizing functional parallelism |
| title_full | Formalizing functional parallelism Milind Girkar and Constantine Polychronopoulos |
| title_fullStr | Formalizing functional parallelism Milind Girkar and Constantine Polychronopoulos |
| title_full_unstemmed | Formalizing functional parallelism Milind Girkar and Constantine Polychronopoulos |
| title_short | Formalizing functional parallelism |
| title_sort | formalizing functional parallelism |
| topic | Algorithms Compilers (Computer programs) Synchronization |
| topic_facet | Algorithms Compilers (Computer programs) Synchronization |
| volume_link | (DE-604)BV008930033 |
| work_keys_str_mv | AT girkarmilind formalizingfunctionalparallelism AT polychronopoulosconstantined formalizingfunctionalparallelism |