Architecture of Computing Systems (Lecture Notes in Computer ...

Recommendations

Info

34 T.B. Preußer, P. Reichel, and R.G. Spallek Duration in Clock Cycles Table 1. Device Utilization of Reference Platform Cores FFs LUTs BRAMs 1 3206 7813 10 2 4465 11396 17 3 5720 14963 24 n ≈ 1257n + 1950 ≈ 3575n + 4240 7n +3 120000 100000 80000 60000 40000 20000 0 0 100 200 300 400 500 Living Weak Reference Proxies Heap Scan Weak Processing Fig. 6. Overhead of Weak Reference Processing memory access manager as well as through regular Wishbone I/O for less timecritical operations. The latter also provides fundamental statistical data that we used for this evaluation. The runtime library was extended to enable application access to the new features and to provide implementations for the reference proxy and the reference queue classes. It was also turned into the first client of the weak reference support by the implementation of resource pools, which, for instance, enable the proper interning of strings. The reference design was implemented on a Xilinx Spartan-3 XC3S1000, which is capable of holding up to three SHAP cores next to the memory management unit. The utilization of this reference platform is summarized in Tab. 1. As indicated, the demand on active resources grows linearly with the number of integrated SHAP cores. While most of the basic core-independent flip-flops and LUTs may be attributed to the central memory management, global Wishboneattached IO accounts for about a quarter of it. The three Block RAMs outside the cores are used as MCU storage also containing the GC program and the global mark table. The processing of living weak reference proxies constitutes a processing overhead as they are enlisted during the heap scan to be revisited thereafter in order to verify that their referents have been reached or to clear and enqueue them. This overhead grows linearly with the number of living proxy objects. This is
An Embedded GC Module with Support for Multiple Mutators 35 Free Segments 8 7 6 5 4 3 2 1 Used Reference Handles Free Segments Soft Reference Reclamation 0 0 0 100 200 300 400 500 600 700 800 900 Iteration 3000 2500 2000 1500 1000 500 Fig. 7. Soft References and Growing Memory Utilization shown in Fig. 6 for several scans of a heap with an identical object population, which merely differs in the number of weak reference proxies pointing to living objects. While the heap scan merely slows down marginally, the overhead becomes clearly visible in the succeeding weak reference processing. The lower impact on the heap scan is due to its hardware-assisted implementation inside the memory access management. The distinguished treatment of soft references according to the current memory utilization is illustrated in Fig. 7. Initially, a set of few but large objects is allocated and made solely soft-reachable. Then, small objects are created continuously and kept reachable so that the memory fills up. While the large objects are initially kept alive, the available empty segments will eventually fall short of the threshold of two segments so that the soft references will be treated like weak ones by the GC. Consequently, the large objects are collected and the memory utilization relaxes. 5 Conclusions This paper has demonstrated that the integration of advanced GC features is feasible even for small embedded bytecode processors. The presented solution makes thorough use of hardware acceleration wherever applicable while employing a main C-programmed software control for easy maintenance. The presented solution implements a concurrent garbage collector with the support of multiple mutators. Even going beyond the requirements of the CLDC 1.1, it includes the support for soft references and reference enqueuing. The practical implementation of the garbage collector was proven in the SHAP bytecode processor. Used Reference Handles
Page 2 and 3: Lecture Notes in Computer Science 5
Page 4 and 5: Volume Editors Christian Müller-Sc
Page 6 and 7: General Chair Organization Christia
Page 8 and 9: Organization IX Hartmut Schmeck Kar
Page 10 and 11: Keynote Table of Contents HyVM - Hy
Page 12 and 13: Table of Contents XIII JetBench:AnO
Page 14 and 15: How to Enhance a Superscalar Proces
Page 16 and 17: 4 J. Mische et al. The Real-time Vi
Page 18 and 19: 6 J. Mische et al. 4.1 Instruction
Page 20 and 21: 8 J. Mische et al. Additionally the
Page 22 and 23: 10 J. Mische et al. % of unused pip
Page 24 and 25: 12 J. Mische et al. % of cycles spe
Page 26 and 27: 14 J. Mische et al. 16. Lickly, B.,
Page 28 and 29: 16 G. Aşılıoğlu, E.M. Kaya, and
Page 38 and 39: 26 T.B. Preußer, P. Reichel, and R
Page 50 and 51: 38 P. Bellasi, W. Fornaciari, and D
Page 62 and 63: 50 J. Zeppenfeld and A. Herkersdorf
Page 74 and 75: 62 B. Jakimovski, B. Meyer, and E.
Page 86 and 87: 74 M. Bonn and H. Schmeck Fig. 1. J
Page 88 and 89: 76 M. Bonn and H. Schmeck 2.2 Node
Page 90 and 91: 78 M. Bonn and H. Schmeck Uptime-ba
Page 92 and 93: 80 M. Bonn and H. Schmeck 2.4 Simul
Page 94 and 95: 82 M. Bonn and H. Schmeck done rate
Page 96 and 97:
84 M. Bonn and H. Schmeck Fig. 8. J
Page 98 and 99:
86 M. Bonn and H. Schmeck tells the
Page 100 and 101:
88 J.-P. Steghöfer et al. � �
Page 102 and 103:
90 J.-P. Steghöfer et al. mechanis
Page 104 and 105:
92 J.-P. Steghöfer et al. resource
Page 106 and 107:
94 J.-P. Steghöfer et al. Choose a
Page 108 and 109:
96 J.-P. Steghöfer et al. 1. Defin
Page 110 and 111:
98 J.-P. Steghöfer et al. and all
Page 112 and 113:
100 J.-P. Steghöfer et al. 19. Kim
Page 114 and 115:
102 K. Kloch et al. large-scale sys
Page 116 and 117:
104 K. Kloch et al. a�t� 1.0 0.
Page 118 and 119:
106 K. Kloch et al. constant. This
Page 120 and 121:
108 K. Kloch et al. Relative number
Page 122 and 123:
110 K. Kloch et al. (a) infection r
Page 124 and 125:
112 K. Kloch et al. (ii) Phase of a
Page 126 and 127:
114 P. Petoumenos et al. Studying t
Page 128 and 129:
116 P. Petoumenos et al. % of Misse
Page 130 and 131:
118 P. Petoumenos et al. IQ: n 4-in
Page 132 and 133:
120 P. Petoumenos et al. downsizing
Page 134 and 135:
122 P. Petoumenos et al. As long as
Page 136 and 137:
124 P. Petoumenos et al. comparable
Page 138 and 139:
Exploiting Inactive Rename Slots fo
Page 140 and 141:
128 M. Kayaalp et al. In a supersca
Page 142 and 143:
130 M. Kayaalp et al. INSTRUCTION 1
Page 144 and 145:
132 M. Kayaalp et al. time. Alterna
Page 146 and 147:
134 M. Kayaalp et al. Fig. 3. Numbe
Page 148 and 149:
136 M. Kayaalp et al. The results o
Page 150 and 151:
Efficient Transaction Nesting in Ha
Page 152 and 153:
140 Y. Liu et al. HTMs include TCC
Page 154 and 155:
142 Y. Liu et al. rollback T0 begin
Page 156 and 157:
144 Y. Liu et al. Processor core Pr
Page 158 and 159:
146 Y. Liu et al. 5.2 Results and A
Page 160 and 161:
148 Y. Liu et al. decreases, partia
Page 162 and 163:
Decentralized Energy-Management to
Page 164 and 165:
152 B. Becker et al. Furthermore, t
Page 166 and 167:
154 B. Becker et al. An optimizing
Page 168 and 169:
156 B. Becker et al. smart-home man
Page 170 and 171:
158 B. Becker et al. freedom like w
Page 172 and 173:
160 B. Becker et al. Power [W] 4500
Page 174 and 175:
EnergySaving Cluster Roll: Power Sa
Page 176 and 177:
164 M.F. Dolz et al. Themodulequeri
Page 178 and 179:
166 M.F. Dolz et al. This daemon al
Page 180 and 181:
168 M.F. Dolz et al. been submitted
Page 182 and 183:
170 M.F. Dolz et al. On the other h
Page 184 and 185:
172 M.F. Dolz et al. at the inactiv
Page 186 and 187:
Effect of the Degree of Neighborhoo
Page 188 and 189:
176 T. Abdullah et al. A zone based
Page 190 and 191:
178 T. Abdullah et al. A consumer/p
Page 192 and 193:
180 T. Abdullah et al. Messages 140
Page 194 and 195:
182 T. Abdullah et al. (except when
Page 196 and 197:
184 T. Abdullah et al. % Matchmakin
Page 198 and 199:
186 T. Abdullah et al. show that th
Page 200 and 201:
188 M. Schindewolf, D. Kramer, and
Page 202 and 203:
Page 204 and 205:
Page 206 and 207:
Page 208 and 209:
Page 210 and 211:
Page 212 and 213:
200 R. Plyaskin and A. Herkersdorf
Page 214 and 215:
Page 216 and 217:
Page 218 and 219:
Page 220 and 221:
Page 222 and 223:
Page 224 and 225:
212 M.Y. Qadri, D. Matichard, and K
Page 226 and 227:
Page 228 and 229:
Page 230 and 231:
Page 232 and 233:
Page 234 and 235:
A Tightly Coupled Accelerator Infra
Page 236 and 237:
224 F. Nowak and R. Buchty where A
Page 238 and 239:
226 F. Nowak and R. Buchty Fig. 3.
Page 240 and 241:
228 F. Nowak and R. Buchty Table 2.
Page 242 and 243:
230 F. Nowak and R. Buchty Table 4.
Page 244 and 245:
232 F. Nowak and R. Buchty 5.3 Comp
Page 246 and 247:
Optimizing Stencil Application on M
Page 248 and 249:
236 F. Xudong et al. compared to th
Page 250 and 251:
238 F. Xudong et al. stencil comput
Page 252 and 253:
240 F. Xudong et al. threads in the
Page 254 and 255:
242 F. Xudong et al. Speedup 14 12
Page 256 and 257:
244 F. Xudong et al. 5 Related Work
Page 258:
Abdullah, Tariq 174 Alima, Luc Onan
show all

Architecture of Computing Systems (Lecture Notes in Computer ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?