Changes between Version 3 and Version 4 of DataParallel/BenchmarkStatus
- Timestamp:
- 05/22/08 01:19:19 (5 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
DataParallel/BenchmarkStatus
v3 v4 14 14 General remarks: 15 15 16 * I only ran a first set of benchmarks when checking for what's there. I'll run the benchmarks 17 properly as next step 16 * I only ran a first set of benchmarks when checking for what's there. I'll run the benchmarks properly as next step 18 17 19 * Fusion doesn't work well on parallel programs yet, so for all but simple examples, the parallel program performs worse than the 20 sequential 18 * Fusion doesn't work well on parallel programs yet, so for all but simple examples, the parallel program performs worse than the sequential 21 19 22 * The compiler doesn't exploit all fusion opportunities for QSort and BarnesHut. Once this is fixed, they should run considerably faster.20 * The compiler doesn't exploit all fusion opportunities for QSort and BarnesHut. Once this is fixed, they should run considerably faster. 23 21 24 * Interestingly, the automatically vectorised version of qsort is quite a bit faster than the hand-flattened. Need to find out why.22 * Interestingly, the automatically vectorised version of qsort is quite a bit faster than the hand-flattened. Need to find out why. 25 23 26 24
