Tao B. Schardl - Publications

Journal articles

On the efficiency of localized work stealing
Warut Suksompong, Charles E. Leiserson, Tao B. Schardl
Information Processing Letters
Volume 116 Issue 2, Feb. 2016, pp. 100–106.
On-the-fly pipeline parallelism (ACM Author-Izer ACM DL Author-ize service )
I-Ting Angelina Lee, Charles E. Leiserson, Tao B. Schardl, Zhunping Zhang, Jim Sukha
ACM Transactions on Parallel Computing — Special Issue for SPAA 2013
Volume 2 Issue 3, Oct. 2015, 17:1–17:42
Upper bounds on number of steals in rooted trees
Charles E. Leiserson, Tao B. Schardl, Warut Suksompong
Theory of Computing Systems
Volume 58 Issue 2, Feb. 2016, pp. 223–240
Folding equilateral plane graphs (author copy)
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz
International Journal of Computational Geometry & Applications
Volume 23, Issue 2, 2013, pp. 75–92.
Finding a Hamiltonian path in a cube with specified turns is hard (author copy)
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl
Journal of Information Processing
Volume 21, Number 3, 2013, pp. 368–377

Conference publications

Efficiently detecting races in Cilk programs that use reducer hyperobjects (ACM Author-Izer ACM DL Author-ize
                 service)
I-Ting Angelina Lee, Tao B. Schardl
SPAA '15: Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures
2015, pp. 111–122
The Cilkprof scalability profiler (Author-Izer ACM DL Author-ize service)
Tao B. Schardl, Bradley C. Kuszmaul, I-Ting Angelina Lee, William M. Leiserson, Charles E. Leiserson
SPAA '15: Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures
2015, pp. 89–100
Ordering heuristics for parallel graph coloring (Author-Izer ACM DL Author-ize service)
William Hasenplaugh, Tim Kaler, Tao B. Schardl, Charles E. Leiserson
SPAA '14: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
2014, pp. 166–177
Executing dynamic data-graph computations deterministically using chromatic scheduling (Author-Izer ACM DL Author-ize service)
Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson
SPAA '14: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
2014, pp. 154–165
On-the-fly pipeline parallelism (Author-Izer ACM DL Author-ize service)
I-Ting Angelina Lee, Charles E. Leiserson, Tao B. Schardl, Jim Sukha, Zhunping Zhang
SPAA '13: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures
2013, pp. 140–151
Deterministic parallel random-number generation for dynamic-multithreading platforms (Author-Izer ACM DL Author-ize service)
Charles E. Leiserson, Tao B. Schardl, Jim Sukha
PPoPP '12: Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
2012, pp. 193–204
Folding equilateral plane graphs (author copy)
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz
ISAAC '11: Proceedings of the 22nd International Symposium on Algorithms and Computation
2011, pp. 574–583
A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers) (Author-Izer ACM DL Author-ize service)
Charles E. Leiserson, Tao B. Schardl
SPAA '10: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures
2010, pp. 303–314

Theses

Design and analysis of a nondeterministic parallel breadth-first search algorithm
Tao B. Schardl
Masters thesis, 2010.

Last modified 15 January 2016 by TB Schardl.