Parallel Algorithm Analysis

• Basis for comparison

  • Asymptotic complexity?
  • Processor-Time product?
  • Execution time?

• We will base our comparison on a combination of execution time and complexity.

Previous slide

Next slide

Back to first slide

View graphic version