Michelle Mills Strout

Orcid: 0000-0001-7646-4766

According to our database1, Michelle Mills Strout authored at least 78 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Consider an Applications-First Approach for PDC.
CoRR, 2024

2023
Polyhedral Specification and Code Generation of Sparse Tensor Contraction with Co-iteration.
ACM Trans. Archit. Code Optim., March, 2023

Runtime Composition of Iterations for Fusing Loop-carried Sparse Dependence.
Proceedings of the International Conference for High Performance Computing, 2023

Code Synthesis for Sparse Tensor Format Conversion and Optimization.
Proceedings of the 21st ACM/IEEE International Symposium on Code Generation and Optimization, 2023

2022
Optimizing sparse computations jointly.
Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

HDagg: Hybrid Aggregation of Loop-carried Dependence Iterations in Sparse Matrix Computations.
Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium, 2022

2021
Composing Loop-carried Dependence with Other Loops.
CoRR, 2021

Potential of Interpreter Specialization for Data Analysis.
Proceedings of the High Performance Computing - ISC High Performance Digital 2021 International Workshops, Frankfurt am Main, Germany, June 24, 2021

Inter-loop optimization in RAJA using loop chains.
Proceedings of the ICS '21: 2021 International Conference on Supercomputing, 2021

Parallelizing Compiler Translation Validation Using Happens-Before and Task-Set.
Proceedings of the Ninth International Symposium on Computing and Networking, 2021

An Object-Oriented Interface to The Sparse Polyhedral Library.
Proceedings of the IEEE 45th Annual Computers, Software, and Applications Conference, 2021

2020
MatRox: modular approach for improving data locality in hierarchical (Mat)rix App(Rox)imation.
Proceedings of the PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2020

Expanding Opportunities for Array Privatization in Sparse Computations.
Proceedings of the Languages and Compilers for Parallel Computing, 2020

Unified Sequential Optimization Directives in OpenMP.
Proceedings of the OpenMP: Portable Multi-Level Parallelism on Modern Systems, 2020

2019
Using the loop chain abstraction to schedule across loops in existing code.
Int. J. High Perform. Comput. Netw., 2019

Reverse-mode algorithmic differentiation of an OpenMP-parallel compressible flow solver.
Int. J. High Perform. Comput. Appl., 2019

Sparse computation data dependence simplification for efficient compiler-generated inspectors.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

Automatic Parallelization of Irregular x86-64 Loops.
Proceedings of the IEEE/ACM International Symposium on Code Generation and Optimization, 2019

2018
The Sparse Polyhedral Framework: Composing Compiler-Generated Inspector-Executor Code.
Proc. IEEE, 2018

Parallelizable adjoint stencil computations using transposed forward-mode algorithmic differentiation.
Optim. Methods Softw., 2018

Sparse Matrix Code Dependence Analysis Simplification at Compile Time.
CoRR, 2018

ParSy: inspection and transformation of sparse matrix computations for parallelism.
Proceedings of the International Conference for High Performance Computing, 2018

Extending Index-Array Properties for Data Dependence Analysis.
Proceedings of the Languages and Compilers for Parallel Computing, 2018

Extending OpenMP to Facilitate Loop Optimization.
Proceedings of the Evolving OpenMP for Evolving Architectures, 2018

Iterator-Based Optimization of Imperfectly-Nested Loops.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, 2018

Transforming loop chains via macro dataflow graphs.
Proceedings of the 2018 International Symposium on Code Generation and Optimization, 2018

2017
Handling Nested Parallelism and Extreme Load Imbalance in an Orbital Analysis Code.
CoRR, 2017

Sympiler: transforming sparse matrix codes by decoupling symbolic analysis.
Proceedings of the International Conference for High Performance Computing, 2017

Language-Agnostic Optimization and Parallelization for Interpreted Languages.
Proceedings of the Languages and Compilers for Parallel Computing, 2017

2016
An approach for code generation in the Sparse Polyhedral Framework.
Parallel Comput., 2016

Automating wavefront parallelization for sparse matrix computations.
Proceedings of the International Conference for High Performance Computing, 2016

Identifying and Scheduling Loop Chains Using Directives.
Proceedings of the Third Workshop on Accelerator Programming Using Directives, 2016

Analyzing Parallel Programming Models for Magnetic Resonance Imaging.
Proceedings of the Languages and Compilers for Parallel Computing, 2016

2015
Loop and data transformations for sparse matrix code.
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015

Parameterized Diamond Tiling for Stencil Computations with Chapel parallel iterators.
Proceedings of the 29th ACM on International Conference on Supercomputing, 2015

2014
An optimization-based approach to lookup table program transformations.
J. Softw. Evol. Process., 2014

The Chemistry Between High School Students and Computer Science.
CoRR, 2014

A Study on Balancing Parallelism, Data Locality, and Recomputation in Existing PDE Solvers.
Proceedings of the International Conference for High Performance Computing, 2014

An Approach for Proving the Correctness of Inspector/Executor Transformations.
Proceedings of the Languages and Compilers for Parallel Computing, 2014

Generalizing Run-Time Tiling with the Loop Chain Abstraction.
Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

PDSEC Introduction and Committees.
Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014

Non-affine Extensions to Polyhedral Code Generation.
Proceedings of the 12th Annual IEEE/ACM International Symposium on Code Generation and Optimization, 2014

2013
Loop Chaining: A Programming Abstraction for Balancing Locality and Parallelism.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

Abstractions to separate concerns in semi-regular grids.
Proceedings of the International Conference on Supercomputing, 2013

2012
Parameterized loop tiling.
ACM Trans. Program. Lang. Syst., 2012

Optimizing Expression Selection for Lookup Table Program Transformation.
Proceedings of the 12th IEEE International Working Conference on Source Code Analysis and Manipulation, 2012

Executing Optimized Irregular Applications Using Task Graphs within Existing Parallel Models.
Proceedings of the 2012 SC Companion: High Performance Computing, 2012

Establishing a Miniapp as a programmability proxy.
Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2012

Set and Relation Manipulation for the Sparse Polyhedral Framework.
Proceedings of the Languages and Compilers for Parallel Computing, 2012

Abstractions for Defining Semi-Regular Grids Orthogonally from Stencils.
Proceedings of the Languages and Compilers for Parallel Computing, 2012

A Fast Parallel Graph Partitioner for Shared-Memory Inspector/Executor Strategies.
Proceedings of the Languages and Compilers for Parallel Computing, 2012

2011
Tool support for software lookup table optimization.
Sci. Program., 2011

Mesa: automatic generation of lookup table optimizations.
Proceedings of the 4th International Workshop on Multicore Software Engineering, 2011

2010
Performance Evaluation of an Irregular Application Parallelized in Java.
Proceedings of the 39th International Conference on Parallel Processing, 2010

Scalable simulation of complex network routing policies.
Proceedings of the 7th Conference on Computing Frontiers, 2010

2009
May/must analysis and the DFAGen data-flow analysis generator.
Inf. Softw. Technol., 2009

Evaluation of Hierarchical Mesh Reorderings.
Proceedings of the Computational Science, 2009

Improving Random Walk Performance.
Proceedings of the 2009 International Conference on Scientific Computing, 2009

2008
OpenAD/F: A Modular Open-Source Tool for Automatic Differentiation of Fortran Codes.
ACM Trans. Math. Softw., 2008

Automatic Determination of May/Must Set Usage in Data-Flow Analysis.
Proceedings of the Eighth IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2008), 2008

Smashing: Folding Space to Tile through Time.
Proceedings of the Languages and Compilers for Parallel Computing, 2008

2007
Multi-level tiling: M for the price of one.
Proceedings of the ACM/IEEE Conference on High Performance Networking and Computing, 2007

Parameterized tiled loops for free.
Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, 2007

FacePerf: Benchmarks for Face Recognition Algorithms.
Proceedings of the IEEE 10th International Symposium on Workload Characterization, 2007

Computations on Iteration Spaces.
Proceedings of the Compiler Design Handbook: Optimizations and Machine Code Generation, 2007

2006
Term Graphs for Computing Derivatives in Imperative Languages.
Proceedings of the Third International Workshop on Term Graph Rewriting, 2006

Data-Flow Analysis for MPI Programs.
Proceedings of the 2006 International Conference on Parallel Processing (ICPP 2006), 2006

Linearity Analysis for Automatic Differentiation.
Proceedings of the Computational Science, 2006

Hybrid Static/Dynamic Activity Analysis.
Proceedings of the Computational Science, 2006

2005
Representation-independent program analysis.
Proceedings of the 2005 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis For Software Tools and Engineering, 2005

2004
Sparse Tiling for Stationary Iterative Methods.
Int. J. High Perform. Comput. Appl., 2004

Metrics and models for reordering transformations.
Proceedings of the 2004 workshop on Memory System Performance, 2004

2003
Compile-time composition of run-time data and iteration reorderings.
Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation 2003, 2003

2002
Combining Performance Aspects of Irregular Gauss-Seidel Via Sparse Tiling.
Proceedings of the Languages and Compilers for Parallel Computing, 15th Workshop, 2002

2001
Rescheduling for Locality in Sparse Matrix Computations.
Proceedings of the Computational Science - ICCS 2001, 2001

1999
Using Apples to Schedule Simple SARA on the Computational Grid.
Int. J. High Perform. Comput. Appl., 1999

Asynchronous Dynamic Load Balancing of Tiles.
Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, 1999

1998
Schedule-Independent Storage Mapping for Loops.
Proceedings of the ASPLOS-VIII Proceedings of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems, 1998


  Loading...