default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichelle Mills Strout
Michelle Strout
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j13]Tuowen Zhao
, Tobi Popoola, Mary W. Hall, Catherine Olschanowsky, Michelle Strout:
Polyhedral Specification and Code Generation of Sparse Tensor Contraction with Co-iteration. ACM Trans. Archit. Code Optim. 20(1): 16:1-16:26 (2023)- [c59]Tobi Popoola, Tuowen Zhao, Aaron St. George, Kalyan Bhetwal, Michelle Mills Strout, Mary W. Hall, Catherine Olschanowsky:
Code Synthesis for Sparse Tensor Format Conversion and Optimization. CGO 2023: 28-40 - [c58]Kazem Cheshmi, Michelle Strout, Maryam Mehri Dehnavi:
Runtime Composition of Iterations for Fusing Loop-carried Sparse Dependence. SC 2023: 89:1-89:15 - 2022
- [c57]Behrooz Zarebavani, Kazem Cheshmi, Bangtian Liu, Michelle Mills Strout, Maryam Mehri Dehnavi:
HDagg: Hybrid Aggregation of Loop-carried Dependence Iterations in Sparse Matrix Computations. IPDPS 2022: 1217-1227 - [c56]Kazem Cheshmi, Michelle Mills Strout, Maryam Mehri Dehnavi:
Optimizing sparse computations jointly. PPoPP 2022: 459-460 - [i6]Tuowen Zhao, Tobi Popoola, Mary W. Hall, Catherine Olschanowsky, Michelle Mills Strout:
Polyhedral Specification and Code Generation of Sparse Tensor Contraction with Co-Iteration. CoRR abs/2208.11858 (2022) - 2021
- [c55]Tobi Popoola, Ravi Shankar, Anna Rift, Shivani Singh, Eddie C. Davis, Michelle Mills Strout, Catherine Olschanowsky:
An Object-Oriented Interface to The Sparse Polyhedral Library. COMPSAC 2021: 1825-1831 - [c54]Jixin Han, Tomofumi Yuki, Michelle Mills Strout, Dan Umeda, Hironori Kasahara, Keiji Kimura:
Parallelizing Compiler Translation Validation Using Happens-Before and Task-Set. CANDAR (Workshops) 2021: 87-93 - [c53]Brandon Neth, Thomas R. W. Scogland, Bronis R. de Supinski, Michelle Mills Strout:
Inter-loop optimization in RAJA using loop chains. ICS 2021: 1-12 - [c52]Wei He, Michelle Mills Strout:
Potential of Interpreter Specialization for Data Analysis. ISC Workshops 2021: 212-225 - [i5]Kazem Cheshmi, Michelle Mills Strout, Maryam Mehri Dehnavi:
Composing Loop-carried Dependence with Other Loops. CoRR abs/2111.12238 (2021) - 2020
- [c51]Brandon Neth, Thomas R. W. Scogland, Michelle Mills Strout, Bronis R. de Supinski:
Unified Sequential Optimization Directives in OpenMP. IWOMP 2020: 85-97 - [c50]Mahdi Soltan Mohammadi, Mary W. Hall, Michelle Mills Strout:
Expanding Opportunities for Array Privatization in Sparse Computations. LCPC 2020: 29-37 - [c49]Bangtian Liu, Kazem Cheshmi, Saeed Soori, Michelle Mills Strout, Maryam Mehri Dehnavi:
MatRox: modular approach for improving data locality in hierarchical (Mat)rix App(Rox)imation. PPoPP 2020: 389-402
2010 – 2019
- 2019
- [j12]Jan Hückelheim, Paul D. Hovland, Michelle Mills Strout, Jens-Dominik Müller:
Reverse-mode algorithmic differentiation of an OpenMP-parallel compressible flow solver. Int. J. High Perform. Comput. Appl. 33(1) (2019) - [j11]Ian J. Bertolacci, Michelle Mills Strout, Jordan Riley, Stephen M. Guzik, Eddie C. Davis, Catherine Olschanowsky:
Using the loop chain abstraction to schedule across loops in existing code. Int. J. High Perform. Comput. Netw. 13(1): 86-104 (2019) - [c48]Brandon Neth, Michelle Mills Strout:
Automatic Parallelization of Irregular x86-64 Loops. CGO 2019: 266 - [c47]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:
Sparse computation data dependence simplification for efficient compiler-generated inspectors. PLDI 2019: 594-609 - 2018
- [j10]Jan Christian Hückelheim, Paul D. Hovland, Michelle Mills Strout, Jens-Dominik Müller:
Parallelizable adjoint stencil computations using transposed forward-mode algorithmic differentiation. Optim. Methods Softw. 33(4-6): 672-693 (2018) - [j9]Michelle Mills Strout, Mary W. Hall, Catherine Olschanowsky:
The Sparse Polyhedral Framework: Composing Compiler-Generated Inspector-Executor Code. Proc. IEEE 106(11): 1921-1934 (2018) - [c46]Eddie C. Davis, Michelle Mills Strout, Catherine Olschanowsky:
Transforming loop chains via macro dataflow graphs. CGO 2018: 265-277 - [c45]Daniel A. Feshbach, Mary Glaser, Michelle Strout, David G. Wonnacott:
Iterator-Based Optimization of Imperfectly-Nested Loops. IPDPS Workshops 2018: 906-914 - [c44]Ian J. Bertolacci, Michelle Mills Strout, Bronis R. de Supinski, Thomas R. W. Scogland, Eddie C. Davis, Catherine Olschanowsky:
Extending OpenMP to Facilitate Loop Optimization. IWOMP 2018: 53-65 - [c43]Mahdi Soltan Mohammadi, Kazem Cheshmi, Maryam Mehri Dehnavi, Anand Venkat, Tomofumi Yuki, Michelle Mills Strout:
Extending Index-Array Properties for Data Dependence Analysis. LCPC 2018: 78-93 - [c42]Kazem Cheshmi, Shoaib Kamil, Michelle Mills Strout, Maryam Mehri Dehnavi:
ParSy: inspection and transformation of sparse matrix computations for parallelism. SC 2018: 62:1-62:15 - [i4]Mahdi Soltan Mohammadi, Kazem Cheshmi, Ganesh Gopalakrishnan, Mary W. Hall, Maryam Mehri Dehnavi, Anand Venkat, Tomofumi Yuki, Michelle Mills Strout:
Sparse Matrix Code Dependence Analysis Simplification at Compile Time. CoRR abs/1807.10852 (2018) - 2017
- [c41]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, Benjamin Gaska, Brandon Neth, Theo Sackos, Jon Stephens, Sarah Willer, Babak Yadegari:
Language-Agnostic Optimization and Parallelization for Interpreted Languages. LCPC 2017: 36-46 - [c40]Kazem Cheshmi, Shoaib Kamil, Michelle Mills Strout, Maryam Mehri Dehnavi:
Sympiler: transforming sparse matrix codes by decoupling symbolic analysis. SC 2017: 13 - [i3]Kazem Cheshmi, Shoaib Kamil, Michelle Mills Strout, Maryam Mehri Dehnavi:
Sympiler: Transforming Sparse Matrix Codes by Decoupling Symbolic Analysis. CoRR abs/1705.06575 (2017) - [i2]Benjamin Gaska, Neha Jothi, Mahdi Soltan Mohammadi, Kat Volk, Michelle Mills Strout:
Handling Nested Parallelism and Extreme Load Imbalance in an Orbital Analysis Code. CoRR abs/1707.09668 (2017) - 2016
- [j8]Michelle Mills Strout, Alan LaMielle, Larry Carter, Jeanne Ferrante, Barbara Kreaseck, Catherine Olschanowsky:
An approach for code generation in the Sparse Polyhedral Framework. Parallel Comput. 53: 32-57 (2016) - [c39]Forest Danford, Eric Welch, Julio Cárdenas-Rodríguez, Michelle Mills Strout:
Analyzing Parallel Programming Models for Magnetic Resonance Imaging. LCPC 2016: 188-202 - [c38]Ian J. Bertolacci, Michelle Mills Strout, Stephen M. Guzik, Jordan Riley, Catherine Olschanowsky:
Identifying and Scheduling Loop Chains Using Directives. WACCPD@SC 2016: 57-67 - [c37]Anand Venkat, Mahdi Soltan Mohammadi, Jongsoo Park, Hongbo Rong, Rajkishore Barik, Michelle Mills Strout, Mary W. Hall:
Automating wavefront parallelization for sparse matrix computations. SC 2016: 480-491 - 2015
- [c36]Ian J. Bertolacci, Catherine Olschanowsky, Ben Harshbarger, Bradford L. Chamberlain, David G. Wonnacott, Michelle Mills Strout:
Parameterized Diamond Tiling for Stencil Computations with Chapel parallel iterators. ICS 2015: 197-206 - [c35]Anand Venkat, Mary W. Hall, Michelle Strout:
Loop and data transformations for sparse matrix code. PLDI 2015: 521-532 - 2014
- [j7]Chris Wilcox, Michelle Mills Strout, James M. Bieman:
An optimization-based approach to lookup table program transformations. J. Softw. Evol. Process. 26(6): 533-551 (2014) - [c34]Anand Venkat, Manu Shantharam, Mary W. Hall, Michelle Mills Strout:
Non-affine Extensions to Polyhedral Code Generation. CGO 2014: 185 - [c33]Michelle Mills Strout, Fabio Luporini, Christopher D. Krieger, Carlo Bertolli, Gheorghe-Teodor Bercea, Catherine Olschanowsky, J. Ramanujam, Paul H. J. Kelly:
Generalizing Run-Time Tiling with the Loop Chain Abstraction. IPDPS 2014: 1136-1145 - [c32]Peter E. Strazdins, Raphaël Couturier, Michelle Mills Strout, Keita Teranishi, Thomas Rauber, Gudula Rünger, Laurence T. Yang:
PDSEC Introduction and Committees. IPDPS Workshops 2014: 1138-1139 - [c31]Michael Norrish, Michelle Mills Strout:
An Approach for Proving the Correctness of Inspector/Executor Transformations. LCPC 2014: 131-145 - [c30]Catherine Mills Olschanowsky, Michelle Mills Strout, Stephen M. Guzik, John Loffeld, Jeffrey Hittinger:
A Study on Balancing Parallelism, Data Locality, and Recomputation in Existing PDE Solvers. SC 2014: 793-804 - [i1]Timothy T. Lenczycki, Kelly Suto, Christina Williams, Michelle Mills Strout:
The Chemistry Between High School Students and Computer Science. CoRR abs/1406.2222 (2014) - 2013
- [c29]Andrew Stone, Michelle Mills Strout:
Abstractions to separate concerns in semi-regular grids. ICS 2013: 3-12 - [c28]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:
Loop Chaining: A Programming Abstraction for Balancing Locality and Parallelism. IPDPS Workshops 2013: 375-384 - [e1]Sanjay V. Rajopadhye, Michelle Mills Strout:
Languages and Compilers for Parallel Computing, 24th International Workshop, LCPC 2011, Fort Collins, CO, USA, September 8-10, 2011. Revised Selected Papers. Lecture Notes in Computer Science 7146, Springer 2013, ISBN 978-3-642-36035-0 [contents] - 2012
- [j6]Lakshminarayanan Renganarayanan, DaeGon Kim, Michelle Mills Strout, Sanjay V. Rajopadhye:
Parameterized loop tiling. ACM Trans. Program. Lang. Syst. 34(1): 3:1-3:41 (2012) - [c27]Michelle Mills Strout, Geri Georg, Catherine Olschanowsky:
Set and Relation Manipulation for the Sparse Polyhedral Framework. LCPC 2012: 61-75 - [c26]Christopher D. Krieger, Michelle Mills Strout:
A Fast Parallel Graph Partitioner for Shared-Memory Inspector/Executor Strategies. LCPC 2012: 190-204 - [c25]Andrew Stone, Michelle Mills Strout:
Abstractions for Defining Semi-Regular Grids Orthogonally from Stencils. LCPC 2012: 273-274 - [c24]Andrew Stone, John M. Dennis, Michelle Strout:
Establishing a Miniapp as a programmability proxy. PPoPP 2012: 333-334 - [c23]Christopher D. Krieger, Michelle Mills Strout, Jonathan Roelofs, Amanreet Bajwa:
Executing Optimized Irregular Applications Using Task Graphs within Existing Parallel Models. SC Companion 2012: 261-268 - [c22]Chris Wilcox, Michelle Mills Strout, James M. Bieman:
Optimizing Expression Selection for Lookup Table Program Transformation. SCAM 2012: 84-93 - 2011
- [j5]Chris Wilcox, Michelle Mills Strout, James M. Bieman:
Tool support for software lookup table optimization. Sci. Program. 19(4): 213-229 (2011) - [c21]Chris Wilcox, Michelle Mills Strout, James M. Bieman:
Mesa: automatic generation of lookup table optimizations. IWMSE@ICSE 2011: 1-8 - 2010
- [c20]Andrew Ian Stone, Steve DiBenedetto, Michelle Mills Strout, Daniel Massey:
Scalable simulation of complex network routing policies. Conf. Computing Frontiers 2010: 347-356 - [c19]Christopher D. Krieger, Michelle Mills Strout:
Performance Evaluation of an Irregular Application Parallelized in Java. ICPP Workshops 2010: 227-235
2000 – 2009
- 2009
- [j4]Andrew Stone, Michelle Strout, Shweta Behere:
May/must analysis and the DFAGen data-flow analysis generator. Inf. Softw. Technol. 51(10): 1440-1453 (2009) - [c18]Ilya Safro, Paul D. Hovland, Jaewook Shin, Michelle Mills Strout:
Improving Random Walk Performance. CSC 2009: 108-112 - [c17]Michelle Mills Strout, Nissa Osheim, Dave Rostron, Paul D. Hovland, Alex Pothen:
Evaluation of Hierarchical Mesh Reorderings. ICCS (1) 2009: 540-549 - 2008
- [j3]Jean Utke, Uwe Naumann, Michael W. Fagan, Nathan R. Tallent, Michelle Mills Strout, Patrick Heimbach, Chris Hill, Carl Wunsch:
OpenAD/F: A Modular Open-Source Tool for Automatic Differentiation of Fortran Codes. ACM Trans. Math. Softw. 34(4): 18:1-18:36 (2008) - [c16]Nissa Osheim, Michelle Mills Strout, Dave Rostron, Sanjay V. Rajopadhye:
Smashing: Folding Space to Tile through Time. LCPC 2008: 80-93 - [c15]Andrew Stone, Michelle Strout, Shweta Behere:
Automatic Determination of May/Must Set Usage in Data-Flow Analysis. SCAM 2008: 153-162 - 2007
- [c14]David S. Bolme, Michelle Strout, J. Ross Beveridge:
FacePerf: Benchmarks for Face Recognition Algorithms. IISWC 2007: 114-119 - [c13]Lakshminarayanan Renganarayanan, DaeGon Kim, Sanjay V. Rajopadhye, Michelle Mills Strout:
Parameterized tiled loops for free. PLDI 2007: 405-414 - [c12]DaeGon Kim, Lakshminarayanan Renganarayanan, Dave Rostron, Sanjay V. Rajopadhye, Michelle Mills Strout:
Multi-level tiling: M for the price of one. SC 2007: 51 - [p1]Sanjay V. Rajopadhye, Lakshimarayanan Renganarayana, Gautam Gupta, Michelle Mills Strout:
Computations on Iteration Spaces. The Compiler Design Handbook, 2nd ed. 2007: 15 - 2006
- [c11]Michelle Mills Strout, Paul D. Hovland:
Linearity Analysis for Automatic Differentiation. International Conference on Computational Science (4) 2006: 574-581 - [c10]Barbara Kreaseck, Luis Ramos, Scott Easterday, Michelle Mills Strout, Paul D. Hovland:
Hybrid Static/Dynamic Activity Analysis. International Conference on Computational Science (4) 2006: 582-590 - [c9]Michelle Mills Strout, Barbara Kreaseck, Paul D. Hovland:
Data-Flow Analysis for MPI Programs. ICPP 2006: 175-184 - [c8]Paul D. Hovland, Boyana Norris, Michelle Mills Strout, Jean Utke:
Term Graphs for Computing Derivatives in Imperative Languages. TERMGRAPH@ETAPS 2006: 99-111 - 2005
- [c7]Michelle Mills Strout, John M. Mellor-Crummey, Paul D. Hovland:
Representation-independent program analysis. PASTE 2005: 67-74 - 2004
- [j2]Michelle Mills Strout, Larry Carter, Jeanne Ferrante, Barbara Kreaseck:
Sparse Tiling for Stationary Iterative Methods. Int. J. High Perform. Comput. Appl. 18(1): 95-113 (2004) - [c6]Michelle Mills Strout, Paul D. Hovland:
Metrics and models for reordering transformations. Memory System Performance 2004: 23-34 - 2003
- [c5]Michelle Mills Strout, Larry Carter, Jeanne Ferrante:
Compile-time composition of run-time data and iteration reorderings. PLDI 2003: 91-102 - 2002
- [c4]Michelle Mills Strout, Larry Carter, Jeanne Ferrante, Jonathan Freeman, Barbara Kreaseck:
Combining Performance Aspects of Irregular Gauss-Seidel Via Sparse Tiling. LCPC 2002: 90-110 - 2001
- [c3]Michelle Mills Strout, Larry Carter, Jeanne Ferrante:
Rescheduling for Locality in Sparse Matrix Computations. International Conference on Computational Science (1) 2001: 137-148
1990 – 1999
- 1999
- [j1]Alan Su, Francine Berman, Richard Wolski, Michelle Mills Strout:
Using Apples to Schedule Simple SARA on the Computational Grid. Int. J. High Perform. Comput. Appl. 13(3): 253-262 (1999) - [c2]Tung Nguyen, Michelle Mills Strout, Larry Carter, Jeanne Ferrante:
Asynchronous Dynamic Load Balancing of Tiles. PP 1999 - 1998
- [c1]Michelle Mills Strout, Larry Carter, Jeanne Ferrante, Beth Simon:
Schedule-Independent Storage Mapping for Loops. ASPLOS 1998: 24-33
Coauthor Index
Catherine Mills Olschanowsky
aka: Catherine Olschanowsky
aka: Catherine Olschanowsky
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-13 20:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
