Tao B. Schardl

Affiliations:
  • Massachusetts Institute of Technology, Cambridge, USA (PhD 2016)


According to our database1, Tao B. Schardl authored at least 34 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Speedcode: Software Performance Engineering Education via the Coding of Didactic Exercises.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2024

2023
OpenCilk: A Modular and Extensible Software Infrastructure for Fast Task-Parallel Code.
Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2023

Communication-Efficient Graph Neural Networks with Probabilistic Neighborhood Expansion Analysis and Caching.
Proceedings of the Sixth Conference on Machine Learning and Systems, 2023

Optimizing Compression Schemes for Parallel Sparse Tensor Algebra.
Proceedings of the Data Compression Conference, 2023

2022
Accelerating Training and Inference of Graph Neural Networks with Fast Sampling and Pipelining.
Proceedings of the Fifth Conference on Machine Learning and Systems, 2022

Peachy Parallel Assignments (EduHPC 2022).
Proceedings of the IEEE/ACM International Workshop on Education for High Performance Computing, 2022

Efficient Access History for Race Detection.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

A Work-Efficient Parallel Breadth-First Search Algorithm (or How To Cope With the Nondeterminism of Reducers).
Proceedings of the Massive Graph Analytics, 2022

Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling.
Proceedings of the Massive Graph Analytics, 2022

Ordering Heuristics for Parallel Graph Coloring.
Proceedings of the Massive Graph Analytics, 2022

2021
A Hybrid Scheduling Scheme for Parallel Loops.
Proceedings of the 35th IEEE International Parallel and Distributed Processing Symposium, 2021

PARAD: A Work-Efficient Parallel Algorithm for Reverse-Mode Automatic Differentiation.
Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

2020
Cilkmem: Algorithms for Analyzing the Memory High-Water Mark of Fork-Join Parallel Programs.
Proceedings of the 1st Symposium on Algorithmic Principles of Computer Systems, 2020

EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Tapir: Embedding Recursive Fork-join Parallelism into LLVM's Intermediate Representation.
ACM Trans. Parallel Comput., 2019

TapirXLA: Embedding Fork-Join Parallelism into the XLA Compiler in TensorFlow Using Tapir.
Proceedings of the 2019 IEEE High Performance Extreme Computing Conference, 2019

2018
Efficient Race Detection for Reducer Hyperobjects.
ACM Trans. Parallel Comput., 2018

Scalable Graph Learning for Anti-Money Laundering: A First Look.
CoRR, 2018

Brief Announcement: Open Cilk.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

2017
The CSI Framework for Compiler-Inserted Program Instrumentation.
Proc. ACM Meas. Anal. Comput. Syst., 2017

Tapir: Embedding Fork-Join Parallelism into LLVM's Intermediate Representation.
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

2016
Performance engineering of multicore software: developing a science of fast code for the post-Moore era.
PhD thesis, 2016

Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling.
ACM Trans. Parallel Comput., 2016

Upper Bounds on Number of Steals in Rooted Trees.
Theory Comput. Syst., 2016

On the efficiency of localized work stealing.
Inf. Process. Lett., 2016

Who Needs Crossings? Hardness of Plane Graph Rigidity.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
On-the-Fly Pipeline Parallelism.
ACM Trans. Parallel Comput., 2015

The Cilkprof Scalability Profiler.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Efficiently Detecting Races in Cilk Programs That Use Reducer Hyperobjects.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

2014
Ordering heuristics for parallel graph coloring.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

2013
Finding a Hamiltonian Path in a Cube with Specified Turns is Hard.
J. Inf. Process., 2013

Folding Equilateral Plane graphs.
Int. J. Comput. Geom. Appl., 2013

2012
Deterministic parallel random-number generation for dynamic-multithreading platforms.
Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2012

2010
A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers).
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010


  Loading...