Highly Parallel Connected Components
A Structure Editor for Diagnostic Educational Assessment
by
Steve Loeppky
The presentation describes the design and implementation of a new
algorithm for solving connected components problems. The algorithm is
a parallel algorithm optimized for sparsely connected graphs through
the use of locality. The solution was implemented with ZPL and C
using MPI. Parallel performance numbers will be presented.
CSE 403
Wednesday
May 10, 2006
3:30 - 4:20 pm