Latency is increasingly becoming a performance bottleneck for Internet Protocol (IP)
networks, but historically, networks have been designed with aims of maximizing throughput …

Data races are a particularly unpleasant kind of threading bugs. They are hard to find and
reproduce--you may not observe a bug during the entire testing cycle and will only see it in …

The Parallel Programming Guide for Every Software Developer From grids and clusters to
next-generation game consoles, parallel computing is going mainstream. Innovations such …

The availability of multicore processors across a wide range of computing platforms has
created a strong demand for software frameworks that can harness these resources. This …

We present a new method for dynamically detecting potential data races in multithreaded
programs. Our method improves on the state of the art in accuracy, in usability, and in …

Multithreaded programming is notoriously difficult to get right. A key problem is non-
determinism, which complicates debugging, testing, and reproducing errors. One way to …

We present a novel approach to dynamic datarace detection for multithreaded object-
oriented programs. Past techniques for on-the-fly datarace detection either sacrificed …

Debuggers have been proven indispensable in improving software reliability. Unfortunately,
on most real-life software, debuggers fail to deliver their most essential feature---a faithful …

This article presents a practical solution for the cyclic debugging of nondeterministic parallel
programs. The solution consists of a combination of record/replay with automatic on-the-fly …

We have developed a multithreaded implementation of breadth-first search (BFS) of a
sparse graph using the Cilk++ extensions to C++. Our PBFS program on a single processor …