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. . .

### Like this:

Like Loading...

*Related*

This entry was posted on May 23, 2007 at 10:37 pm and is filed under computer science, difficult, graduate school. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

June 27, 2007 at 6:05 am |

Seriously– is that question written in English?