User Tools

Site Tools


gibson:juliablog:kuramoto_sivashinksy

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
gibson:juliablog:kuramoto_sivashinksy [2017/07/09 06:39]
gibson [The results]
gibson:juliablog:kuramoto_sivashinksy [2017/07/09 07:30] (current)
gibson
Line 22: Line 22:
  
  
-**The left plot** shows execution time of 3200 time steps of the algorithm as a function of $N_x$, the number of gridpoints in the Fourier decomposition. The dominant cost of the algorithm should be the FFTs which should scale as $N_x \log N_x$. All the codes use FFTW libraries.+**The left plot** shows execution time of 3200 time steps of the algorithm as a function of $N_x$, the number of gridpoints in the Fourier decomposition. The dominant cost of the algorithm should be the FFTswhich should scale as $N_x \log N_x$. All the codes use the same FFTW libraries, so ideally, they should all collapse onto the same $N_x \log N_x$ line as linear and fixed-size overheads costs decrease relative to that
  
 {{:​gibson:​juliablog:​cputime.png?​400|}} {{:​gibson:​juliablog:​timeloc.png?​400|}} {{:​gibson:​juliablog:​cputime.png?​400|}} {{:​gibson:​juliablog:​timeloc.png?​400|}}
  
 The right plot shows  The right plot shows 
gibson/juliablog/kuramoto_sivashinksy.txt ยท Last modified: 2017/07/09 07:30 by gibson