Efficient synthesis of out-of-core algorithms using a nonlinear optimization solver
Document Type
Conference Proceeding
Publication Date
12-1-2004
Abstract
We address the problem of efficient out-of-core code generation for a special class of imperfectly nested loops encoding tensor contractions. These loops operate on arrays too large to fit in physical memory. The problem involves determining optimal tiling and placement of disk I/O statements. This entails a search in an explosively large parameter space. We formulate the problem as a non-linear optimization problem and use a discrete constraint solver to generate optimized out-of-core code. Measurements on sequential and parallel versions of the generated code demonstrate the effectiveness of the proposed approach.
Publication Source (Journal or Book title)
Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)
First Page
471
Last Page
480
Recommended Citation
Krishnan, S., Krishnamoorthy, S., Baumgartner, G., Lam, C., Ramanujam, J., Sadayappan, P., & Choppella, V. (2004). Efficient synthesis of out-of-core algorithms using a nonlinear optimization solver. Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM), 18, 471-480. Retrieved from https://repository.lsu.edu/eecs_pubs/1647