Design Space Exploration for Approximate Computing Systems
Riferimenti esterni Prof. Alberto Bosio
Gruppi di ricerca TESTGROUP - TESTGROUP
Tipo tesi RESEARCH / EXPERIMENTAL
Descrizione Goals: Implement a Tool for automatically select the best approximate techniques for a given application described in C/C++ or SystemC.
The intended tool has to be able to perform approximation of C/C++/SystemC algorithms by means of code mutation and design space exploration. The tool must follow a set of requirements:
• Generality: allows the implementation of any approximate computing technique because it makes use of code-mutation.
• Target independence: able to work on algorithm written in C/C++ or SystemC language, but it is able to handle approximate computing techniques at any level of the computing stack.
• Application independence: whenever is the algorithm to approximate, the tool must allow the definition of a custom quality/error function to evaluate each approximate configuration.
• Fast development: the tool must be written in C++ so it could be further extended by means of C++ inheritance.
Learned Outcomes: Compilers theory and practice, Arithmetic algebra, High Level Synthesis (HLS), Alternative Computing Paradigms.
Conoscenze richieste C/C++ programming
Note Possibility to spend half of the Thesis on the École Central de Lyon.
Scadenza validita proposta 27/07/2020 PROPONI LA TUA CANDIDATURA