Fast, efficient and predictable memory accesses: optimization algorithms for memory architecture aware compilation
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Dordrecht
Springer
2006
|
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | XI, 257 S. graph. Darst. |
| ISBN: | 1402048211 9781402048210 140204822X 9781402048227 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV021840645 | ||
| 003 | DE-604 | ||
| 005 | 20080107 | ||
| 007 | t | ||
| 008 | 061205s2006 gw d||| |||| 00||| eng d | ||
| 015 | |a 06,N22,0867 |2 dnb | ||
| 016 | 7 | |a 979649919 |2 DE-101 | |
| 020 | |a 1402048211 |c Gb. : EUR 106.95 (freier Pr.), sfr 169.00 (freier Pr.) |9 1-4020-4821-1 | ||
| 020 | |a 9781402048210 |9 978-1-4020-4821-0 | ||
| 020 | |a 140204822X |9 1-4020-4822-X | ||
| 020 | |a 9781402048227 |9 978-1-4020-4822-7 | ||
| 024 | 3 | |a 9781402048210 | |
| 028 | 5 | 2 | |a 11661573 |
| 035 | |a (OCoLC)70984100 | ||
| 035 | |a (DE-599)BVBBV021840645 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-703 |a DE-384 |a DE-83 | ||
| 050 | 0 | |a QA76.9.M45 | |
| 082 | 0 | |a 005.435 |2 22 | |
| 084 | |a ST 175 |0 (DE-625)143603: |2 rvk | ||
| 084 | |a 500 |2 sdnb | ||
| 100 | 1 | |a Wehmeyer, Lars |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Fast, efficient and predictable memory accesses |b optimization algorithms for memory architecture aware compilation |c Lars Wehmeyer ; Peter Marwedel |
| 264 | 1 | |a Dordrecht |b Springer |c 2006 | |
| 300 | |a XI, 257 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Memory management (Computer science) | |
| 650 | 0 | 7 | |a Speicherverwaltung |0 (DE-588)4182146-4 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Speicherverwaltung |0 (DE-588)4182146-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Marwedel, Peter |d 1949- |e Verfasser |0 (DE-588)132720736 |4 aut | |
| 856 | 4 | 2 | |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=2805999&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m Digitalisierung UB Augsburg |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015052507&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015052507 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804135774914871296 |
|---|---|
| adam_text | Contents
Acknowledgements
............................................ xi
1
Abstract
................................................... 1
2
Introduction
............................................... 3
2.1
Motivation
............................................. 5
2.2
Contributions of this Work
............................... 11
2.3
Overview
............................................... 13
3
Models and Tools
.......................................... 15
3.1
Instruction Set Architecture Model
........................ 17
3.2
Memory Models
......................................... 18
3.2.1
ŠRAM
........................................... 19
3.2.2
DRAM
........................................... 21
3.2.3
Flash Memory
.................................... 24
3.2.4
Caches
........................................... 25
3.3
Timing Models
.......................................... 29
3.3.1
Processor and Instruction Timing
................... 29
3.3.2
Memory Timing
................................... 31
3.4
Energy Models
.......................................... 36
3.4.1
Sources of Energy Dissipation
....................... 37
3.4.2
Processor Energy
.................................. 40
3.4.3
Memory Energy
................................... 45
3.5
Simulation Models
....................................... 61
3.5.1
Processor Simulation Model
........................ 61
3.5.2
Memory Simulation Model
.......................... 66
3.6
The
enee
Compiler Framework
............................ 75
3.6.1
Workflow
......................................... 77
3.6.2
enprofiler
......................................... 81
3.6.3
Memory Architecture Aware Compilation
............ 82
viii Contents
4
Scratchpad Memory Optimizations
........................ 89
4.1
Related Work
........................................... 90
4.2
Multi
Memory Optimization
.............................. 97
4.2.1
Memory Objects
.................................. 99
4.2.2
Prerequisites
......................................100
4.2.3
Energy Functions
..................................101
4.2.4
The Base model
...................................102
4.2.5
The Top-Down Model
..............................104
4.2.6
The Bottom-Up Model
.............................
Ill
4.2.7
The ARM TCM Model
............................115
4.2.8
Leakage-Energy Aware Memory Configuration
........117
4.2.9
Results for
Multi
Memory Optimization
..............120
4.3
Impact of Scratchpad Allocation Techniques on WCET
.......136
4.3.1
Related Work
.....................................140
4.3.2
Tools and Workflow
...............................142
4.3.3
Required Annotation Information
...................145
4.3.4
Benchmarks and Memory Hierarchy Configuration
.....151
4.3.5
WCET Results for Static Allocation
.................152
4.3.6
WCET Results for Dynamic Allocation
..............161
5
Main Memory Optimizations
..............................171
5.1
Related Work
...........................................172
5.2
Main Memory Power Management
.........................174
5.2.1
Motivating Example
...............................177
5.2.2
Prerequisites
......................................178
5.2.3
Memory Objects and Energy Functions
..............179
5.2.4
Binary Decision Variables
..........................182
5.2.5
Objective Function
................................184
5.2.6
Constraints
.......................................184
5.2.7
Results for Main Memory Power Management
.........186
5.3
Execute-In-Place using Flash Memories
....................192
5.3.1
Analysis of the Copy Function
......................194
5.3.2
Main Memory Partitioning
.........................195
5.3.3
Prerequisites
.......................................197
5.3.4
Preselection of Memory Objects to enable Deep Power
Down
............................................199
5.3.5
Formalization of the Preselection Algorithm
..........203
5.3.6
Formalization of the XIP Allocation Problem
.........204
5.3.7
Results for XIP
...................................207
6
Register File Optimization
.................................217
6.1
Related Work
...........................................218
6.2
Implementation of the Register File
........................219
6.3
Register Allocation and Lifetime Analysis
..................220
6.4
Workflow and Methodology
...............................222
Contents
ix
6.5
Benchmark Suite
........................................224
6.5.1
Results for the Ratio of Spill Code to Total Code Size.
. 224
6.5.2
Results for the Number of Cycles
....................226
6.5.3
Results for Energy Consumption
....................229
6.6
Compiler Guided Choice of Register File Size
...............230
7
Summary
..................................................233
8
Future Work
...............................................239
References
.....................................................243
Index
..........................................................255
|
| adam_txt |
Contents
Acknowledgements
. xi
1
Abstract
. 1
2
Introduction
. 3
2.1
Motivation
. 5
2.2
Contributions of this Work
. 11
2.3
Overview
. 13
3
Models and Tools
. 15
3.1
Instruction Set Architecture Model
. 17
3.2
Memory Models
. 18
3.2.1
ŠRAM
. 19
3.2.2
DRAM
. 21
3.2.3
Flash Memory
. 24
3.2.4
Caches
. 25
3.3
Timing Models
. 29
3.3.1
Processor and Instruction Timing
. 29
3.3.2
Memory Timing
. 31
3.4
Energy Models
. 36
3.4.1
Sources of Energy Dissipation
. 37
3.4.2
Processor Energy
. 40
3.4.3
Memory Energy
. 45
3.5
Simulation Models
. 61
3.5.1
Processor Simulation Model
. 61
3.5.2
'Memory Simulation Model
. 66
3.6
The
enee
Compiler Framework
. 75
3.6.1
Workflow
. 77
3.6.2
enprofiler
. 81
3.6.3
Memory Architecture Aware Compilation
. 82
viii Contents
4
Scratchpad Memory Optimizations
. 89
4.1
Related Work
. 90
4.2
Multi
Memory Optimization
. 97
4.2.1
Memory Objects
. 99
4.2.2
Prerequisites
.100
4.2.3
Energy Functions
.101
4.2.4
The Base model
.102
4.2.5
The Top-Down Model
.104
4.2.6
The Bottom-Up Model
.
Ill
4.2.7
The ARM TCM Model
.115
4.2.8
Leakage-Energy Aware Memory Configuration
.117
4.2.9
Results for
Multi
Memory Optimization
.120
4.3
Impact of Scratchpad Allocation Techniques on WCET
.136
4.3.1
Related Work
.140
4.3.2
Tools and Workflow
.142
4.3.3
Required Annotation Information
.145
4.3.4
Benchmarks and Memory Hierarchy Configuration
.151
4.3.5
WCET Results for Static Allocation
.152
4.3.6
WCET Results for Dynamic Allocation
.161
5
Main Memory Optimizations
.171
5.1
Related Work
.172
5.2
Main Memory Power Management
.174
5.2.1
Motivating Example
.177
5.2.2
Prerequisites
.178
5.2.3
Memory Objects and Energy Functions
.179
5.2.4
Binary Decision Variables
.182
5.2.5
Objective Function
.184
5.2.6
Constraints
.184
5.2.7
Results for Main Memory Power Management
.186
5.3
Execute-In-Place using Flash Memories
.192
5.3.1
Analysis of the Copy Function
.194
5.3.2
Main Memory Partitioning
.195
5.3.3
Prerequisites
.197
5.3.4
Preselection of Memory Objects to enable Deep Power
Down
.199
5.3.5
Formalization of the Preselection Algorithm
.203
5.3.6
Formalization of the XIP Allocation Problem
.204
5.3.7
Results for XIP
.207
6
Register File Optimization
.217
6.1
Related Work
.218
6.2
Implementation of the Register File
.219
6.3
Register Allocation and Lifetime Analysis
.220
6.4
Workflow and Methodology
.222
Contents
ix
6.5
Benchmark Suite
.224
6.5.1
Results for the Ratio of Spill Code to Total Code Size.
. 224
6.5.2
Results for the Number of Cycles
.226
6.5.3
Results for Energy Consumption
.229
6.6
Compiler Guided Choice of Register File Size
.230
7
Summary
.233
8
Future Work
.239
References
.243
Index
.255 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Wehmeyer, Lars Marwedel, Peter 1949- |
| author_GND | (DE-588)132720736 |
| author_facet | Wehmeyer, Lars Marwedel, Peter 1949- |
| author_role | aut aut |
| author_sort | Wehmeyer, Lars |
| author_variant | l w lw p m pm |
| building | Verbundindex |
| bvnumber | BV021840645 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.M45 |
| callnumber-search | QA76.9.M45 |
| callnumber-sort | QA 276.9 M45 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 175 |
| ctrlnum | (OCoLC)70984100 (DE-599)BVBBV021840645 |
| dewey-full | 005.435 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.435 |
| dewey-search | 005.435 |
| dewey-sort | 15.435 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Allgemeine Naturwissenschaft Informatik |
| discipline_str_mv | Allgemeine Naturwissenschaft Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02087nam a2200505 c 4500</leader><controlfield tag="001">BV021840645</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20080107 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">061205s2006 gw d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">06,N22,0867</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">979649919</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1402048211</subfield><subfield code="c">Gb. : EUR 106.95 (freier Pr.), sfr 169.00 (freier Pr.)</subfield><subfield code="9">1-4020-4821-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781402048210</subfield><subfield code="9">978-1-4020-4821-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">140204822X</subfield><subfield code="9">1-4020-4822-X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781402048227</subfield><subfield code="9">978-1-4020-4822-7</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9781402048210</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">11661573</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)70984100</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021840645</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.M45</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.435</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 175</subfield><subfield code="0">(DE-625)143603:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">500</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wehmeyer, Lars</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fast, efficient and predictable memory accesses</subfield><subfield code="b">optimization algorithms for memory architecture aware compilation</subfield><subfield code="c">Lars Wehmeyer ; Peter Marwedel</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dordrecht</subfield><subfield code="b">Springer</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 257 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="650" ind1=" " ind2="4"><subfield code="a">Memory management (Computer science)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Speicherverwaltung</subfield><subfield code="0">(DE-588)4182146-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Speicherverwaltung</subfield><subfield code="0">(DE-588)4182146-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Marwedel, Peter</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)132720736</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=2805999&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Augsburg</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015052507&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015052507</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV021840645 |
| illustrated | Illustrated |
| index_date | 2024-07-02T16:00:19Z |
| indexdate | 2024-07-09T20:45:51Z |
| institution | BVB |
| isbn | 1402048211 9781402048210 140204822X 9781402048227 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015052507 |
| oclc_num | 70984100 |
| open_access_boolean | |
| owner | DE-703 DE-384 DE-83 |
| owner_facet | DE-703 DE-384 DE-83 |
| physical | XI, 257 S. graph. Darst. |
| publishDate | 2006 |
| publishDateSearch | 2006 |
| publishDateSort | 2006 |
| publisher | Springer |
| record_format | marc |
| spelling | Wehmeyer, Lars Verfasser aut Fast, efficient and predictable memory accesses optimization algorithms for memory architecture aware compilation Lars Wehmeyer ; Peter Marwedel Dordrecht Springer 2006 XI, 257 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Memory management (Computer science) Speicherverwaltung (DE-588)4182146-4 gnd rswk-swf 1\p (DE-588)4113937-9 Hochschulschrift gnd-content Speicherverwaltung (DE-588)4182146-4 s DE-604 Marwedel, Peter 1949- Verfasser (DE-588)132720736 aut text/html http://deposit.dnb.de/cgi-bin/dokserv?id=2805999&prov=M&dok_var=1&dok_ext=htm Inhaltstext Digitalisierung UB Augsburg application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015052507&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Wehmeyer, Lars Marwedel, Peter 1949- Fast, efficient and predictable memory accesses optimization algorithms for memory architecture aware compilation Memory management (Computer science) Speicherverwaltung (DE-588)4182146-4 gnd |
| subject_GND | (DE-588)4182146-4 (DE-588)4113937-9 |
| title | Fast, efficient and predictable memory accesses optimization algorithms for memory architecture aware compilation |
| title_auth | Fast, efficient and predictable memory accesses optimization algorithms for memory architecture aware compilation |
| title_exact_search | Fast, efficient and predictable memory accesses optimization algorithms for memory architecture aware compilation |
| title_exact_search_txtP | Fast, efficient and predictable memory accesses optimization algorithms for memory architecture aware compilation |
| title_full | Fast, efficient and predictable memory accesses optimization algorithms for memory architecture aware compilation Lars Wehmeyer ; Peter Marwedel |
| title_fullStr | Fast, efficient and predictable memory accesses optimization algorithms for memory architecture aware compilation Lars Wehmeyer ; Peter Marwedel |
| title_full_unstemmed | Fast, efficient and predictable memory accesses optimization algorithms for memory architecture aware compilation Lars Wehmeyer ; Peter Marwedel |
| title_short | Fast, efficient and predictable memory accesses |
| title_sort | fast efficient and predictable memory accesses optimization algorithms for memory architecture aware compilation |
| title_sub | optimization algorithms for memory architecture aware compilation |
| topic | Memory management (Computer science) Speicherverwaltung (DE-588)4182146-4 gnd |
| topic_facet | Memory management (Computer science) Speicherverwaltung Hochschulschrift |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=2805999&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015052507&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT wehmeyerlars fastefficientandpredictablememoryaccessesoptimizationalgorithmsformemoryarchitectureawarecompilation AT marwedelpeter fastefficientandpredictablememoryaccessesoptimizationalgorithmsformemoryarchitectureawarecompilation |