Source level debugging of automatically parallelized programs:
Abstract: "Parallelizing compilers automatically translate a sequential program into a parallel program. They simplify parallel programming by freeing the user from the need to consider the details of the parallel architecture and the parallel decomposition. A source-level debugger for automati...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Pittsburgh, PA
School of Computer Science, Carnegie Mellon Univ.
1992
|
| Schriftenreihe: | School of Computer Science <Pittsburgh, Pa.>: CMU-CS
1992,204 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Parallelizing compilers automatically translate a sequential program into a parallel program. They simplify parallel programming by freeing the user from the need to consider the details of the parallel architecture and the parallel decomposition. A source-level debugger for automatically parallelized programs hides the parallelism from the user by providing the illusion that the original sequential program is executing. To provide a source-level view, a debugger has two tasks. The first task is to make it appear that programs execute operations in source order. To exploit parallelism, compilers relax the ordering constraints implied by the semantics of the source language As a result, operations are not executed in source order and when a user is debugging a program, it may appear that variables are updated out of order. Sequential languages and languages with explicit parallelism share this problem. Dynamic order restoration is a method for making it appear that operations are executed in source order. The second task is to hide the decomposition of data and computation. A parallelizing compiler partitions data, duplicates variables, and changes the structure of loops. To provide a source-level view, the debugger must be able to map variables and statements in the source programs to their corresponding variables and statements in the target program We call this structural mapping. This thesis describes a method for implementing dynamic order restoration and structural mapping in a debugger for automatically parallelized programs. Examples are taken from the domain of loop-based parallelism. |
| Beschreibung: | Zugl.: Pittsburgh, Pa., Univ., Diss., 1992 |
| Beschreibung: | VI, 129 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010171077 | ||
| 003 | DE-604 | ||
| 005 | 19950509 | ||
| 007 | t | ||
| 008 | 950509s1992 m||| 00||| eng d | ||
| 035 | |a (OCoLC)27308305 | ||
| 035 | |a (DE-599)BVBBV010171077 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 | ||
| 082 | 0 | |a 510.7808 |b C28r 92-204 | |
| 084 | |a DAT 516d |2 stub | ||
| 084 | |a DAT 330d |2 stub | ||
| 088 | |a CMU CS 92 204 | ||
| 100 | 1 | |a Cohn, Robert |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Source level debugging of automatically parallelized programs |c Robert Cohn |
| 246 | 1 | 3 | |a CMU CS 92 204 |
| 246 | 1 | 3 | |a Source-level debugging of automatically parallelized programs |
| 264 | 1 | |a Pittsburgh, PA |b School of Computer Science, Carnegie Mellon Univ. |c 1992 | |
| 300 | |a VI, 129 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a School of Computer Science <Pittsburgh, Pa.>: CMU-CS |v 1992,204 | |
| 500 | |a Zugl.: Pittsburgh, Pa., Univ., Diss., 1992 | ||
| 520 | 3 | |a Abstract: "Parallelizing compilers automatically translate a sequential program into a parallel program. They simplify parallel programming by freeing the user from the need to consider the details of the parallel architecture and the parallel decomposition. A source-level debugger for automatically parallelized programs hides the parallelism from the user by providing the illusion that the original sequential program is executing. To provide a source-level view, a debugger has two tasks. The first task is to make it appear that programs execute operations in source order. To exploit parallelism, compilers relax the ordering constraints implied by the semantics of the source language | |
| 520 | 3 | |a As a result, operations are not executed in source order and when a user is debugging a program, it may appear that variables are updated out of order. Sequential languages and languages with explicit parallelism share this problem. Dynamic order restoration is a method for making it appear that operations are executed in source order. The second task is to hide the decomposition of data and computation. A parallelizing compiler partitions data, duplicates variables, and changes the structure of loops. To provide a source-level view, the debugger must be able to map variables and statements in the source programs to their corresponding variables and statements in the target program | |
| 520 | 3 | |a We call this structural mapping. This thesis describes a method for implementing dynamic order restoration and structural mapping in a debugger for automatically parallelized programs. Examples are taken from the domain of loop-based parallelism. | |
| 650 | 4 | |a Debugging in computer science | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Debugging |0 (DE-588)4148954-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 0 | 1 | |a Debugging |0 (DE-588)4148954-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a School of Computer Science <Pittsburgh, Pa.>: CMU-CS |v 1992,204 |w (DE-604)BV006187264 |9 1992,204 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006755577 | ||
Datensatz im Suchindex
| _version_ | 1804124568092147712 |
|---|---|
| any_adam_object | |
| author | Cohn, Robert |
| author_facet | Cohn, Robert |
| author_role | aut |
| author_sort | Cohn, Robert |
| author_variant | r c rc |
| building | Verbundindex |
| bvnumber | BV010171077 |
| classification_tum | DAT 516d DAT 330d |
| ctrlnum | (OCoLC)27308305 (DE-599)BVBBV010171077 |
| dewey-full | 510.7808 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510.7808 |
| dewey-search | 510.7808 |
| dewey-sort | 3510.7808 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03302nam a2200481 cb4500</leader><controlfield tag="001">BV010171077</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19950509 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950509s1992 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27308305</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010171077</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-91</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510.7808</subfield><subfield code="b">C28r 92-204</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 516d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 330d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">CMU CS 92 204</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cohn, Robert</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Source level debugging of automatically parallelized programs</subfield><subfield code="c">Robert Cohn</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">CMU CS 92 204</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Source-level debugging of automatically parallelized programs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pittsburgh, PA</subfield><subfield code="b">School of Computer Science, Carnegie Mellon Univ.</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VI, 129 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">School of Computer Science <Pittsburgh, Pa.>: CMU-CS</subfield><subfield code="v">1992,204</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Pittsburgh, Pa., Univ., Diss., 1992</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Parallelizing compilers automatically translate a sequential program into a parallel program. They simplify parallel programming by freeing the user from the need to consider the details of the parallel architecture and the parallel decomposition. A source-level debugger for automatically parallelized programs hides the parallelism from the user by providing the illusion that the original sequential program is executing. To provide a source-level view, a debugger has two tasks. The first task is to make it appear that programs execute operations in source order. To exploit parallelism, compilers relax the ordering constraints implied by the semantics of the source language</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">As a result, operations are not executed in source order and when a user is debugging a program, it may appear that variables are updated out of order. Sequential languages and languages with explicit parallelism share this problem. Dynamic order restoration is a method for making it appear that operations are executed in source order. The second task is to hide the decomposition of data and computation. A parallelizing compiler partitions data, duplicates variables, and changes the structure of loops. To provide a source-level view, the debugger must be able to map variables and statements in the source programs to their corresponding variables and statements in the target program</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We call this structural mapping. This thesis describes a method for implementing dynamic order restoration and structural mapping in a debugger for automatically parallelized programs. Examples are taken from the domain of loop-based parallelism.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Debugging in computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Debugging</subfield><subfield code="0">(DE-588)4148954-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="689" ind1="0" ind2="0"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Debugging</subfield><subfield code="0">(DE-588)4148954-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">School of Computer Science <Pittsburgh, Pa.>: CMU-CS</subfield><subfield code="v">1992,204</subfield><subfield code="w">(DE-604)BV006187264</subfield><subfield code="9">1992,204</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006755577</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV010171077 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:44Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006755577 |
| oclc_num | 27308305 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | VI, 129 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | School of Computer Science, Carnegie Mellon Univ. |
| record_format | marc |
| series | School of Computer Science <Pittsburgh, Pa.>: CMU-CS |
| series2 | School of Computer Science <Pittsburgh, Pa.>: CMU-CS |
| spelling | Cohn, Robert Verfasser aut Source level debugging of automatically parallelized programs Robert Cohn CMU CS 92 204 Source-level debugging of automatically parallelized programs Pittsburgh, PA School of Computer Science, Carnegie Mellon Univ. 1992 VI, 129 S. txt rdacontent n rdamedia nc rdacarrier School of Computer Science <Pittsburgh, Pa.>: CMU-CS 1992,204 Zugl.: Pittsburgh, Pa., Univ., Diss., 1992 Abstract: "Parallelizing compilers automatically translate a sequential program into a parallel program. They simplify parallel programming by freeing the user from the need to consider the details of the parallel architecture and the parallel decomposition. A source-level debugger for automatically parallelized programs hides the parallelism from the user by providing the illusion that the original sequential program is executing. To provide a source-level view, a debugger has two tasks. The first task is to make it appear that programs execute operations in source order. To exploit parallelism, compilers relax the ordering constraints implied by the semantics of the source language As a result, operations are not executed in source order and when a user is debugging a program, it may appear that variables are updated out of order. Sequential languages and languages with explicit parallelism share this problem. Dynamic order restoration is a method for making it appear that operations are executed in source order. The second task is to hide the decomposition of data and computation. A parallelizing compiler partitions data, duplicates variables, and changes the structure of loops. To provide a source-level view, the debugger must be able to map variables and statements in the source programs to their corresponding variables and statements in the target program We call this structural mapping. This thesis describes a method for implementing dynamic order restoration and structural mapping in a debugger for automatically parallelized programs. Examples are taken from the domain of loop-based parallelism. Debugging in computer science Parallel programming (Computer science) Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Debugging (DE-588)4148954-8 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Parallelverarbeitung (DE-588)4075860-6 s Debugging (DE-588)4148954-8 s DE-604 School of Computer Science <Pittsburgh, Pa.>: CMU-CS 1992,204 (DE-604)BV006187264 1992,204 |
| spellingShingle | Cohn, Robert Source level debugging of automatically parallelized programs School of Computer Science <Pittsburgh, Pa.>: CMU-CS Debugging in computer science Parallel programming (Computer science) Parallelverarbeitung (DE-588)4075860-6 gnd Debugging (DE-588)4148954-8 gnd |
| subject_GND | (DE-588)4075860-6 (DE-588)4148954-8 (DE-588)4113937-9 |
| title | Source level debugging of automatically parallelized programs |
| title_alt | CMU CS 92 204 Source-level debugging of automatically parallelized programs |
| title_auth | Source level debugging of automatically parallelized programs |
| title_exact_search | Source level debugging of automatically parallelized programs |
| title_full | Source level debugging of automatically parallelized programs Robert Cohn |
| title_fullStr | Source level debugging of automatically parallelized programs Robert Cohn |
| title_full_unstemmed | Source level debugging of automatically parallelized programs Robert Cohn |
| title_short | Source level debugging of automatically parallelized programs |
| title_sort | source level debugging of automatically parallelized programs |
| topic | Debugging in computer science Parallel programming (Computer science) Parallelverarbeitung (DE-588)4075860-6 gnd Debugging (DE-588)4148954-8 gnd |
| topic_facet | Debugging in computer science Parallel programming (Computer science) Parallelverarbeitung Debugging Hochschulschrift |
| volume_link | (DE-604)BV006187264 |
| work_keys_str_mv | AT cohnrobert sourceleveldebuggingofautomaticallyparallelizedprograms AT cohnrobert cmucs92204 |