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
Posted Content
Exploiting Errors for Efficiency: A Survey from Circuits to Algorithms
Phillip Stanley-Marbell,Armin Alaghi,Michael Carbin,Eva Darulova,Lara Dolecek,Andreas Gerstlauer,Syed Ghayoor Abbas Gillani,Djordje Jevdjic,Thierry Moreau,Mattia Cacciotti,Alexandros Daglis,Natalie Enright Jerger,Babak Falsafi,Sasa Misailovic,Adrian Sampson,Damien Zufferey +15 more
TL;DR: A synthesis of research results on computing systems that only make as many errors as their users can tolerate is presented, for the first time, from across the disciplines of computer aided design of circuits, digital system design, computer architecture, programming languages, operating systems, and information theory.
Proceedings ArticleDOI
Approximate Multiplier Architectures Through Partial Product Perforation: Power-Area Tradeoffs Analysis
TL;DR: This paper designs new approximate hardware multipliers and proposes the Partial Product Perforation technique, which omits a number of consecutive partial products by perforating their generation, and applies the partial product perforation method on different multiplier architectures and exposes the optimal configurations for different error values.
Journal ArticleDOI
Verifying Relative Safety, Accuracy, and Termination for Program Approximations
TL;DR: This work shows the application of automated differential verification towards verifying relative safety, accuracy, and termination criteria for a class of program approximations, and uses SMT-based invariant inference to automate the verification of such specifications.
Proceedings ArticleDOI
Mining precise performance-aware behavioral models from existing instrumentation
TL;DR: Perfume is presented, a model-inference algorithm that improves on the state of the art by using performance information to differentiate otherwise similar-appearing executions and to remove false positives from the inferred models.
Proceedings ArticleDOI
A review of approximate computing techniques towards fault mitigation in HW/SW systems
TL;DR: This paper presents a review of approximate computing techniques that can be used to reduce the costs in the mitigation of radiation effects at hardware and software levels and examines several recent works that have presented promising results in this way.
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