Software-based register file vulnerability reduction for embedded processors
Cited 0 times inCited 0 times in
- Software-based register file vulnerability reduction for embedded processors
- Lee, Jongeun; Shrivastava, Aviral
- Compilation; Embedded system; Link-time optimization; Register file; Soft error; Static analysis; Vulnerability
- Issue Date
- ASSOC COMPUTING MACHINERY
- ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, v.13, no.1, pp.1 - 20
- Register File (RF) is extremely vulnerable to soft errors, and traditional redundancy based schemes to protect the RF are prohibitive not only because RF is often in the timing critical path of the processor, but also since it is one of the hottest blocks on the chip. Software approaches would be ideal in this case, but previous approaches based on instruction scheduling are only moderately effective due to local scope. In this article we present a compiler approach, based on interprocedural program analysis, to reduce the vulnerability of registers by temporarily writing live variables to protected memory. We formulate the problem as an integer linear programming problem and also present a very efficient heuristic algorithm. Further we present an iterative optimization method based on Kernighan-Lin's graph partitioning algorithm. Our experiments demonstrate that our proposed techniques can reduce the vulnerability of a RF by 33 ~ 37% on average and up to 66%, with a small 2% increase in runtime. In addition, our overhead reduction optimization can effectively reduce the code size overhead, by more than 40% on average, to a mere 5 ~ 6%, compared to highly optimized binaries. Categories and Subject Descriptors: D.3.4 [Programming Languages]: Processors-Code generation, compilers, optimization; B.8.1 [Performance and Reliability]: Reliability, Testing, and Fault-Tolerance.
- ; Go to Link
Appears in Collections:
- ECE_Journal Papers
can give you direct access to the published full text of this article. (UNISTARs only)
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.