Managing performance vs. accuracy trade-offs with loop perforation
Stelios Sidiroglou-Douskos,Sasa Misailovic,Henry Hoffmann,Martin Rinard +3 more
- pp 124-134
Reads0
Chats0
TLDR
The results indicate that, for a range of applications, this approach typically delivers performance increases of over a factor of two (and up to a factors of seven) while changing the result that the application produces by less than 10%.Abstract:
Many modern computations (such as video and audio encoders, Monte Carlo simulations, and machine learning algorithms) are designed to trade off accuracy in return for increased performance. To date, such computations typically use ad-hoc, domain-specific techniques developed specifically for the computation at hand. Loop perforation provides a general technique to trade accuracy for performance by transforming loops to execute a subset of their iterations. A criticality testing phase filters out critical loops (whose perforation produces unacceptable behavior) to identify tunable loops (whose perforation produces more efficient and still acceptably accurate computations). A perforation space exploration algorithm perforates combinations of tunable loops to find Pareto-optimal perforation policies. Our results indicate that, for a range of applications, this approach typically delivers performance increases of over a factor of two (and up to a factor of seven) while changing the result that the application produces by less than 10%.read more
Citations
More filters
Journal ArticleDOI
A language extension set to generate adaptive versions automatically
TL;DR: This paper identified the semantic and syntactic information necessary for a compiler to automatically handle approximation and adaptive techniques for a particular class of programs, and proposed a set of language extensions generic enough to provide the compiler with the useful semantic information when approximation is beneficial.
Proceedings ArticleDOI
Enabling Approximate Storage through Lossy Media Data Compression
Brian Worek,Paul Ampadu +1 more
TL;DR: This work enables approximate storage to exploit the inherent error resilience of multimedia and other applications, through lossy compression, to improve storage without adversely affecting application functionality.
Journal ArticleDOI
ENAP: An Efficient Number-Aware Pruning Framework for Design Space Exploration of Approximate Configurations
TL;DR: In this article , the authors proposed the efficient number-aware pruning (ENAP) technique that can compress the search space size by finding the optimal configuration among approximation units with different error characteristics.
Book ChapterDOI
Outperforming Image Segmentation by Exploiting Approximate K-Means Algorithms
Flora Amato,Mario Barbareschi,Giovanni Cozzolino,Antonino Mazzeo,Nicola Mazzocca,Antonio Tammaro +5 more
TL;DR: This work proposes an approximate version of the K-means algorithm to be used for the image segmentation, with the aim to reduce the area needed to synthesize it on a hardware target.
Proceedings ArticleDOI
Architecture-Aware Approximate Computing
TL;DR: This paper presents a program slicing-based approach that identifies the set of data accesses to drop and results indicate 8.8% performance improvement and 13.7% energy saving are possible when the error bound is set to 2%, and the corresponding improvements jump to 15% and 25%, respectively, when theerror bound is raised to 4%.
References
More filters
Proceedings ArticleDOI
LLVM: a compilation framework for lifelong program analysis & transformation
Chris Lattner,Vikram Adve +1 more
TL;DR: The design of the LLVM representation and compiler framework is evaluated in three ways: the size and effectiveness of the representation, including the type information it provides; compiler performance for several interprocedural problems; and illustrative examples of the benefits LLVM provides for several challenging compiler problems.
Journal ArticleDOI
The JPEG still picture compression standard
TL;DR: The Baseline method has been by far the most widely implemented JPEG method to date, and is sufficient in its own right for a large number of applications.
Proceedings ArticleDOI
The PARSEC benchmark suite: characterization and architectural implications
TL;DR: This paper presents and characterizes the Princeton Application Repository for Shared-Memory Computers (PARSEC), a benchmark suite for studies of Chip-Multiprocessors (CMPs), and shows that the benchmark suite covers a wide spectrum of working sets, locality, data sharing, synchronization and off-chip traffic.
Related Papers (5)
Green: a framework for supporting energy-conscious programming using controlled approximation
Woongki Baek,Trishul Chilimbi +1 more