Changes between Version 3 and Version 4 of DataParallel/BenchmarkStatus


Ignore:
Timestamp:
May 22, 2008 8:19:19 AM (6 years ago)
Author:
simonpj
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • DataParallel/BenchmarkStatus

    v3 v4  
    1414General remarks: 
    1515 
    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 
    1817 
    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 
    2119 
    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. 
    2321 
    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. 
    2523 
    2624