Compiler algorithms for event variable synchronization:
Abstract: "Event variable synchronization is a well-known mechanism for enforcing data dependences in a program that runs in parallel on a shared memory multiprocessor. This paper presents compiler algorithms to automatically generate event variable synchronization code. Previously published al...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Urbana, Ill.
1991
|
Schriftenreihe: | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report
1082 |
Schlagworte: | |
Zusammenfassung: | Abstract: "Event variable synchronization is a well-known mechanism for enforcing data dependences in a program that runs in parallel on a shared memory multiprocessor. This paper presents compiler algorithms to automatically generate event variable synchronization code. Previously published algorithms dealt with single parallel loops in which dependence distances are constant and known by the compiler. However, loops in real application programs are often arbitrarily nested. Moreover, compilers are often unable to determine dependence distances. In contrast, our algorithms generate synchronization code based directly on array subscripts and do not require constant distances in data dependences The algorithms are designed for arbitrarily nested loops (including triangular or trapezoidal loops). |
Beschreibung: | 10 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV009224764 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940313s1991 |||| 00||| eng d | ||
035 | |a (OCoLC)27130021 | ||
035 | |a (DE-599)BVBBV009224764 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
100 | 1 | |a Li, Zhiyuan |e Verfasser |4 aut | |
245 | 1 | 0 | |a Compiler algorithms for event variable synchronization |c Zhiyuan Li |
264 | 1 | |a Urbana, Ill. |c 1991 | |
300 | |a 10 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 1082 | |
520 | 3 | |a Abstract: "Event variable synchronization is a well-known mechanism for enforcing data dependences in a program that runs in parallel on a shared memory multiprocessor. This paper presents compiler algorithms to automatically generate event variable synchronization code. Previously published algorithms dealt with single parallel loops in which dependence distances are constant and known by the compiler. However, loops in real application programs are often arbitrarily nested. Moreover, compilers are often unable to determine dependence distances. In contrast, our algorithms generate synchronization code based directly on array subscripts and do not require constant distances in data dependences | |
520 | 3 | |a The algorithms are designed for arbitrarily nested loops (including triangular or trapezoidal loops). | |
650 | 4 | |a Compilers (Computer programs) | |
650 | 4 | |a Multiprocessors | |
830 | 0 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 1082 |w (DE-604)BV008930033 |9 1082 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006133937 |
Datensatz im Suchindex
_version_ | 1804123667824640000 |
---|---|
any_adam_object | |
author | Li, Zhiyuan |
author_facet | Li, Zhiyuan |
author_role | aut |
author_sort | Li, Zhiyuan |
author_variant | z l zl |
building | Verbundindex |
bvnumber | BV009224764 |
ctrlnum | (OCoLC)27130021 (DE-599)BVBBV009224764 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01788nam a2200313 cb4500</leader><controlfield tag="001">BV009224764</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)27130021</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009224764</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">Li, Zhiyuan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Compiler algorithms for event variable synchronization</subfield><subfield code="c">Zhiyuan Li</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">10 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">1082</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Event variable synchronization is a well-known mechanism for enforcing data dependences in a program that runs in parallel on a shared memory multiprocessor. This paper presents compiler algorithms to automatically generate event variable synchronization code. Previously published algorithms dealt with single parallel loops in which dependence distances are constant and known by the compiler. However, loops in real application programs are often arbitrarily nested. Moreover, compilers are often unable to determine dependence distances. In contrast, our algorithms generate synchronization code based directly on array subscripts and do not require constant distances in data dependences</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The algorithms are designed for arbitrarily nested loops (including triangular or trapezoidal loops).</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">Multiprocessors</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">1082</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">1082</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006133937</subfield></datafield></record></collection> |
id | DE-604.BV009224764 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:33:25Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006133937 |
oclc_num | 27130021 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 10 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 | Li, Zhiyuan Verfasser aut Compiler algorithms for event variable synchronization Zhiyuan Li Urbana, Ill. 1991 10 S. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 1082 Abstract: "Event variable synchronization is a well-known mechanism for enforcing data dependences in a program that runs in parallel on a shared memory multiprocessor. This paper presents compiler algorithms to automatically generate event variable synchronization code. Previously published algorithms dealt with single parallel loops in which dependence distances are constant and known by the compiler. However, loops in real application programs are often arbitrarily nested. Moreover, compilers are often unable to determine dependence distances. In contrast, our algorithms generate synchronization code based directly on array subscripts and do not require constant distances in data dependences The algorithms are designed for arbitrarily nested loops (including triangular or trapezoidal loops). Compilers (Computer programs) Multiprocessors Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 1082 (DE-604)BV008930033 1082 |
spellingShingle | Li, Zhiyuan Compiler algorithms for event variable synchronization Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report Compilers (Computer programs) Multiprocessors |
title | Compiler algorithms for event variable synchronization |
title_auth | Compiler algorithms for event variable synchronization |
title_exact_search | Compiler algorithms for event variable synchronization |
title_full | Compiler algorithms for event variable synchronization Zhiyuan Li |
title_fullStr | Compiler algorithms for event variable synchronization Zhiyuan Li |
title_full_unstemmed | Compiler algorithms for event variable synchronization Zhiyuan Li |
title_short | Compiler algorithms for event variable synchronization |
title_sort | compiler algorithms for event variable synchronization |
topic | Compilers (Computer programs) Multiprocessors |
topic_facet | Compilers (Computer programs) Multiprocessors |
volume_link | (DE-604)BV008930033 |
work_keys_str_mv | AT lizhiyuan compileralgorithmsforeventvariablesynchronization |