Language and Compiler Support for Auto-Tuning Variable-Accuracy Algorithms
Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance optimization in situations where perfect precision is not necessary. To this end, programmers often use approximation al...
Main Authors: | Ansel, Jason Andrew, Wong, Yee Lok, Chan, Cy, Olszewski, Marek Krystyn, Edelman, Alan, Amarasinghe, Saman P. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
IEEE Computer Society
2011
|
Online Access: | http://hdl.handle.net/1721.1/67465 https://orcid.org/0000-0001-7676-3133 https://orcid.org/0000-0002-7231-7643 |
Similar Items
-
Language and Compiler Support for Auto-Tuning Variable-Accuracy Algorithms
by: Ansel, Jason Andrew, et al.
Published: (2012) -
Language and Compiler Support for Auto-Tuning Variable-Accuracy Algorithms
by: Ansel, Jason, et al.
Published: (2010) -
PetaBricks: A Language and Compiler for Algorithmic Choice
by: Ansel, Jason Andrew, et al.
Published: (2011) -
Compiler Support for Structured Data
by: Amarasinghe, Saman
Published: (2023) -
PetaBricks : a language and compiler for algorithmic choice
by: Ansel, Jason (Jason Andrew)
Published: (2010)