Schedule-Independent Storage Mapping for Loops. - Michelle Mills Strout; Larry Carter; Jeanne Ferrante; Beth Simon (ASPLOS, 1998)

Asynchronous Dynamic Load Balancing of Tiles. - Tung Nguyen; Michelle Mills Strout; Larry Carter; Jeanne Ferrante (PP, 1999)

Using Apples to Schedule Simple SARA on the Computational Grid. - Alan Su 001; Francine Berman; Richard Wolski; Michelle Mills Strout (Int. J. High Perform. Comput. Appl., 1999)

Rescheduling for Locality in Sparse Matrix Computations. - Michelle Mills Strout; Larry Carter; Jeanne Ferrante (International Conference on Computational Science (1), 2001)

Combining Performance Aspects of Irregular Gauss-Seidel Via Sparse Tiling. - Michelle Mills Strout; Larry Carter; Jeanne Ferrante; Jonathan Freeman; Barbara Kreaseck (LCPC, 2002)

Compile-time composition of run-time data and iteration reorderings. - Michelle Mills Strout; Larry Carter; Jeanne Ferrante (PLDI, 2003)

Metrics and models for reordering transformations. - Michelle Mills Strout; Paul D. Hovland (Memory System Performance, 2004)

Sparse Tiling for Stationary Iterative Methods. - Michelle Mills Strout; Larry Carter; Jeanne Ferrante; Barbara Kreaseck (Int. J. High Perform. Comput. Appl., 2004)

Representation-independent program analysis. - Michelle Mills Strout; John M. Mellor-Crummey; Paul D. Hovland (PASTE, 2005)

Hybrid Static/Dynamic Activity Analysis. - Barbara Kreaseck; Luis Ramos; Scott Easterday; Michelle Mills Strout; Paul D. Hovland (International Conference on Computational Science (4), 2006)

Linearity Analysis for Automatic Differentiation. - Michelle Mills Strout; Paul D. Hovland (International Conference on Computational Science (4), 2006)

Data-Flow Analysis for MPI Programs. - Michelle Mills Strout; Barbara Kreaseck; Paul D. Hovland (ICPP, 2006)

Term Graphs for Computing Derivatives in Imperative Languages. - Paul D. Hovland; Boyana Norris; Michelle Mills Strout; Jean Utke (TERMGRAPH@ETAPS, 2006)

Computations on Iteration Spaces. - Sanjay V. Rajopadhye; Lakshimarayanan Renganarayana; Gautam Gupta; Michelle Mills Strout (The Compiler Design Handbook, 2nd ed., 2007)

FacePerf: Benchmarks for Face Recognition Algorithms. - David S. Bolme; Michelle Strout; J. Ross Beveridge (IISWC, 2007)

Parameterized tiled loops for free. - Lakshminarayanan Renganarayanan; DaeGon Kim; Sanjay V. Rajopadhye; Michelle Mills Strout (PLDI, 2007)

Multi-level tiling: M for the price of one. - DaeGon Kim; Lakshminarayanan Renganarayanan; Dave Rostron; Sanjay V. Rajopadhye; Michelle Mills Strout (SC, 2007)

Smashing: Folding Space to Tile through Time. - Nissa Osheim; Michelle Mills Strout; Dave Rostron; Sanjay V. Rajopadhye (LCPC, 2008)

Automatic Determination of May/Must Set Usage in Data-Flow Analysis. - Andrew Stone; Michelle Strout; Shweta Behere (SCAM, 2008)

OpenAD/F: A Modular Open-Source Tool for Automatic Differentiation of Fortran Codes. - Jean Utke; Uwe Naumann; Michael W. Fagan; Nathan R. Tallent; Michelle Mills Strout; Patrick Heimbach; Chris Hill; Carl Wunsch (ACM Trans. Math. Softw., 2008)

Improving Random Walk Performance. - Ilya Safro; Paul D. Hovland; Jaewook Shin; Michelle Mills Strout (CSC, 2009)

Evaluation of Hierarchical Mesh Reorderings. - Michelle Mills Strout; Nissa Osheim; Dave Rostron; Paul D. Hovland; Alex Pothen (ICCS (1), 2009)

May/must analysis and the DFAGen data-flow analysis generator. - Andrew Stone; Michelle Strout; Shweta Behere (Inf. Softw. Technol., 2009)

Scalable simulation of complex network routing policies. - Andrew Ian Stone; Steve DiBenedetto; Michelle Mills Strout; Daniel Massey (Conf. Computing Frontiers, 2010)

Performance Evaluation of an Irregular Application Parallelized in Java. - Christopher D. Krieger; Michelle Mills Strout (ICPP Workshops, 2010)

Mesa: automatic generation of lookup table optimizations. - Chris Wilcox; Michelle Mills Strout; James M. Bieman (IWMSE@ICSE, 2011)

Tool support for software lookup table optimization. - Chris Wilcox; Michelle Mills Strout; James M. Bieman (Sci. Program., 2011)

A Fast Parallel Graph Partitioner for Shared-Memory Inspector/Executor Strategies. - Christopher D. Krieger; Michelle Mills Strout (LCPC, 2012)

Abstractions for Defining Semi-Regular Grids Orthogonally from Stencils. - Andrew Stone; Michelle Mills Strout (LCPC, 2012)

Set and Relation Manipulation for the Sparse Polyhedral Framework. - Michelle Mills Strout; Geri Georg; Catherine Olschanowsky (LCPC, 2012)

Establishing a Miniapp as a programmability proxy. - Andrew Stone; John M. Dennis; Michelle Strout (PPoPP, 2012)

Executing Optimized Irregular Applications Using Task Graphs within Existing Parallel Models. - Christopher D. Krieger; Michelle Mills Strout; Jonathan Roelofs; Amanreet Bajwa (SC Companion, 2012)

Optimizing Expression Selection for Lookup Table Program Transformation. - Chris Wilcox; Michelle Mills Strout; James M. Bieman (SCAM, 2012)

Parameterized loop tiling. - Lakshminarayanan Renganarayanan; DaeGon Kim; Michelle Mills Strout; Sanjay V. Rajopadhye (ACM Trans. Program. Lang. Syst., 2012)

Abstractions to separate concerns in semi-regular grids. - Andrew Stone; Michelle Mills Strout (ICS, 2013)

Loop Chaining: A Programming Abstraction for Balancing Locality and Parallelism. - Christopher D. Krieger; Michelle Mills Strout; Catherine Olschanowsky; Andrew Stone; Stephen M. Guzik; Xinfeng Gao; Carlo Bertolli; Paul H. J. Kelly; Gihan R. Mudalige; Brian van Straalen; Samuel Williams 001 (IPDPS Workshops, 2013)

Non-affine Extensions to Polyhedral Code Generation. - Anand Venkat; Manu Shantharam; Mary W. Hall; Michelle Mills Strout (CGO, 2014)

PDSEC Introduction and Committees. - Peter E. Strazdins; Raphaël Couturier; Michelle Mills Strout; Keita Teranishi; Thomas Rauber; Gudula Rünger; Laurence T. Yang (IPDPS Workshops, 2014)

Generalizing Run-Time Tiling with the Loop Chain Abstraction. - Michelle Mills Strout; Fabio Luporini; Christopher D. Krieger; Carlo Bertolli; Gheorghe-Teodor Bercea; Catherine Olschanowsky; J. Ramanujam; Paul H. J. Kelly (IPDPS, 2014)

An Approach for Proving the Correctness of Inspector/Executor Transformations. - Michael Norrish; Michelle Mills Strout (LCPC, 2014)

A Study on Balancing Parallelism, Data Locality, and Recomputation in Existing PDE Solvers. - Catherine Mills Olschanowsky; Michelle Mills Strout; Stephen M. Guzik; John Loffeld; Jeffrey Hittinger (SC, 2014)

The Chemistry Between High School Students and Computer Science. - Timothy T. Lenczycki; Kelly Suto; Christina Williams; Michelle Mills Strout (CoRR, 2014)

An optimization-based approach to lookup table program transformations. - Chris Wilcox; Michelle Mills Strout; James M. Bieman (J. Softw. Evol. Process., 2014)

Parameterized Diamond Tiling for Stencil Computations with Chapel parallel iterators. - Ian J. Bertolacci; Catherine Olschanowsky; Ben Harshbarger; Bradford L. Chamberlain; David G. Wonnacott; Michelle Mills Strout (ICS, 2015)

Loop and data transformations for sparse matrix code. - Anand Venkat; Mary W. Hall; Michelle Strout (PLDI, 2015)

Analyzing Parallel Programming Models for Magnetic Resonance Imaging. - Forest Danford; Eric Welch; Julio Cárdenas-Rodríguez; Michelle Mills Strout (LCPC, 2016)

Identifying and Scheduling Loop Chains Using Directives. - Ian J. Bertolacci; Michelle Mills Strout; Stephen M. Guzik; Jordan Riley; Catherine Olschanowsky (WACCPD@SC, 2016)

Automating wavefront parallelization for sparse matrix computations. - Anand Venkat; Mahdi Soltan Mohammadi; Jongsoo Park; Hongbo Rong; Rajkishore Barik; Michelle Mills Strout; Mary W. Hall (SC, 2016)

An approach for code generation in the Sparse Polyhedral Framework. - Michelle Mills Strout; Alan LaMielle; Larry Carter; Jeanne Ferrante; Barbara Kreaseck; Catherine Olschanowsky (Parallel Comput., 2016)

Language-Agnostic Optimization and Parallelization for Interpreted Languages. - Michelle Mills Strout; Saumya Debray; Kate Isaacs; Barbara Kreaseck; Julio Cárdenas-Rodríguez; Bonnie L. Hurwitz; Kat Volk; Sam Badger; Jesse Bartels; Ian J. Bertolacci; Sabin Devkota; Anthony Encinas; et al. (LCPC, 2017)

Sympiler: transforming sparse matrix codes by decoupling symbolic analysis. - Kazem Cheshmi; Shoaib Kamil 001; Michelle Mills Strout; Maryam Mehri Dehnavi (SC, 2017)

Handling Nested Parallelism and Extreme Load Imbalance in an Orbital Analysis Code. - Benjamin Gaska; Neha Jothi; Mahdi Soltan Mohammadi; Kat Volk; Michelle Mills Strout (CoRR, 2017)

Transforming loop chains via macro dataflow graphs. - Eddie C. Davis; Michelle Mills Strout; Catherine Olschanowsky (CGO, 2018)

Iterator-Based Optimization of Imperfectly-Nested Loops. - Daniel A. Feshbach; Mary Glaser; Michelle Strout; David G. Wonnacott (IPDPS Workshops, 2018)

Extending OpenMP to Facilitate Loop Optimization. - Ian J. Bertolacci; Michelle Mills Strout; Bronis R. de Supinski; Thomas R. W. Scogland; Eddie C. Davis; Catherine Olschanowsky (IWOMP, 2018)

Extending Index-Array Properties for Data Dependence Analysis. - Mahdi Soltan Mohammadi; Kazem Cheshmi; Maryam Mehri Dehnavi; Anand Venkat; Tomofumi Yuki; Michelle Mills Strout (LCPC, 2018)

ParSy: inspection and transformation of sparse matrix computations for parallelism. - Kazem Cheshmi; Shoaib Kamil 001; Michelle Mills Strout; Maryam Mehri Dehnavi (SC, 2018)

Sparse Matrix Code Dependence Analysis Simplification at Compile Time. - Mahdi Soltan Mohammadi; Kazem Cheshmi; Ganesh Gopalakrishnan; Mary W. Hall; Maryam Mehri Dehnavi; Anand Venkat; Tomofumi Yuki; Michelle Mills Strout (CoRR, 2018)

Parallelizable adjoint stencil computations using transposed forward-mode algorithmic differentiation. - Jan Christian Hückelheim; Paul D. Hovland; Michelle Mills Strout; Jens-Dominik Müller (Optim. Methods Softw., 2018)

The Sparse Polyhedral Framework: Composing Compiler-Generated Inspector-Executor Code. - Michelle Mills Strout; Mary W. Hall; Catherine Olschanowsky (Proc. IEEE, 2018)

Automatic Parallelization of Irregular x86-64 Loops. - Brandon Neth; Michelle Mills Strout (CGO, 2019)

Sparse computation data dependence simplification for efficient compiler-generated inspectors. - Mahdi Soltan Mohammadi; Tomofumi Yuki; Kazem Cheshmi; Eddie C. Davis; Mary W. Hall; Maryam Mehri Dehnavi; Payal Nandy; Catherine Olschanowsky; Anand Venkat; Michelle Mills Strout (PLDI, 2019)

Reverse-mode algorithmic differentiation of an OpenMP-parallel compressible flow solver. - Jan Hückelheim; Paul D. Hovland; Michelle Mills Strout; Jens-Dominik Müller (Int. J. High Perform. Comput. Appl., 2019)

Using the loop chain abstraction to schedule across loops in existing code. - Ian J. Bertolacci; Michelle Mills Strout; Jordan Riley; Stephen M. Guzik; Eddie C. Davis; Catherine Olschanowsky (Int. J. High Perform. Comput. Netw., 2019)

Unified Sequential Optimization Directives in OpenMP. - Brandon Neth; Thomas R. W. Scogland; Michelle Mills Strout; Bronis R. de Supinski (IWOMP, 2020)

Expanding Opportunities for Array Privatization in Sparse Computations. - Mahdi Soltan Mohammadi; Mary W. Hall; Michelle Mills Strout (LCPC, 2020)

MatRox: modular approach for improving data locality in hierarchical (Mat)rix App(Rox)imation. - Bangtian Liu; Kazem Cheshmi; Saeed Soori; Michelle Mills Strout; Maryam Mehri Dehnavi (PPoPP, 2020)

An Object-Oriented Interface to The Sparse Polyhedral Library. - Tobi Popoola; Ravi Shankar; Anna Rift; Shivani Singh; Eddie C. Davis; Michelle Mills Strout; Catherine Olschanowsky (COMPSAC, 2021)

Parallelizing Compiler Translation Validation Using Happens-Before and Task-Set. - Jixin Han; Tomofumi Yuki; Michelle Mills Strout; Dan Umeda; Hironori Kasahara; Keiji Kimura (CANDAR (Workshops), 2021)

Inter-loop optimization in RAJA using loop chains. - Brandon Neth; Thomas R. W. Scogland; Bronis R. de Supinski; Michelle Mills Strout (ICS, 2021)

Potential of Interpreter Specialization for Data Analysis. - Wei He; Michelle Mills Strout (ISC Workshops, 2021)

Composing Loop-carried Dependence with Other Loops. - Kazem Cheshmi; Michelle Mills Strout; Maryam Mehri Dehnavi (CoRR, 2021)

HDagg: Hybrid Aggregation of Loop-carried Dependence Iterations in Sparse Matrix Computations. - Behrooz Zarebavani; Kazem Cheshmi; Bangtian Liu; Michelle Mills Strout; Maryam Mehri Dehnavi (IPDPS, 2022)

Optimizing sparse computations jointly. - Kazem Cheshmi; Michelle Mills Strout; Maryam Mehri Dehnavi (PPoPP, 2022)

Code Synthesis for Sparse Tensor Format Conversion and Optimization. - Tobi Popoola; Tuowen Zhao; Aaron St. George; Kalyan Bhetwal; Michelle Mills Strout; Mary W. Hall; Catherine Olschanowsky (CGO, 2023)

Runtime Composition of Iterations for Fusing Loop-carried Sparse Dependence. - Kazem Cheshmi; Michelle Strout; Maryam Mehri Dehnavi (SC, 2023)

Polyhedral Specification and Code Generation of Sparse Tensor Contraction with Co-iteration. - Tuowen Zhao; Tobi Popoola; Mary W. Hall; Catherine Olschanowsky; Michelle Strout (ACM Trans. Archit. Code Optim., 2023)

Consider an Applications-First Approach for PDC. - Michelle Strout (CoRR, 2024)