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...
The objective of data compression is to avoid redundancy in order to reduce the size of the data to ...
In conventional computing, most programs are treated as implementations of mathematical functions fo...
Resilient algorithms in high-performance computing are subject to rigorous non-functional constrain...
Redundant computations appear during the execution of real programs. Multiple factors contribute to ...
Applications in various fields, such as machine learning, scientific computing and signal/image proc...
Parallelism is everywhere, with co-processors such as Graphics Processing Units (GPUs) accelerating ...
International audienceMemoization is the technique of saving the results of computations so that fut...
Performance bugs are a prevalent problem and recent research proposes various techniques to identify...
International audienceMemoization is the technique of saving result of executions so that future exe...
Approximate computing recognizes that many applications can tolerate inexactness. These applications...
Using Machine Learning to yield Scalable Program Analyses Program Analysis tackles the problem of p...
International audienceApproximate computing is necessary to meet deadlines in some compute-intensive...
International audienceImproving execution time and energy efficiency is needed for many applications...
Many functions perform redundant calculations. Within a single function invocation, several sub-func...
This research presents a new performance improvement technique, window memoization, for software and...
The objective of data compression is to avoid redundancy in order to reduce the size of the data to ...
In conventional computing, most programs are treated as implementations of mathematical functions fo...
Resilient algorithms in high-performance computing are subject to rigorous non-functional constrain...
Redundant computations appear during the execution of real programs. Multiple factors contribute to ...
Applications in various fields, such as machine learning, scientific computing and signal/image proc...
Parallelism is everywhere, with co-processors such as Graphics Processing Units (GPUs) accelerating ...
International audienceMemoization is the technique of saving the results of computations so that fut...
Performance bugs are a prevalent problem and recent research proposes various techniques to identify...
International audienceMemoization is the technique of saving result of executions so that future exe...
Approximate computing recognizes that many applications can tolerate inexactness. These applications...
Using Machine Learning to yield Scalable Program Analyses Program Analysis tackles the problem of p...
International audienceApproximate computing is necessary to meet deadlines in some compute-intensive...
International audienceImproving execution time and energy efficiency is needed for many applications...
Many functions perform redundant calculations. Within a single function invocation, several sub-func...
This research presents a new performance improvement technique, window memoization, for software and...
The objective of data compression is to avoid redundancy in order to reduce the size of the data to ...
In conventional computing, most programs are treated as implementations of mathematical functions fo...
Resilient algorithms in high-performance computing are subject to rigorous non-functional constrain...