Compiler-controlled memory
Optimizations aimed at reducing the impact of memory operations on execution speed have long concentrated on improving cache performance. These efforts achieve a. reasonable level of success. The primary limit on the compiler's ability to improve memory behavior is its imperfect knowledge about...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 11 |
---|---|
container_issue | |
container_start_page | 2 |
container_title | |
container_volume | |
creator | Cooper, Keith D. Harvey, Timothy J. |
description | Optimizations aimed at reducing the impact of memory operations on execution speed have long concentrated on improving cache performance. These efforts achieve a. reasonable level of success. The primary limit on the compiler's ability to improve memory behavior is its imperfect knowledge about the run-time behavior of the program. The compiler cannot completely predict runtime access patterns.There is an exception to this rule. During the register allocation phase, the compiler often must insert substantial amounts of spill code; that is, instructions that move values from registers to memory and back again. Because the compiler itself inserts these memory instructions, it has more knowledge about them than other memory operations in the program.Spill-code operations are disjoint from the memory manipulations required by the semantics of the program being compiled, and, indeed, the two can interfere in the cache. This paper proposes a hardware solution to the problem of increased spill costs---a small compiler-controlled memory (CCM) to hold spilled values. This small random-access memory can (and should) be placed in a distinct address space from the main memory hierarchy. The compiler can target spill instructions to use the CCM, moving most compiler-inserted memory traffic out of the pathway to main memory and eliminating any impact that those spill instructions would have on the state of the main memory hierarchy. Such memories already exist on some DSP microprocessors. Our techniques can be applied directly on those chips.This paper presents two compiler-based methods to exploit such a memory, along with experimental results showing that speedups from using CCM may be sizable. It shows that using the register allocation's coloring paradigm to assign spilled values to memory can greatly reduce the amount of memory required by a program. |
doi_str_mv | 10.1145/291069.291010 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>proquest_acm_b</sourceid><recordid>TN_cdi_proquest_miscellaneous_31079450</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>31079450</sourcerecordid><originalsourceid>FETCH-LOGICAL-a1380-12c3e33d952add4f884d1187f9664eeea67323e2ca4e5e3d2bdaa536fdfe42173</originalsourceid><addsrcrecordid>eNqNkD1PwzAURS0BElXJyMLExETKe_5I7BFFUJAqscBsOfGzFHDqErcD_56UILEy3eEeXekexi4RVohS3XGDUJnVMRBOWGFqjUojCoTanLIFYCVKZTScsyLndwCYOi0NX7CrJg27PtJYdmm7H1OM5K8HGtL4dcHOgouZit9csrfHh9fmqdy8rJ-b-03pphEokXeChPBGcee9DFpLj6jrYKpKEpGrasEF8c5JUiQ8b71zSlTBB5Ica7FkN_PubkyfB8p7O_S5oxjdltIh258XUsEf6LrBtil9ZItgjwbsbMDOBibw9l-gbceegvgGeqdXzw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>31079450</pqid></control><display><type>conference_proceeding</type><title>Compiler-controlled memory</title><source>ACM Digital Library</source><creator>Cooper, Keith D. ; Harvey, Timothy J.</creator><creatorcontrib>Cooper, Keith D. ; Harvey, Timothy J.</creatorcontrib><description>Optimizations aimed at reducing the impact of memory operations on execution speed have long concentrated on improving cache performance. These efforts achieve a. reasonable level of success. The primary limit on the compiler's ability to improve memory behavior is its imperfect knowledge about the run-time behavior of the program. The compiler cannot completely predict runtime access patterns.There is an exception to this rule. During the register allocation phase, the compiler often must insert substantial amounts of spill code; that is, instructions that move values from registers to memory and back again. Because the compiler itself inserts these memory instructions, it has more knowledge about them than other memory operations in the program.Spill-code operations are disjoint from the memory manipulations required by the semantics of the program being compiled, and, indeed, the two can interfere in the cache. This paper proposes a hardware solution to the problem of increased spill costs---a small compiler-controlled memory (CCM) to hold spilled values. This small random-access memory can (and should) be placed in a distinct address space from the main memory hierarchy. The compiler can target spill instructions to use the CCM, moving most compiler-inserted memory traffic out of the pathway to main memory and eliminating any impact that those spill instructions would have on the state of the main memory hierarchy. Such memories already exist on some DSP microprocessors. Our techniques can be applied directly on those chips.This paper presents two compiler-based methods to exploit such a memory, along with experimental results showing that speedups from using CCM may be sizable. It shows that using the register allocation's coloring paradigm to assign spilled values to memory can greatly reduce the amount of memory required by a program.</description><identifier>ISSN: 0163-5980</identifier><identifier>ISBN: 9781581131079</identifier><identifier>ISBN: 1581131070</identifier><identifier>DOI: 10.1145/291069.291010</identifier><language>eng</language><publisher>New York, NY, USA: ACM</publisher><subject>Information systems -- Information storage systems -- Storage management ; Software and its engineering -- Software notations and tools -- Compilers ; Software and its engineering -- Software organization and properties -- Contextual software domains -- Operating systems -- File systems management ; Software and its engineering -- Software organization and properties -- Contextual software domains -- Operating systems -- Memory management</subject><ispartof>Operating systems review, 1998, p.2-11</ispartof><rights>1998 ACM</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,780,784,789,790,23929,23930,25139,27924</link.rule.ids></links><search><creatorcontrib>Cooper, Keith D.</creatorcontrib><creatorcontrib>Harvey, Timothy J.</creatorcontrib><title>Compiler-controlled memory</title><title>Operating systems review</title><description>Optimizations aimed at reducing the impact of memory operations on execution speed have long concentrated on improving cache performance. These efforts achieve a. reasonable level of success. The primary limit on the compiler's ability to improve memory behavior is its imperfect knowledge about the run-time behavior of the program. The compiler cannot completely predict runtime access patterns.There is an exception to this rule. During the register allocation phase, the compiler often must insert substantial amounts of spill code; that is, instructions that move values from registers to memory and back again. Because the compiler itself inserts these memory instructions, it has more knowledge about them than other memory operations in the program.Spill-code operations are disjoint from the memory manipulations required by the semantics of the program being compiled, and, indeed, the two can interfere in the cache. This paper proposes a hardware solution to the problem of increased spill costs---a small compiler-controlled memory (CCM) to hold spilled values. This small random-access memory can (and should) be placed in a distinct address space from the main memory hierarchy. The compiler can target spill instructions to use the CCM, moving most compiler-inserted memory traffic out of the pathway to main memory and eliminating any impact that those spill instructions would have on the state of the main memory hierarchy. Such memories already exist on some DSP microprocessors. Our techniques can be applied directly on those chips.This paper presents two compiler-based methods to exploit such a memory, along with experimental results showing that speedups from using CCM may be sizable. It shows that using the register allocation's coloring paradigm to assign spilled values to memory can greatly reduce the amount of memory required by a program.</description><subject>Information systems -- Information storage systems -- Storage management</subject><subject>Software and its engineering -- Software notations and tools -- Compilers</subject><subject>Software and its engineering -- Software organization and properties -- Contextual software domains -- Operating systems -- File systems management</subject><subject>Software and its engineering -- Software organization and properties -- Contextual software domains -- Operating systems -- Memory management</subject><issn>0163-5980</issn><isbn>9781581131079</isbn><isbn>1581131070</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1998</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNqNkD1PwzAURS0BElXJyMLExETKe_5I7BFFUJAqscBsOfGzFHDqErcD_56UILEy3eEeXekexi4RVohS3XGDUJnVMRBOWGFqjUojCoTanLIFYCVKZTScsyLndwCYOi0NX7CrJg27PtJYdmm7H1OM5K8HGtL4dcHOgouZit9csrfHh9fmqdy8rJ-b-03pphEokXeChPBGcee9DFpLj6jrYKpKEpGrasEF8c5JUiQ8b71zSlTBB5Ica7FkN_PubkyfB8p7O_S5oxjdltIh258XUsEf6LrBtil9ZItgjwbsbMDOBibw9l-gbceegvgGeqdXzw</recordid><startdate>19981002</startdate><enddate>19981002</enddate><creator>Cooper, Keith D.</creator><creator>Harvey, Timothy J.</creator><general>ACM</general><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19981002</creationdate><title>Compiler-controlled memory</title><author>Cooper, Keith D. ; Harvey, Timothy J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a1380-12c3e33d952add4f884d1187f9664eeea67323e2ca4e5e3d2bdaa536fdfe42173</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Information systems -- Information storage systems -- Storage management</topic><topic>Software and its engineering -- Software notations and tools -- Compilers</topic><topic>Software and its engineering -- Software organization and properties -- Contextual software domains -- Operating systems -- File systems management</topic><topic>Software and its engineering -- Software organization and properties -- Contextual software domains -- Operating systems -- Memory management</topic><toplevel>online_resources</toplevel><creatorcontrib>Cooper, Keith D.</creatorcontrib><creatorcontrib>Harvey, Timothy J.</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Cooper, Keith D.</au><au>Harvey, Timothy J.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Compiler-controlled memory</atitle><btitle>Operating systems review</btitle><date>1998-10-02</date><risdate>1998</risdate><spage>2</spage><epage>11</epage><pages>2-11</pages><issn>0163-5980</issn><isbn>9781581131079</isbn><isbn>1581131070</isbn><abstract>Optimizations aimed at reducing the impact of memory operations on execution speed have long concentrated on improving cache performance. These efforts achieve a. reasonable level of success. The primary limit on the compiler's ability to improve memory behavior is its imperfect knowledge about the run-time behavior of the program. The compiler cannot completely predict runtime access patterns.There is an exception to this rule. During the register allocation phase, the compiler often must insert substantial amounts of spill code; that is, instructions that move values from registers to memory and back again. Because the compiler itself inserts these memory instructions, it has more knowledge about them than other memory operations in the program.Spill-code operations are disjoint from the memory manipulations required by the semantics of the program being compiled, and, indeed, the two can interfere in the cache. This paper proposes a hardware solution to the problem of increased spill costs---a small compiler-controlled memory (CCM) to hold spilled values. This small random-access memory can (and should) be placed in a distinct address space from the main memory hierarchy. The compiler can target spill instructions to use the CCM, moving most compiler-inserted memory traffic out of the pathway to main memory and eliminating any impact that those spill instructions would have on the state of the main memory hierarchy. Such memories already exist on some DSP microprocessors. Our techniques can be applied directly on those chips.This paper presents two compiler-based methods to exploit such a memory, along with experimental results showing that speedups from using CCM may be sizable. It shows that using the register allocation's coloring paradigm to assign spilled values to memory can greatly reduce the amount of memory required by a program.</abstract><cop>New York, NY, USA</cop><pub>ACM</pub><doi>10.1145/291069.291010</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0163-5980 |
ispartof | Operating systems review, 1998, p.2-11 |
issn | 0163-5980 |
language | eng |
recordid | cdi_proquest_miscellaneous_31079450 |
source | ACM Digital Library |
subjects | Information systems -- Information storage systems -- Storage management Software and its engineering -- Software notations and tools -- Compilers Software and its engineering -- Software organization and properties -- Contextual software domains -- Operating systems -- File systems management Software and its engineering -- Software organization and properties -- Contextual software domains -- Operating systems -- Memory management |
title | Compiler-controlled memory |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T09%3A23%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_acm_b&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Compiler-controlled%20memory&rft.btitle=Operating%20systems%20review&rft.au=Cooper,%20Keith%20D.&rft.date=1998-10-02&rft.spage=2&rft.epage=11&rft.pages=2-11&rft.issn=0163-5980&rft.isbn=9781581131079&rft.isbn_list=1581131070&rft_id=info:doi/10.1145/291069.291010&rft_dat=%3Cproquest_acm_b%3E31079450%3C/proquest_acm_b%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=31079450&rft_id=info:pmid/&rfr_iscdi=true |