1. A performance analysis of multicore computer architectures Michel Schelske

2. 2 Parallel Algorithms for Multicore Benchmarking10. Apr. 2008 Structure 1.Observations & Theory 2.Problems 3.Solution

3. 3 Parallel Algorithms for Multicore Benchmarking10. Apr. 2008 Observation I clock rate cores performance 3-4 GHz cores frequency performance 200320072005 1 2 4 Multi performance

4. 4 Parallel Algorithms for Multicore Benchmarking10. Apr. 2008 Observation II programthread partitioning granularity

5. 5 Parallel Algorithms for Multicore Benchmarking10. Apr. 2008 Theory Optimum  depends on hardware and the problem to be solved granularity performance coarse-grainfine-grain

6. 6 Parallel Algorithms for Multicore Benchmarking10. Apr. 2008 Example

7. 7 Parallel Algorithms for Multicore Benchmarking10. Apr. 2008 Observation III Optimum  depends on hardware and the problem to be solved coarse-grain granularity performance fine-grain

8. 8 Parallel Algorithms for Multicore Benchmarking10. Apr. 2008 Observation IV Optimum  depends on hardware and the problem to be solved granularity performance coarse-grainfine-grain

9. 9 Parallel Algorithms for Multicore Benchmarking10. Apr. 2008 The problems Granularity is only one performance parameter. Find the optimal parallelization parameters with respect to – the algorithm – the computer architecture

10. 10 Parallel Algorithms for Multicore Benchmarking10. Apr. 2008 Our Solution hardware core operating system Application Profiler Benchmark

11. 11 Parallel Algorithms for Multicore Benchmarking10. Apr. 2008 Thank you for your attention

12. 12 Parallel Algorithms for Multicore Benchmarking10. Apr. 2008 Result calculation of prime numbers on a computer with two Intel Xeon Singlecore CPUs