I have implemented two different implementations of a parallel code to calculate the SpanningForest of a graph. The main locking in the algorithm occurs when the code is following the ancestor chain for each node of an edge (locking each node as it goes). However, only the very last node in the chain needs to […]
The post Improving Performance of Parallel SF appeared first on BlogoSfera.