Journal Metrics

  • IF value: 6.086 IF 6.086
  • IF 5-year<br/> value: 6.174 IF 5-year
    6.174
  • SNIP value: 1.812 SNIP 1.812
  • IPP value: 5.140 IPP 5.140
  • SJR value: 3.969 SJR 3.969
  • h5-index value: 29 h5-index 29
Geosci. Model Dev., 4, 835-844, 2011
www.geosci-model-dev.net/4/835/2011/
doi:10.5194/gmd-4-835-2011
© Author(s) 2011. This work is distributed
under the Creative Commons Attribution 3.0 License.
FAMOUS, faster: using parallel computing techniques to accelerate the FAMOUS/HadCM3 climate model with a focus on the radiative transfer algorithm
P. Hanappe1, A. Beurivé1, F. Laguzet1,*, L. Steels1, N. Bellouin2, O. Boucher2,**, Y. H. Yamazaki3,***, T. Aina3, and M. Allen3
1Sony Computer Science Laboratory, Paris, France
2Met Office, Exeter, UK
3University of Oxford, Oxford, UK
*now at: Laboratoire de Recherche en Informatique, Orsay, France
**now at: Laboratoire de Météorologie Dynamiqe, IPSL, CNRS/UPMC, Paris, France
***now at: School of Geography, Politics and Sociology, Newcastle University, Newcastle, UK

Abstract. We have optimised the atmospheric radiation algorithm of the FAMOUS climate model on several hardware platforms. The optimisation involved translating the Fortran code to C and restructuring the algorithm around the computation of a single air column. Instead of the existing MPI-based domain decomposition, we used a task queue and a thread pool to schedule the computation of individual columns on the available processors. Finally, four air columns are packed together in a single data structure and computed simultaneously using Single Instruction Multiple Data operations.

The modified algorithm runs more than 50 times faster on the CELL's Synergistic Processing Element than on its main PowerPC processing element. On Intel-compatible processors, the new radiation code runs 4 times faster. On the tested graphics processor, using OpenCL, we find a speed-up of more than 2.5 times as compared to the original code on the main CPU. Because the radiation code takes more than 60 % of the total CPU time, FAMOUS executes more than twice as fast. Our version of the algorithm returns bit-wise identical results, which demonstrates the robustness of our approach. We estimate that this project required around two and a half man-years of work.


Citation: Hanappe, P., Beurivé, A., Laguzet, F., Steels, L., Bellouin, N., Boucher, O., Yamazaki, Y. H., Aina, T., and Allen, M.: FAMOUS, faster: using parallel computing techniques to accelerate the FAMOUS/HadCM3 climate model with a focus on the radiative transfer algorithm, Geosci. Model Dev., 4, 835-844, doi:10.5194/gmd-4-835-2011, 2011.
 
Search GMD
Special Issue
Final Revised Paper
PDF XML
Citation
Discussion Paper
Share