Loop parallelization:
The job of a restructuring compiler is to discover the dependence structure of a given program and transform the program in a way that is consistent with both that dependence structure and the characteristics of the given machine. Much attention in this field of research has been focused on the Fort...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Boston u.a.
Kluwer
1994
|
| Schriftenreihe: | Loop transformations for restructuring compilers
|
| Schlagwörter: | |
| Zusammenfassung: | The job of a restructuring compiler is to discover the dependence structure of a given program and transform the program in a way that is consistent with both that dependence structure and the characteristics of the given machine. Much attention in this field of research has been focused on the Fortran do loop. This is where one expects to find major chunks of computation that need to be performed repeatedly for different values of the index variable Many loop transformations have been designed over the years, and several of them can be found in any parallelizing compiler currently in use in industry or at a university research facility |
| Abstract: | Automatic Transformation of sequential program into a parallel form is a subject that presents a great intellectual challenge and promises a large practical reward. There is a tremendous investment in existing sequential programs, and scientists and engineers continue to write their application programs in sequential languages (primarily in Fortran). The demand for higher and higher speedups keeps going up |
| Umfang: | XVIII, 174 S. graph. Darst. |
| ISBN: | 0792394550 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV009774269 | ||
| 003 | DE-604 | ||
| 005 | 20050606 | ||
| 007 | t| | ||
| 008 | 940824s1994 xx d||| |||| 00||| eng d | ||
| 020 | |a 0792394550 |9 0-7923-9455-0 | ||
| 035 | |a (OCoLC)30078540 | ||
| 035 | |a (DE-599)BVBBV009774269 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-29T | ||
| 050 | 0 | |a QA76.642 | |
| 082 | 0 | |a 005.4/53 |2 20 | |
| 084 | |a ST 255 |0 (DE-625)143629: |2 rvk | ||
| 100 | 1 | |a Banerjee, Utpal |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Loop parallelization |c Utpal Banerjee |
| 264 | 1 | |a Boston u.a. |b Kluwer |c 1994 | |
| 300 | |a XVIII, 174 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Loop transformations for restructuring compilers | |
| 520 | 3 | |a Automatic Transformation of sequential program into a parallel form is a subject that presents a great intellectual challenge and promises a large practical reward. There is a tremendous investment in existing sequential programs, and scientists and engineers continue to write their application programs in sequential languages (primarily in Fortran). The demand for higher and higher speedups keeps going up | |
| 520 | |a The job of a restructuring compiler is to discover the dependence structure of a given program and transform the program in a way that is consistent with both that dependence structure and the characteristics of the given machine. Much attention in this field of research has been focused on the Fortran do loop. This is where one expects to find major chunks of computation that need to be performed repeatedly for different values of the index variable | ||
| 520 | |a Many loop transformations have been designed over the years, and several of them can be found in any parallelizing compiler currently in use in industry or at a university research facility | ||
| 650 | 4 | |a Compilers (Computer programs) | |
| 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 Compiler |0 (DE-588)4148248-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmschleife |0 (DE-588)4343964-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Programmschleife |0 (DE-588)4343964-0 |D s |
| 689 | 0 | 1 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 0 | 2 | |a Compiler |0 (DE-588)4148248-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006466837 | |
Datensatz im Suchindex
| _version_ | 1818951910440304640 |
|---|---|
| any_adam_object | |
| author | Banerjee, Utpal |
| author_facet | Banerjee, Utpal |
| author_role | aut |
| author_sort | Banerjee, Utpal |
| author_variant | u b ub |
| building | Verbundindex |
| bvnumber | BV009774269 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.642 |
| callnumber-search | QA76.642 |
| callnumber-sort | QA 276.642 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 255 |
| ctrlnum | (OCoLC)30078540 (DE-599)BVBBV009774269 |
| dewey-full | 005.4/53 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.4/53 |
| dewey-search | 005.4/53 |
| dewey-sort | 15.4 253 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02448nam a2200445 c 4500</leader><controlfield tag="001">BV009774269</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20050606 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940824s1994 xx d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0792394550</subfield><subfield code="9">0-7923-9455-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)30078540</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009774269</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-739</subfield><subfield code="a">DE-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.642</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.4/53</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 255</subfield><subfield code="0">(DE-625)143629:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Banerjee, Utpal</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Loop parallelization</subfield><subfield code="c">Utpal Banerjee</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston u.a.</subfield><subfield code="b">Kluwer</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVIII, 174 S.</subfield><subfield code="b">graph. Darst.</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="0" ind2=" "><subfield code="a">Loop transformations for restructuring compilers</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Automatic Transformation of sequential program into a parallel form is a subject that presents a great intellectual challenge and promises a large practical reward. There is a tremendous investment in existing sequential programs, and scientists and engineers continue to write their application programs in sequential languages (primarily in Fortran). The demand for higher and higher speedups keeps going up</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The job of a restructuring compiler is to discover the dependence structure of a given program and transform the program in a way that is consistent with both that dependence structure and the characteristics of the given machine. Much attention in this field of research has been focused on the Fortran do loop. This is where one expects to find major chunks of computation that need to be performed repeatedly for different values of the index variable</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Many loop transformations have been designed over the years, and several of them can be found in any parallelizing compiler currently in use in industry or at a university research facility</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">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">Compiler</subfield><subfield code="0">(DE-588)4148248-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmschleife</subfield><subfield code="0">(DE-588)4343964-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Programmschleife</subfield><subfield code="0">(DE-588)4343964-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="2"><subfield code="a">Compiler</subfield><subfield code="0">(DE-588)4148248-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006466837</subfield></datafield></record></collection> |
| id | DE-604.BV009774269 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T09:41:59Z |
| institution | BVB |
| isbn | 0792394550 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006466837 |
| oclc_num | 30078540 |
| open_access_boolean | |
| owner | DE-739 DE-29T |
| owner_facet | DE-739 DE-29T |
| physical | XVIII, 174 S. graph. Darst. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Kluwer |
| record_format | marc |
| series2 | Loop transformations for restructuring compilers |
| spelling | Banerjee, Utpal Verfasser aut Loop parallelization Utpal Banerjee Boston u.a. Kluwer 1994 XVIII, 174 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Loop transformations for restructuring compilers Automatic Transformation of sequential program into a parallel form is a subject that presents a great intellectual challenge and promises a large practical reward. There is a tremendous investment in existing sequential programs, and scientists and engineers continue to write their application programs in sequential languages (primarily in Fortran). The demand for higher and higher speedups keeps going up The job of a restructuring compiler is to discover the dependence structure of a given program and transform the program in a way that is consistent with both that dependence structure and the characteristics of the given machine. Much attention in this field of research has been focused on the Fortran do loop. This is where one expects to find major chunks of computation that need to be performed repeatedly for different values of the index variable Many loop transformations have been designed over the years, and several of them can be found in any parallelizing compiler currently in use in industry or at a university research facility Compilers (Computer programs) Parallel programming (Computer science) Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Compiler (DE-588)4148248-7 gnd rswk-swf Programmschleife (DE-588)4343964-0 gnd rswk-swf Programmschleife (DE-588)4343964-0 s Parallelverarbeitung (DE-588)4075860-6 s Compiler (DE-588)4148248-7 s DE-604 |
| spellingShingle | Banerjee, Utpal Loop parallelization Compilers (Computer programs) Parallel programming (Computer science) Parallelverarbeitung (DE-588)4075860-6 gnd Compiler (DE-588)4148248-7 gnd Programmschleife (DE-588)4343964-0 gnd |
| subject_GND | (DE-588)4075860-6 (DE-588)4148248-7 (DE-588)4343964-0 |
| title | Loop parallelization |
| title_auth | Loop parallelization |
| title_exact_search | Loop parallelization |
| title_full | Loop parallelization Utpal Banerjee |
| title_fullStr | Loop parallelization Utpal Banerjee |
| title_full_unstemmed | Loop parallelization Utpal Banerjee |
| title_short | Loop parallelization |
| title_sort | loop parallelization |
| topic | Compilers (Computer programs) Parallel programming (Computer science) Parallelverarbeitung (DE-588)4075860-6 gnd Compiler (DE-588)4148248-7 gnd Programmschleife (DE-588)4343964-0 gnd |
| topic_facet | Compilers (Computer programs) Parallel programming (Computer science) Parallelverarbeitung Compiler Programmschleife |
| work_keys_str_mv | AT banerjeeutpal loopparallelization |