Accepted for 2019 International Conference on High Performance Computing & Simulation (HPCS)Approximate computing techniques are often used to improve the performance of applications that can tolerate some amount of impurity in the calculations or data. In the context of embedded and mobile systems, a broad number of applications have exploited approximation techniques to improve performance and overcome the limited capabilities of the hardware. On such systems, even small performance improvements can be sufficient to meet scheduled requirements such as hard real-time deadlines. We study the approximation of memory-bound applications on mobile GPUs using kernel perforation, an approximation technique that exploits the availability of fast G...
Cellular automata, represented by a discrete set of elements are ideal candidates for parallelisati...
Iterative memory-bound solvers commonly occur in HPC codes. Typical GPU implementations have a loop ...
The end of Dennard scaling and the slowdown of Moore's law led to a shift in technology trends towar...
Approximate computing techniques are often used to improve the performance of applications that can ...
Many applications provide inherent resilience to some amount of error and can potentially trade accu...
Faster and more efficient hardware is needed to handle the rapid growth of Big Data processing. Appl...
Mobile computing is one of the largest untapped reservoirs in today’s pervasive computing world as i...
In the last three years, GPUs are more and more being used for general purpose applications instead ...
Approximate computing, where computation accuracy is traded off for better performance or higher dat...
Graphics Processing Units (GPUs) critically rely on a complex system software stack comprising kerne...
General-purpose computing on graphics processing units is the utilization of a graphics processing u...
Mobile processors continue to increase in performance while becoming more power efficient, providing...
Approximate computing, the technique that sacrifices certain amount of accuracy in exchange for subs...
Cellular automata, represented by a discrete set of elements are ideal candidates for parallelisati...
Iterative memory-bound solvers commonly occur in HPC codes. Typical GPU implementations have a loop ...
The end of Dennard scaling and the slowdown of Moore's law led to a shift in technology trends towar...
Approximate computing techniques are often used to improve the performance of applications that can ...
Many applications provide inherent resilience to some amount of error and can potentially trade accu...
Faster and more efficient hardware is needed to handle the rapid growth of Big Data processing. Appl...
Mobile computing is one of the largest untapped reservoirs in today’s pervasive computing world as i...
In the last three years, GPUs are more and more being used for general purpose applications instead ...
Approximate computing, where computation accuracy is traded off for better performance or higher dat...
Graphics Processing Units (GPUs) critically rely on a complex system software stack comprising kerne...
General-purpose computing on graphics processing units is the utilization of a graphics processing u...
Mobile processors continue to increase in performance while becoming more power efficient, providing...
Approximate computing, the technique that sacrifices certain amount of accuracy in exchange for subs...
Cellular automata, represented by a discrete set of elements are ideal candidates for parallelisati...
Iterative memory-bound solvers commonly occur in HPC codes. Typical GPU implementations have a loop ...
The end of Dennard scaling and the slowdown of Moore's law led to a shift in technology trends towar...