Redundant computations appear during the execution of real programs. Multiple factors contribute to these unnecessary computations, such as repetitive inputs and patterns, calling functions with the same parameters or bad programming habits. Compilers minimize non useful code with static analysis. However, redundant execution might be dynamic and there are no current approaches to reduce these inefficiencies. Additionally, many algorithms can be computed with different levels of accuracy. Approximate computing exploits this fact to reduce execution time at the cost of slightly less accurate results. In this case, expert developers determine the desired tradeoff between performance and accuracy for each application. In this paper, we present...
Making computer systems more energy efficient while obtaining the maximum performance possible is ke...
Abstract—Approximate computing explores opportunities that emerge when applications can tolerate err...
Memorization as an algorithm design technique allows to speed up algorithms at the price of more spa...
Redundant computations appear during the execution of real programs. Multiple factors contribute to ...
Many functions perform redundant calculations. Within a single function invocation, several sub-func...
Performance bugs are a prevalent problem and recent research proposes various techniques to identify...
International audienceApproximate computing is necessary to meet deadlines in some compute-intensive...
Many modern workloads such as multimedia, recognition, mining, search, vision, etc. possess the char...
Thesis (Ph.D.)--University of Washington, 2015Approximate computing is the idea that we are hinderin...
We have proposed mechanisms to implement function memoization at a software level as part of our eff...
Memoization may be viewed as a mechanism for re-using a computation---if a function is re-applied to...
In the last few decades, modern applications have become larger and more complex. Among the users of...
La Computation Approximée est basée dans l'idée que des améliorations significatives de l'utilisatio...
Parallel task-based programming models like OpenMP support the declaration of task data dependences....
Applications in various fields, such as machine learning, scientific computing and signal/image proc...
Making computer systems more energy efficient while obtaining the maximum performance possible is ke...
Abstract—Approximate computing explores opportunities that emerge when applications can tolerate err...
Memorization as an algorithm design technique allows to speed up algorithms at the price of more spa...
Redundant computations appear during the execution of real programs. Multiple factors contribute to ...
Many functions perform redundant calculations. Within a single function invocation, several sub-func...
Performance bugs are a prevalent problem and recent research proposes various techniques to identify...
International audienceApproximate computing is necessary to meet deadlines in some compute-intensive...
Many modern workloads such as multimedia, recognition, mining, search, vision, etc. possess the char...
Thesis (Ph.D.)--University of Washington, 2015Approximate computing is the idea that we are hinderin...
We have proposed mechanisms to implement function memoization at a software level as part of our eff...
Memoization may be viewed as a mechanism for re-using a computation---if a function is re-applied to...
In the last few decades, modern applications have become larger and more complex. Among the users of...
La Computation Approximée est basée dans l'idée que des améliorations significatives de l'utilisatio...
Parallel task-based programming models like OpenMP support the declaration of task data dependences....
Applications in various fields, such as machine learning, scientific computing and signal/image proc...
Making computer systems more energy efficient while obtaining the maximum performance possible is ke...
Abstract—Approximate computing explores opportunities that emerge when applications can tolerate err...
Memorization as an algorithm design technique allows to speed up algorithms at the price of more spa...