Compiler-directed data prefetching in multiprocessors with memory hierarchies:
Abstract: "Memory heirarchies are used by multiprocessor systems to reduce large memory access times. It is necessary to automatically manage such a hierarchy, to obtain effective memory utilization. In this paper, we discuss the various issues involved in obtaining an optimal memory management...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Urbana, Ill.
1990
|
| Schriftenreihe: | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report
996 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Memory heirarchies are used by multiprocessor systems to reduce large memory access times. It is necessary to automatically manage such a hierarchy, to obtain effective memory utilization. In this paper, we discuss the various issues involved in obtaining an optimal memory management strategy for a memory hierarchy. We present an algorithm for finding the earliest point in a program that a block of data can be prefetched. This determination is based on the control and the data dependences in the program. Such a method is an integral part of more general memory management algorithms We demonstrate our method's potential by using static analysis to estimate the performance improvement afforded by our prefetching strategy and to analyze the reference patterns in a set of Fortran benchmarks. We also study the effectiveness of prefetching in a realistic shared-memory system using an RTL-level simulator and real codes. This differs from previous studies by considering prefetching benefits in the presence of network contention. |
| Beschreibung: | 15 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008973884 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24116781 | ||
| 035 | |a (DE-599)BVBBV008973884 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Gornish, Edward H. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Compiler-directed data prefetching in multiprocessors with memory hierarchies |c Edard H. Gornish, Elana D. Granston, and Alexander V. Veidenbaum |
| 264 | 1 | |a Urbana, Ill. |c 1990 | |
| 300 | |a 15 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 996 | |
| 520 | 3 | |a Abstract: "Memory heirarchies are used by multiprocessor systems to reduce large memory access times. It is necessary to automatically manage such a hierarchy, to obtain effective memory utilization. In this paper, we discuss the various issues involved in obtaining an optimal memory management strategy for a memory hierarchy. We present an algorithm for finding the earliest point in a program that a block of data can be prefetched. This determination is based on the control and the data dependences in the program. Such a method is an integral part of more general memory management algorithms | |
| 520 | 3 | |a We demonstrate our method's potential by using static analysis to estimate the performance improvement afforded by our prefetching strategy and to analyze the reference patterns in a set of Fortran benchmarks. We also study the effectiveness of prefetching in a realistic shared-memory system using an RTL-level simulator and real codes. This differs from previous studies by considering prefetching benefits in the presence of network contention. | |
| 650 | 4 | |a Computer storage devices | |
| 650 | 4 | |a Multiprocessors | |
| 700 | 1 | |a Granston, Elana D. |e Verfasser |4 aut | |
| 700 | 1 | |a Veidenbaum, Alexander V. |e Verfasser |4 aut | |
| 830 | 0 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 996 |w (DE-604)BV008930033 |9 996 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005925536 | ||
Datensatz im Suchindex
| _version_ | 1804123311833088000 |
|---|---|
| any_adam_object | |
| author | Gornish, Edward H. Granston, Elana D. Veidenbaum, Alexander V. |
| author_facet | Gornish, Edward H. Granston, Elana D. Veidenbaum, Alexander V. |
| author_role | aut aut aut |
| author_sort | Gornish, Edward H. |
| author_variant | e h g eh ehg e d g ed edg a v v av avv |
| building | Verbundindex |
| bvnumber | BV008973884 |
| ctrlnum | (OCoLC)24116781 (DE-599)BVBBV008973884 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02214nam a2200337 cb4500</leader><controlfield tag="001">BV008973884</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)24116781</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008973884</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">Gornish, Edward H.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Compiler-directed data prefetching in multiprocessors with memory hierarchies</subfield><subfield code="c">Edard H. Gornish, Elana D. Granston, and Alexander V. Veidenbaum</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">15 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">996</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Memory heirarchies are used by multiprocessor systems to reduce large memory access times. It is necessary to automatically manage such a hierarchy, to obtain effective memory utilization. In this paper, we discuss the various issues involved in obtaining an optimal memory management strategy for a memory hierarchy. We present an algorithm for finding the earliest point in a program that a block of data can be prefetched. This determination is based on the control and the data dependences in the program. Such a method is an integral part of more general memory management algorithms</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We demonstrate our method's potential by using static analysis to estimate the performance improvement afforded by our prefetching strategy and to analyze the reference patterns in a set of Fortran benchmarks. We also study the effectiveness of prefetching in a realistic shared-memory system using an RTL-level simulator and real codes. This differs from previous studies by considering prefetching benefits in the presence of network contention.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer storage devices</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Granston, Elana D.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Veidenbaum, Alexander V.</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">996</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">996</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005925536</subfield></datafield></record></collection> |
| id | DE-604.BV008973884 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:46Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005925536 |
| oclc_num | 24116781 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 15 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 | Gornish, Edward H. Verfasser aut Compiler-directed data prefetching in multiprocessors with memory hierarchies Edard H. Gornish, Elana D. Granston, and Alexander V. Veidenbaum Urbana, Ill. 1990 15 S. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 996 Abstract: "Memory heirarchies are used by multiprocessor systems to reduce large memory access times. It is necessary to automatically manage such a hierarchy, to obtain effective memory utilization. In this paper, we discuss the various issues involved in obtaining an optimal memory management strategy for a memory hierarchy. We present an algorithm for finding the earliest point in a program that a block of data can be prefetched. This determination is based on the control and the data dependences in the program. Such a method is an integral part of more general memory management algorithms We demonstrate our method's potential by using static analysis to estimate the performance improvement afforded by our prefetching strategy and to analyze the reference patterns in a set of Fortran benchmarks. We also study the effectiveness of prefetching in a realistic shared-memory system using an RTL-level simulator and real codes. This differs from previous studies by considering prefetching benefits in the presence of network contention. Computer storage devices Multiprocessors Granston, Elana D. Verfasser aut Veidenbaum, Alexander V. Verfasser aut Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 996 (DE-604)BV008930033 996 |
| spellingShingle | Gornish, Edward H. Granston, Elana D. Veidenbaum, Alexander V. Compiler-directed data prefetching in multiprocessors with memory hierarchies Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report Computer storage devices Multiprocessors |
| title | Compiler-directed data prefetching in multiprocessors with memory hierarchies |
| title_auth | Compiler-directed data prefetching in multiprocessors with memory hierarchies |
| title_exact_search | Compiler-directed data prefetching in multiprocessors with memory hierarchies |
| title_full | Compiler-directed data prefetching in multiprocessors with memory hierarchies Edard H. Gornish, Elana D. Granston, and Alexander V. Veidenbaum |
| title_fullStr | Compiler-directed data prefetching in multiprocessors with memory hierarchies Edard H. Gornish, Elana D. Granston, and Alexander V. Veidenbaum |
| title_full_unstemmed | Compiler-directed data prefetching in multiprocessors with memory hierarchies Edard H. Gornish, Elana D. Granston, and Alexander V. Veidenbaum |
| title_short | Compiler-directed data prefetching in multiprocessors with memory hierarchies |
| title_sort | compiler directed data prefetching in multiprocessors with memory hierarchies |
| topic | Computer storage devices Multiprocessors |
| topic_facet | Computer storage devices Multiprocessors |
| volume_link | (DE-604)BV008930033 |
| work_keys_str_mv | AT gornishedwardh compilerdirecteddataprefetchinginmultiprocessorswithmemoryhierarchies AT granstonelanad compilerdirecteddataprefetchinginmultiprocessorswithmemoryhierarchies AT veidenbaumalexanderv compilerdirecteddataprefetchinginmultiprocessorswithmemoryhierarchies |