Stick a fork in me.

My midterm exam for parallel programming was VERY LONG.

For a taste of the fun, try this problem: Use the Floyd-Warshall algorithm (for finding the shortest path between all vertices) to label connected components in a binary pixelmap. Unfortunately, the F-W algorithm runs in O(n^3). Make your PARALLEL algorithm run in O(n^2).

Maybe I’ll post a solution later this week. . .

Advertisements