Autogen: Automatic Discovery of Efficient Recursive Divide-8-Conquer Algorithms for Solving Dynamic Programming Problems
© 2017 ACM. We present Autogen-an algorithm that for a wide class of dynamic programming (DP) problems automatically discovers highly efficient cache-oblivious parallel recursive divide-And-conquer algorithms from inefficient iterative descriptions of DP recurrences. Autogen analyzes the set of DP t...
Main Authors: | Chowdhury, Rezaul, Ganapathi, Pramod, Tschudi, Stephen, Tithi, Jesmin Jahan, Bachmeier, Charles, Leiserson, Charles E, Solar-Lezama, Armando, Kuszmaul, Bradley C, Tang, Yuan |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM)
2021
|
Online Access: | https://hdl.handle.net/1721.1/134866 |
Similar Items
-
AUTOGEN: automatic discovery of cache-oblivious parallel recursive algorithms for solving dynamic programs
by: Chowdhury, Rezaul, et al.
Published: (2018) -
Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations
by: Chowdhury, Rezaul, et al.
Published: (2017) -
Divide and Conquer?
by: Roxane Coche, et al.
Published: (2023-12-01) -
Cheaters divide and conquer
by: Kirsten Bomblies
Published: (2014-06-01) -
The Connection Machine CM-5, Moore's Law, and the Future of Computational Performance
by: Kuszmaul, Bradley, et al.
Published: (2023)