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


One Response to “Stick a fork in me.”

  1. Sister Says:

    Seriously– is that question written in English?

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

%d bloggers like this: