A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
2005
Journal of Parallel and Distributed Computing
Preserved Fulltext
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
doi:10.1016/j.jpdc.2005.03.011
fatcat:uzsbaowjljehlmfgnbcc457jla