Approximate Memory with Protected Static Allocation

  • João Fabrício Filho UNICAMP / UTFPR
  • Isaías Felzmann UNICAMP / UTFPR
  • Lucas Wanner UNICAMP / UTFPR

Resumo


Approximate memories provide energy savings or performance improvements at the cost of occasional errors in stored data. Applications that tolerate errors on their data profit from this trade-off by controlling these errors to not affect critical data. This control usually involves programmer intervention with annotations in the source code. To avoid annotations, some techniques protect critical data that are common on many applications, isolating specific memory regions from errors. In this work, we propose and explore alternatives for the protection of application critical data by managing a supervisor execution environment with an approximate memory system. We expose only dynamically allocated data to errors with secure data manipulation through an approximate allocation scheme that divide stored data based on the approximation of the heap area. We evaluate 6 applications with different data access profiles and obtain up to 20% of energy savings.
Palavras-chave: Approximate Computing, Approximate Memory, Error Tolerance
Publicado
02/11/2022
FABRÍCIO FILHO, João; FELZMANN, Isaías; WANNER, Lucas. Approximate Memory with Protected Static Allocation. In: INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING (SBAC-PAD), 34. , 2022, Bordeaux/France. Anais [...]. Porto Alegre: Sociedade Brasileira de Computação, 2022 . p. 51-59.