Articoli con mandati relativi all'accesso pubblico - Michelle Mills StroutUlteriori informazioni
Disponibili pubblicamente: 31
Loop and data transformations for sparse matrix code
A Venkat, M Hall, M Strout
ACM SIGPLAN Notices 50 (6), 521-532, 2015
Mandati: US Department of Energy
The sparse polyhedral framework: Composing compiler-generated inspector-executor code
MM Strout, M Hall, C Olschanowsky
Proceedings of the IEEE 106 (11), 1921-1934, 2018
Mandati: US National Science Foundation
Automating wavefront parallelization for sparse matrix computations
A Venkat, MS Mohammadi, J Park, H Rong, R Barik, MM Strout, M Hall
SC'16: Proceedings of the International Conference for High Performance …, 2016
Mandati: US National Science Foundation, US Department of Energy
An approach for code generation in the sparse polyhedral framework
MM Strout, A LaMielle, L Carter, J Ferrante, B Kreaseck, C Olschanowsky
Parallel Computing 53, 32-57, 2016
Mandati: US National Science Foundation, US Department of Energy
Parameterized diamond tiling for stencil computations with chapel parallel iterators
IJ Bertolacci, C Olschanowsky, B Harshbarger, BL Chamberlain, ...
Proceedings of the 29th ACM on International Conference on Supercomputing …, 2015
Mandati: US Department of Energy
Sympiler: transforming sparse matrix codes by decoupling symbolic analysis
K Cheshmi, S Kamil, MM Strout, MM Dehnavi
Proceedings of the International Conference for High Performance Computing …, 2017
Mandati: US National Science Foundation
A study on balancing parallelism, data locality, and recomputation in existing PDE solvers
C Olschanowsky, MM Strout, S Guzik, J Loffeld, J Hittinger
SC'14: Proceedings of the International Conference for High Performance …, 2014
Mandati: US Department of Energy
Sparse computation data dependence simplification for efficient compiler-generated inspectors
MS Mohammadi, T Yuki, K Cheshmi, EC Davis, M Hall, MM Dehnavi, ...
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language …, 2019
Mandati: US National Science Foundation
ParSy: inspection and transformation of sparse matrix computations for parallelism
K Cheshmi, S Kamil, MM Strout, MM Dehnavi
SC18: International Conference for High Performance Computing, Networking …, 2018
Mandati: US National Science Foundation
Loop chaining: A programming abstraction for balancing locality and parallelism
CD Krieger, MM Strout, C Olschanowsky, A Stone, S Guzik, X Gao, ...
2013 IEEE International Symposium on Parallel & Distributed Processing …, 2013
Mandati: UK Engineering and Physical Sciences Research Council
Generalizing run-time tiling with the loop chain abstraction
MM Strout, F Luporini, CD Krieger, C Bertolli, GT Bercea, C Olschanowsky, ...
2014 IEEE 28th International Parallel and Distributed Processing Symposium …, 2014
Mandati: UK Engineering and Physical Sciences Research Council
Transforming loop chains via macro dataflow graphs
EC Davis, MM Strout, C Olschanowsky
Proceedings of the 2018 International Symposium on Code Generation and …, 2018
Mandati: US National Science Foundation, US Department of Energy
Mesa: automatic generation of lookup table optimizations
C Wilcox, MM Strout, JM Bieman
Proceedings of the 4th International Workshop on Multicore Software …, 2011
Mandati: US National Institutes of Health
Reverse-mode algorithmic differentiation of an OpenMP-parallel compressible flow solver
J Hückelheim, P Hovland, MM Strout, JD Müller
The International Journal of High Performance Computing Applications 33 (1 …, 2019
Mandati: US Department of Energy, UK Engineering and Physical Sciences Research Council
Parallelizable adjoint stencil computations using transposed forward-mode algorithmic differentiation
JC Hückelheim, PD Hovland, MM Strout, JD Müller
Optimization Methods and Software 33 (4-6), 672-693, 2018
Mandati: US Department of Energy, UK Engineering and Physical Sciences Research Council
Polyhedral specification and code generation of sparse tensor contraction with co-iteration
T Zhao, T Popoola, M Hall, C Olschanowsky, M Strout
ACM Transactions on Architecture and Code Optimization 20 (1), 1-26, 2022
Mandati: US National Science Foundation, US Department of Energy
Abstractions for specifying sparse matrix data transformations
P Nandy, M Hall, E Davis, C Olschanowsky, M Mohammadi, W He, ...
Proceedings of the Eighth International Workshop on Polyhedral Compilation …, 2018
Mandati: US National Science Foundation
Identifying and scheduling loop chains using directives
IJ Bertolacci, MM Strout, S Guzik, J Riley, C Olschanowsky
2016 Third Workshop on Accelerator Programming Using Directives (WACCPD), 57-67, 2016
Mandati: US National Science Foundation
Tool support for software lookup table optimization
C Wilcox, MM Strout, JM Bieman
Scientific programming 19 (4), 213-229, 2011
Mandati: US National Institutes of Health
Using the loop chain abstraction to schedule across loops in existing code
IJ Bertolacci, MM Strout, J Riley, SMJ Guzik, EC Davis, C Olschanowsky
International Journal of High Performance Computing and Networking 13 (1 …, 2019
Mandati: US National Science Foundation
Le informazioni sulla pubblicazione e sul finanziamento vengono stabilite automaticamente da un software