5 citations · 8 across the 5 of their papers we have counts for
6 papers
Beyond Time Complexity: Data Movement Complexity Analysis for Matrix Multiplication
Wesley Smith, Aidan Goldfarb, Chen Ding
Data movement is becoming the dominant contributor to the time and energy costs of computation across a wide range of application domains. However, time complexity is inadequate to…
AWLCO: All-Window Length Co-Occurrence
Joshua Sobel, Noah Bertram, Chen Ding +2
Analyzing patterns in a sequence of events has applications in text analysis, computer programming, and genomics research. In this paper, we consider the all-window-length analysis…
Codestitcher: Inter-Procedural Basic Block Layout Optimization
Rahman Lavaee, John Criswell, Chen Ding
Modern software executes a large amount of code. Previous techniques of code layout optimization were developed one or two decades ago and have become inadequate to cope with the s…
A Measurement Theory of Locality
Liang Yuan, Chen Ding, Peter Denning +1
Locality is a fundamental principle used extensively in program and system optimization. It can be measured in many ways. This paper formalizes the metrics of locality into a measu…
Efficient Parallelization for AMR MHD Multiphysics Calculations; Implementation in AstroBEAR
Jonathan J. Carroll-Nellenback, Brandon Shroyer, Adam Frank +1
Current Adaptive Mesh Refinement (AMR) simulations require algorithms that are highly parallelized and manage memory efficiently. As compute engines grow larger, AMR simulations wi…
Efficient Parallelization for AMR MHD Multiphysics Calculations; Implementation in AstroBEAR
Jonathan Carroll-Nellenback, Brandon Shroyer, Adam Frank +1
Current AMR simulations require algorithms that are highly parallelized and manage memory efficiently. As compute engines grow larger, AMR simulations will require algorithms that…