Randomized accuracy-aware program transformations for efficient approximate computations

DOI10.1145/2103656.2103710MaRDI QIDQ2942894zbMATH OpenOpenAlexFDO

Authors Zeyuan Allen Zhu, Sasa Misailovic, Jonathan Kelner, Martin C. Rinard

Publication date 11 September 2015

Published in Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2103656.2103710

zbMATH Keywords

discretizationoptimizationerror-time tradeoff

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Verifying relative safety, accuracy, and termination for program approximations
• Computer Aided Verification
• Semantics-Based Transformation of Arithmetic Expressions
• Preemptive scheduling for approximate computing on heterogeneous machines: tradeoff between weighted accuracy and makespan
• Loop transformations, convexity, pruning and optimization

Cited in

(2)

• Verifying relative safety, accuracy, and termination for program approximations
• When are software verification results valid for approximate hardware?

This page was built for publication: Randomized accuracy-aware program transformations for efficient approximate computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942894)