Charles E. Leiserson

TL;DR: This paper considers the problem of scheduling dynamic parallel computations to achieve linear speedup without using signicantly more space per processor than that required for a single-processor execution and proposes a decentralized algorithm that can compute and execute a P-processor schedule online in expected time O(T1=P + T1 lgP) and worst-case space O(S1P lgG).

TL;DR: The Nondeterminator is an asymptotically efficient serial algorithm for detecting determinacy races in series-parallel directed acyclic graphs and exhibits a slowdown of less than 12 compared with the serial execution time of the original optimized code, which the authors contend is an acceptable slowdown for debugging purposes.

TL;DR: In a VLSI-like model where hardware cost is equated with physical volume, the routing algorithm is used to demonstrate that fat-trees are universal routing networks in the sense that any routing network can be efficiently simulated by a fat-tree of comparable hardware cost.

TL;DR: The Cilkview scalability analyzer is a software tool for profiling, estimating scalability, and benchmarking multithreaded Cilk++ applications, and can perform real-time scalability benchmarking automatically, producing gnuplot-compatible output that allows developers to compare an application's performance with the tool's predictions.

TL;DR: A provably efficient determinacy-race detector for Cilk, an algorithmic multithreaded programming language, that determines at least one location in the program that is subject to a determinacy race and certifies that the program is race free when run on the data set.