A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)

David A. Bader, Guojing Cong
2005 Journal of Parallel and Distributed Computing  
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. Many PRAM algorithms can be adapted to SMPs with few modifications. Yet there are few studies that deal with the implementation and performance issues of running PRAM algorithms on SMPs. Our study in this paper focuses on implementing parallel spanning tree algorithms on SMPs. Spanning tree is an important problem in the sense
more » ... hat it is the building block for many other parallel graph algorithms and also because *
doi:10.1016/j.jpdc.2005.03.011 fatcat:uzsbaowjljehlmfgnbcc457jla