Papers
# Featured papers
Tao B. Schardl, I-Ting Angelina Lee. 2023. OpenCilk: A Modular and Extensible Software Infrastructure for Fast Task-Parallel Code. In PPoPP, 189–203.
Charles E. Leiserson, Neil C. Thompson, Joel S. Emer, Bradley C. Kuszmaul, Butler W. Lampson, Daniel Sanchez, Tao B. Schardl. 2020. There’s plenty of room at the Top: What will drive computer performance after Moore’s law?. In Science, 368(6495).
Tao B. Schardl, William S. Moses, Charles E. Leiserson. 2017. Tapir: Embedding Fork-Join Parallelism into LLVM's Intermediate Representation. In PPoPP, 249–265. Won best paper award; invited to a special issue of ACM Transactions on Parallel Computing.
# All papers
Tim Kaler, Xuhao Chen, Brian Wheatman, Dorothy Curtis, Bruce Hoppe, Tao B. Schardl, Charles E. Leiserson. 2024. Speedcode: Software Performance Engineering Education via the Coding of Didactic Exercises. In EduPar, 391–394.
Tao B. Schardl, I-Ting Angelina Lee. 2023. OpenCilk: A Modular and Extensible Software Infrastructure for Fast Task-Parallel Code. In PPoPP, 189–203.
Helen Xu, Tao B. Schardl, Michael Pellauer, Joel S. Emer. 2023. Optimizing Compression Schemes for Parallel Sparse Tensor Algebra. In HPEC, 1–7.
Tim Kaler, Alexandros-Stavros Iliopoulos, Philip Murzynowski, Tao B. Schardl, Charles E. Leiserson, Jie Chen. 2023. Communication-Efficient Graph Neural Networks with Probabilistic Neighborhood Expansion Analysis and Caching. In MLSys.
Rocío Carratalá-Sáez, Arturo González-Escribano, Alexandros-Stavros Iliopoulos, Charles E. Leiserson, Charlotte Park, Isabel Rosa, Tao B. Schardl, Yuri Torres, David P. Bunde. 2022. Peachy Parallel Assignments. In EduHPC, 50–56.
Tim Kaler, Nickolas Stathas, Anne Ouyang, Alexandros-Stavros Iliopoulos, Tao B. Schardl, Charles E. Leiserson, Jie Chen. 2022. Accelerating Training and Inference of Graph Neural Networks with Fast Sampling and Pipelining. In MLSys.
Yifan Xu, Anchengcheng Zhou, Grace Q. Yin, Kunal Agrawal, I-Ting Angelina Lee, Tao B. Schardl. 2022. Efficient Access History for Race Detection. In ALENEX, 117–130.
Charles E. Leiserson, Tao B. Schardl. 2022. A Work-Efficient Parallel Breadth-First Search Algorithm (or How To Cope With the Nondeterminism of Reducers). In Massive Graph Analytics, 3–33.
William Hasenplaugh, Tim Kaler, Tao B. Schardl, Charles E. Leiserson. 2022. Ordering Heuristics for Parallel Graph Coloring. In Massive Graph Analytics, 193–221.
Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson. 2022. Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling. In Massive Graph Analytics, 397–429.
Aaron Handleman, Arthur G. Rattew, I-Ting Angelina Lee, Tao B. Schardl. 2021. A Hybrid Scheduling Scheme for Parallel Loops. In IPDPS, 587–598.
Tim Kaler, Tao B. Schardl, Brian Xie, Charles E. Leiserson, Jie Chen, Aldo Pareja, Georgios Kollias. 2021. PARAD: A Work-Efficient Parallel Algorithm for Reverse-Mode Automatic Differentiation. In APOCS, 144–158.
Charles E. Leiserson, Neil C. Thompson, Joel S. Emer, Bradley C. Kuszmaul, Butler W. Lampson, Daniel Sanchez, Tao B. Schardl. 2020. There’s plenty of room at the Top: What will drive computer performance after Moore’s law?. In Science, 368(6495).
Aldo Pareja, Giacomo Domeniconi, Jie Chen, Tengfei Ma, Toyotaro Suzumura, Hiroki Kanezashi, Tim Kaler, Tao B. Schardl, Charles E. Leiserson. 2020. EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs. In AAAI, 5363–5370.
Tim Kaler, William Kuszmaul, Tao B. Schardl, Daniele Vettorel. 2020. Cilkmem: Algorithms for Analyzing the Memory High-Water Mark of Fork-Join Parallel Programs. In APoCS, 162–176. Best paper finalist.
Tao B. Schardl, Siddharth Samsi. 2019. TapirXLA: Embedding Fork-Join Parallelism into the XLA Compiler in TensorFlow Using Tapir. In HPEC, 1–8.
Tao B. Schardl, William S. Moses, Charles E. Leiserson. 2019. Tapir: Embedding Recursive Fork-Join Parallelism into LLVM’s Intermediate Representation. In ACM Transactions on Parallel Computing, 6(4).
I-Ting Angelina Lee, Tao B. Schardl. 2018. Efficient Race Detection for Reducer Hyperobjects. In ACM Transactions on Parallel Computing, 4(4).
Tao B. Schardl, I-Ting Angelina Lee, Charles E. Leiserson. 2018. Brief Announcement: Open Cilk. In SPAA, 351–353.
Tao B. Schardl, Tyler Denniston, Damon Doucet, Bradley C. Kuszmaul, I-Ting Angelina Lee, Charles E. Leiserson. 2018. The CSI Framework for Compiler-Inserted Program Instrumentation. In Abstracts of SIGMETRICS, 100–102.
Tao B. Schardl, Tyler Denniston, Damon Doucet, Bradley C. Kuszmaul, I-Ting Angelina Lee, Charles E. Leiserson. 2017. The CSI Framework for Compiler-Inserted Program Instrumentation. In SIGMETRICS, 1(2), 43:1–43:25.
Tao B. Schardl, William S. Moses, Charles E. Leiserson. 2017. Tapir: Embedding Fork-Join Parallelism into LLVM's Intermediate Representation. In PPoPP, 249–265. Won best paper award; invited to a special issue of ACM Transactions on Parallel Computing.
Charles E. Leiserson, Tao B. Schardl, Warut Suksompong. 2016. Upper bounds on number of steals in rooted trees. In Theory of Computing Systems, 58(2), 223–240.
Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson. 2016. Executing dynamic data-graph computations deterministically using chromatic scheduling. In ACM Transactions on Parallel Computing, 3(1), 2:1–2:31.
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl. 2016. Who Needs Crossings? Hardness of Plane Graph Rigidity. In SoCG, 3:1–3:15.
Warut Suksompong, Charles E. Leiserson, Tao B. Schardl. 2016. On the efficiency of localized work stealing. In Information Processing Letters, 116(2), 100–106.
Tao B. Schardl. 2016. Performance Engineering of Multicore Software: Developing a Science of Fast Code for the Post-Moore Era. Ph.D. thesis. Massachusetts Institute of Technology.
I-Ting Angelina Lee, Charles E. Leiserson, Tao B. Schardl, Zhunping Zhang, Jim Sukha. 2015. On-the-fly pipeline parallelism. In ACM Transactions on Parallel Computing, 2(3), 17:1–17:42.
Tao B. Schardl, Bradley C. Kuszmaul, I-Ting Angelina Lee, William M. Leiserson, Charles E. Leiserson. 2015. The Cilkprof scalability profiler. In SPAA, 89–100.
I-Ting Angelina Lee, Tao B. Schardl. 2015. Efficiently detecting races in Cilk programs that use reducer hyperobjects. In SPAA, 111–122. Invited to a special issue of ACM Transactions on Parallel Computing.
William Hasenplaugh, Tim Kaler, Tao B. Schardl, Charles E. Leiserson. 2014. Ordering heuristics for parallel graph coloring. In SPAA, 166–177.
Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson. 2014. Executing dynamic data-graph computations deterministically using chromatic scheduling. In SPAA, 154–165. Invited to a special issue of ACM Transactions on Parallel Computing.
I-Ting Angelina Lee, Charles E. Leiserson, Tao B. Schardl, Jim Sukha, Zhunping Zhang. 2013. On-the-fly pipeline parallelism. In SPAA, 140–151. Invited to a special issue of ACM Transactions on Parallel Computing.
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl. 2013. Finding a Hamiltonian path in a cube with specified turns is hard. In Journal of Information Processing, 21(3), 368–377. Won outstanding paper award.
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz. 2013. Folding equilateral plane graphs. In International Journal of Computational Geometry & Applications, 23(02), 75–92.
Charles E. Leiserson, Tao B. Schardl, Jim Sukha. 2012. Deterministic parallel random-number generation for dynamic-multithreading platforms. In PPoPP, 193–204.
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz. 2011. Folding equilateral plane graphs. In ISAAC, 574–583.
Tao B. Schardl. 2010. Design and analysis of a nondeterministic parallel breadth-first search algorithm. Masters thesis. Massachusetts Institute of Technology. Awarded the Charles and Jennifer Johnson CS M.Eng. Prize.
Charles E. Leiserson, Tao B. Schardl. 2010. A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers). In SPAA, 303–314.