Computing strongly connected components (SCC) is among the most fundamental problems
in graph analytics. Given the large size of today's real-world graphs, parallel SCC …

Semisort is a fundamental algorithmic primitive widely used in the design and analysis of
efficient parallel algorithms. It takes input as an array of records and a function extracting a …

In this paper, we share our experience in teaching parallel algorithms with the binary-forking
model. With hardware advances, multicore computers are now ubiquitous. This has created …

In this paper, we introduce PASGAL (Parallel And Scalable Graph Algorithm Library), a
parallel graph library that scales to a variety of graph types, many processors, and large …

As multi-core processors become more widely available, parallel computing has entered its
prime era. Despite significant advances in hardware and extensive theoretical research …

We have covered many algorithms during the lectures, but as a 10-week class, we do not
have time to cover many algorithms for important problems, and ideas for parallel algorithm …