TPL Support?

Topics: algorithm, graph
Oct 24, 2008 at 11:18 AM
Any plans to use the ParallelFor statements in QuickGraph?
Some of my graphs are large, and this could be a nice speed boost.

Thanks in advance.
Oct 24, 2008 at 3:06 PM
I've started to look at this but it's not obvious as it seems. Most vertex coloring graphs have a shared state, i.e. the color map, which needs to be synchronized. This is a big overhead that kills parralelism.

There is hope though: Breath First Search can be parralelized by processing each depth frontier concurrently and joining the queue at the end. This means less synchronization during the frontier. Anyway, interresting stuff.
Oct 24, 2008 at 3:07 PM
Edited Oct 24, 2008 at 3:07 PM
I should mention that I sit 10 feet away from the guy who wrote the TPL, Daan Leinen, maybe I should ask him :)