Issues in the compile-time optimization of parallel programs:
Abstract: "The data-flow and dependence analysis techniques used in today's optimizing compilers have been designed for sequential source programs. When parallel source programs are to be optimized, the standard techniques are insufficient to ensure the correctness of the transformations....
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Urbana, Ill.
1990
|
Schriftenreihe: | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report
993 |
Schlagworte: | |
Zusammenfassung: | Abstract: "The data-flow and dependence analysis techniques used in today's optimizing compilers have been designed for sequential source programs. When parallel source programs are to be optimized, the standard techniques are insufficient to ensure the correctness of the transformations. This paper presents eleven examples demonstrating how the standard techniques fail when applied to determinate and non-determinate parallel programs. A more general analysis technique is described that extends the work of Shasha and Snir and guarantees the correctness of optimizing transformations applied to programs with cobegin parallelism. Deadlock avoidance when transforming programs with synchronization is also discussed." |
Beschreibung: | 26 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV008973886 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940206s1990 |||| 00||| eng d | ||
035 | |a (OCoLC)23451159 | ||
035 | |a (DE-599)BVBBV008973886 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
100 | 1 | |a Midkiff, Sam |e Verfasser |4 aut | |
245 | 1 | 0 | |a Issues in the compile-time optimization of parallel programs |c Sam Midkiff and David Padua |
264 | 1 | |a Urbana, Ill. |c 1990 | |
300 | |a 26 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 993 | |
520 | 3 | |a Abstract: "The data-flow and dependence analysis techniques used in today's optimizing compilers have been designed for sequential source programs. When parallel source programs are to be optimized, the standard techniques are insufficient to ensure the correctness of the transformations. This paper presents eleven examples demonstrating how the standard techniques fail when applied to determinate and non-determinate parallel programs. A more general analysis technique is described that extends the work of Shasha and Snir and guarantees the correctness of optimizing transformations applied to programs with cobegin parallelism. Deadlock avoidance when transforming programs with synchronization is also discussed." | |
650 | 4 | |a Compiling (Electronic computers) | |
650 | 4 | |a Parallel programming (Computer science) | |
700 | 1 | |a Padua, David |e Verfasser |4 aut | |
830 | 0 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 993 |w (DE-604)BV008930033 |9 993 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-005925538 |
Datensatz im Suchindex
_version_ | 1804123311819456512 |
---|---|
any_adam_object | |
author | Midkiff, Sam Padua, David |
author_facet | Midkiff, Sam Padua, David |
author_role | aut aut |
author_sort | Midkiff, Sam |
author_variant | s m sm d p dp |
building | Verbundindex |
bvnumber | BV008973886 |
ctrlnum | (OCoLC)23451159 (DE-599)BVBBV008973886 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01781nam a2200313 cb4500</leader><controlfield tag="001">BV008973886</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)23451159</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008973886</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">Midkiff, Sam</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Issues in the compile-time optimization of parallel programs</subfield><subfield code="c">Sam Midkiff and David Padua</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">26 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">993</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The data-flow and dependence analysis techniques used in today's optimizing compilers have been designed for sequential source programs. When parallel source programs are to be optimized, the standard techniques are insufficient to ensure the correctness of the transformations. This paper presents eleven examples demonstrating how the standard techniques fail when applied to determinate and non-determinate parallel programs. A more general analysis technique is described that extends the work of Shasha and Snir and guarantees the correctness of optimizing transformations applied to programs with cobegin parallelism. Deadlock avoidance when transforming programs with synchronization is also discussed."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Compiling (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Padua, David</subfield><subfield code="e">Verfasser</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">993</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">993</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005925538</subfield></datafield></record></collection> |
id | DE-604.BV008973886 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:27:46Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005925538 |
oclc_num | 23451159 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 26 S. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
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 | Midkiff, Sam Verfasser aut Issues in the compile-time optimization of parallel programs Sam Midkiff and David Padua Urbana, Ill. 1990 26 S. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 993 Abstract: "The data-flow and dependence analysis techniques used in today's optimizing compilers have been designed for sequential source programs. When parallel source programs are to be optimized, the standard techniques are insufficient to ensure the correctness of the transformations. This paper presents eleven examples demonstrating how the standard techniques fail when applied to determinate and non-determinate parallel programs. A more general analysis technique is described that extends the work of Shasha and Snir and guarantees the correctness of optimizing transformations applied to programs with cobegin parallelism. Deadlock avoidance when transforming programs with synchronization is also discussed." Compiling (Electronic computers) Parallel programming (Computer science) Padua, David Verfasser aut Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 993 (DE-604)BV008930033 993 |
spellingShingle | Midkiff, Sam Padua, David Issues in the compile-time optimization of parallel programs Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report Compiling (Electronic computers) Parallel programming (Computer science) |
title | Issues in the compile-time optimization of parallel programs |
title_auth | Issues in the compile-time optimization of parallel programs |
title_exact_search | Issues in the compile-time optimization of parallel programs |
title_full | Issues in the compile-time optimization of parallel programs Sam Midkiff and David Padua |
title_fullStr | Issues in the compile-time optimization of parallel programs Sam Midkiff and David Padua |
title_full_unstemmed | Issues in the compile-time optimization of parallel programs Sam Midkiff and David Padua |
title_short | Issues in the compile-time optimization of parallel programs |
title_sort | issues in the compile time optimization of parallel programs |
topic | Compiling (Electronic computers) Parallel programming (Computer science) |
topic_facet | Compiling (Electronic computers) Parallel programming (Computer science) |
volume_link | (DE-604)BV008930033 |
work_keys_str_mv | AT midkiffsam issuesinthecompiletimeoptimizationofparallelprograms AT paduadavid issuesinthecompiletimeoptimizationofparallelprograms |