Graduate Algorithms

In the early 80s, there was much excitement in the algorithms community about the idea of parallel machine models. The PRAM (parallel RAM), became the analysis model of choice, and in the lecture today, we’ll start to see the basic theory of parallel complexity as seen on the PRAM. The textbook has no material on parallel algorithms: I drew much material from these lecture notes.

Some additional links that might be useful:

• Flynn’s categorization of machine models.
• Amdahl’s Law.
• P-completeness

This entry was posted on Wednesday, November 28th, 2007 at 2:49 am and is filed under Lectures, News.