The code provides an implementation of parallel spanning tree algorithms for SMPs, as a module for SIMPLE/SMP. This new randomized algorithm and implementation has superior performance that for the first-time achieves parallel speedup on arbitrary graphs (both regular and irregular topologies) when compared with the best sequential implementation for finding a spanning tree.
References:
D.A. Bader and G. Cong, "A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors (SMPs)," 18th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS), Santa Fe, NM, April 26-30, 2004.
D.A. Bader and G. Cong, "A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors (SMPs)," Journal of Parallel and Distributed Computing, 65(9):994-1006, 2005.