Loop quantization: unwinding for fine grain parallelism exploitation:
Loop unwinding is a well known technique for reducing loop overhead, exposing parallelism and increasing the efficiency of pipelining. Traditional loop unwinding is limited to the innermost loop in a group of nested loops and the amount of unwinding is either fixed or has to be specified by the user...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1985
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
709 |
| Schlagworte: | |
| Zusammenfassung: | Loop unwinding is a well known technique for reducing loop overhead, exposing parallelism and increasing the efficiency of pipelining. Traditional loop unwinding is limited to the innermost loop in a group of nested loops and the amount of unwinding is either fixed or has to be specified by the user, on a case by case basis. In this paper we present a general technique for automatically unwinding multply nested loops, explain its advantages over other transformation techniques and illustrates its practical effectiveness. |
| Beschreibung: | 19 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010589787 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960130s1985 |||| 00||| engod | ||
| 035 | |a (OCoLC)14638257 | ||
| 035 | |a (DE-599)BVBBV010589787 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Nicolau, Alexandru |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Loop quantization: unwinding for fine grain parallelism exploitation |
| 264 | 1 | |a Ithaca, New York |c 1985 | |
| 300 | |a 19 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 709 | |
| 520 | 3 | |a Loop unwinding is a well known technique for reducing loop overhead, exposing parallelism and increasing the efficiency of pipelining. Traditional loop unwinding is limited to the innermost loop in a group of nested loops and the amount of unwinding is either fixed or has to be specified by the user, on a case by case basis. In this paper we present a general technique for automatically unwinding multply nested loops, explain its advantages over other transformation techniques and illustrates its practical effectiveness. | |
| 650 | 4 | |a Computer programs | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 709 |w (DE-604)BV006185504 |9 709 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007061646 | ||
Datensatz im Suchindex
| _version_ | 1804125060608294912 |
|---|---|
| any_adam_object | |
| author | Nicolau, Alexandru |
| author_facet | Nicolau, Alexandru |
| author_role | aut |
| author_sort | Nicolau, Alexandru |
| author_variant | a n an |
| building | Verbundindex |
| bvnumber | BV010589787 |
| ctrlnum | (OCoLC)14638257 (DE-599)BVBBV010589787 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01525nam a2200301 cb4500</leader><controlfield tag="001">BV010589787</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960130s1985 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)14638257</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010589787</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nicolau, Alexandru</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Loop quantization: unwinding for fine grain parallelism exploitation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 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">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">709</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Loop unwinding is a well known technique for reducing loop overhead, exposing parallelism and increasing the efficiency of pipelining. Traditional loop unwinding is limited to the innermost loop in a group of nested loops and the amount of unwinding is either fixed or has to be specified by the user, on a case by case basis. In this paper we present a general technique for automatically unwinding multply nested loops, explain its advantages over other transformation techniques and illustrates its practical effectiveness.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">709</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">709</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007061646</subfield></datafield></record></collection> |
| id | DE-604.BV010589787 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:33Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007061646 |
| oclc_num | 14638257 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 19 S. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Nicolau, Alexandru Verfasser aut Loop quantization: unwinding for fine grain parallelism exploitation Ithaca, New York 1985 19 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 709 Loop unwinding is a well known technique for reducing loop overhead, exposing parallelism and increasing the efficiency of pipelining. Traditional loop unwinding is limited to the innermost loop in a group of nested loops and the amount of unwinding is either fixed or has to be specified by the user, on a case by case basis. In this paper we present a general technique for automatically unwinding multply nested loops, explain its advantages over other transformation techniques and illustrates its practical effectiveness. Computer programs Parallel processing (Electronic computers) Department of Computer Science: Technical report Cornell University <Ithaca, NY> 709 (DE-604)BV006185504 709 |
| spellingShingle | Nicolau, Alexandru Loop quantization: unwinding for fine grain parallelism exploitation Computer programs Parallel processing (Electronic computers) |
| title | Loop quantization: unwinding for fine grain parallelism exploitation |
| title_auth | Loop quantization: unwinding for fine grain parallelism exploitation |
| title_exact_search | Loop quantization: unwinding for fine grain parallelism exploitation |
| title_full | Loop quantization: unwinding for fine grain parallelism exploitation |
| title_fullStr | Loop quantization: unwinding for fine grain parallelism exploitation |
| title_full_unstemmed | Loop quantization: unwinding for fine grain parallelism exploitation |
| title_short | Loop quantization: unwinding for fine grain parallelism exploitation |
| title_sort | loop quantization unwinding for fine grain parallelism exploitation |
| topic | Computer programs Parallel processing (Electronic computers) |
| topic_facet | Computer programs Parallel processing (Electronic computers) |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT nicolaualexandru loopquantizationunwindingforfinegrainparallelismexploitation |