Michelle M. Strout, Ph.D.
Affiliations: | 2003 | University of California, San Diego, La Jolla, CA |
Area:
Computer ScienceGoogle:
"Michelle Strout"Parents
Sign in to add mentorLarry Carter | grad student | 2003 | UCSD (Computer Science Tree) | |
(Performance transformations for irregular applications.) | ||||
Jeanne Ferrante | grad student | 2003 | UCSD | |
(Performance transformations for irregular applications.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Bertolacci IJ, Strout MM, Riley J, et al. (2019) Using the loop chain abstraction to schedule across loops in existing code International Journal of High Performance Computing and Networking. 13: 86-104 |
Hückelheim J, Hovland PD, Strout MM, et al. (2019) Reverse-mode algorithmic differentiation of an OpenMP-parallel compressible flow solver International Journal of High Performance Computing Applications. 33: 140-154 |
Hückelheim JC, Hovland PD, Strout MM, et al. (2018) Parallelizable adjoint stencil computations using transposed forward-mode algorithmic differentiation Optimization Methods & Software. 33: 672-693 |
Strout MM, LaMielle A, Carter L, et al. (2016) An approach for code generation in the Sparse Polyhedral Framework Parallel Computing. 53: 32-57 |
Bertolacci IJ, Olschanowsky C, Harshbarger B, et al. (2015) Parameterized diamond tiling for stencil computations with Chapel parallel iterators Proceedings of the International Conference On Supercomputing. 2015: 197-206 |
Norrish M, Strout MM. (2015) An approach for proving the correctness of inspector/executor transformations Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8967: 131-145 |
Venkat A, Shantharam M, Hall M, et al. (2014) Non-affine extensions to polyhedral code generation Proceedings of the 12th Acm/Ieee International Symposium On Code Generation and Optimization, Cgo 2014. 185-195 |
Olschanowsky C, Strout MM, Guzik S, et al. (2014) A Study on Balancing Parallelism, Data Locality, and Recomputation in Existing PDE Solvers International Conference For High Performance Computing, Networking, Storage and Analysis, Sc. 2015: 793-804 |
Strout MM, Luporini F, Krieger CD, et al. (2014) Generalizing run-time tiling with the loop chain abstraction Proceedings of the International Parallel and Distributed Processing Symposium, Ipdps. 1136-1145 |
Wilcox C, Strout MM, Bieman JM. (2014) An optimization-based approach to lookup table program transformations Journal of Software: Evolution and Process. 26: 533-551 |