swMATH ID: 29917
Software Authors: M. Samadi, D. A. Jamshidi, J. Lee, S. Mahlke
Description: Paraprox: Pattern-based approximation for data parallel applications. Approximate computing is an approach where reduced accuracy of results is traded off for increased speed, throughput, or both. Loss of accuracy is not permissible in all computing domains, but there are a growing number of data-intensive domains where the output of programs need not be perfectly correct to provide useful results or even noticeable differences to the end user. These soft domains include multimedia processing, machine learning, and data mining/analysis. An important challenge with approximate computing is transparency to insulate both software and hardware developers from the time, cost, and difficulty of using approximation. This paper proposes a software-only system, Paraprox, for realizing transparent approximation of data-parallel programs that operates on commodity hardware systems. Paraprox starts with a data-parallel kernel implemented using OpenCL or CUDA and creates a parameterized approximate kernel that is tuned at runtime to maximize performance subject to a target output quality (TOQ) that is supplied by the user. Approximate kernels are created by recognizing common computation idioms found in data-parallel programs (e.g., Map, Scatter/Gather, Reduction, Scan, Stencil, and Partition) and substituting approximate implementations in their place. Across a set of 13 soft data-parallel applications with at most 10
Homepage: http://cccp.eecs.umich.edu/papers/samadi-asplos14.pdf
Related Software: PAPI; Multicube Explorer; SiblingRivalry; Green; SAGE; ADAPT; ATF; OpenTuner; AutoTune; Atune-IL; Tessellation; SEEC; ABLE; mARGOt; Petabricks; CLTune; crs; PATUS; Nimrod/G; PARSEC
Cited in: 1 Document

Citations by Year