Changes between Version 54 and Version 55 of Working Groups/HPC


Ignore:
Timestamp:
2019-08-23T11:39:28+02:00 (13 months ago)
Author:
mikebell
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Working Groups/HPC

    v54 v55  
    7474---- 
    7575 
    76 == [wiki:WorkingGroups/HPC/HomePage2014 
     76== [wiki:WorkingGroups/HPC/HomePage2014 ] 
    7777 
    78 Working group leader (and responsible for wiki pages) : Sébastien Masson. 
    79  
    80 ---- 
    81  
    82 == Members of the Working group: 
    83  * Sébastien Masson 
    84  * Italo Epicoco 
    85  * Silvia Mocavero 
    86  * Marie-Alice Foujols 
    87  * Jason Holt 
    88  * Gurvan Madec 
    89  * Mondher Chekki 
    90  
    91 ---- 
    92  
    93 == Objectives: 
    94  * make short term recommendations for improving the performance of the existing system 
    95  * propose criteria for a taking decisions at Gateway 2025 regarding HPC. 
    96  * provide more detail on Gung-Ho (esp. regarding its implications for mesh discretization) 
    97  * identify other possible strategies and approaches for evolutions in the long term. 
    98  * define a simple configuration (with IO and complex geometry) that will serve as a proof of concept for validating the proposed approach for the future system. 
    99  
    100 == Some ideas...: 
    101 [raw-attachment:HPC_tasks_Masson.doc Document by Seb] detailing some short term actions to help reduce communications . 
    102  
    103 A strong improvement of NEMO scalability is needed to be able to take advantage of the new machines. This probably means a deep review/rewrite of NEMO code at some point in the future (beyond 5 years from now?). At the same time, we already know that CMIP7 won't use an ocean model that has not been strongly tested and validated and will stick to a NEMO model not so far from the existing one. [[BR]] This means that we need to: 
    104  
    105  1. keep improving the current structure of NEMO so it works quite efficiently for almost 10 more years (until the end of CMPI7). 
    106  2. start to work on a new structure that would fully tested and validated at least for CMIP8 in about 10 years. 
    107  
    108 Based on this, we propose to divide the work according to 3 temporal windows 
    109  
    110 '''0-3 years''': improvements with existing code: 
    111  
    112  1. remove solvers and global sums (to be done in 3.7) 1) reduce the number of communications: do less and bigger communications (group communications, use larger halo). main priority: communications in the time splitting and sea-ice rheology. 
    113  2. reduce the number of communications: remove useless communications (a lot of them are simply associated with output...) 
    114  3. introduce asynchronous communications 
    115  4. check code vectorization (SIMD instructions) 
    116  
    117 '''0-5 years''': improvements through the introduction of OpenMP: 
    118  
    119   work initialed by CMCC.  implementation such as tiling may be efficient with many cores processors? review lbclnk to be able to deal with MPI and OpenMP OpenMP along the vertical axis? Find a way to remove implicit schemes?   test different way to find new sources of parallelism for example with the help of OpenMP4 test OpenACC (not that far from OpenMP)? 
    120  
    121 '''beyond 5 years''': 
    122  
    123   !GungHo       or not !GungHo      , that is the question... 
    124  
    125 == Agenda: == 
    126 For the next 2 years, as a start, a workshop to be organized in 2015 on “NEMO in 2025 : routes toward multi-resolution approaches”. 
    127  
    128 ---- 
    129  
    130 == Comments of group members : 
    131 '''gurvan''' -- (2014 november 11): 
    132  
    133   • improving the code efficiency imply using more processor for a given application. This means breaking the current limit of 35x35 local horizontal domain. The 3 years propositions go in that direction. One point is missing: A target for an ORCA 1/36° is a 10x10 local domain to be able to use 1 Million cores... In this case, the number of horizontal grid points is the same as the vertical one (about 100 levels is currently what we are running). So, do we have to consider a change in the indexation of arrays from i-j-k to k-j-i  ? 
    134  
    135   • Sea-ice running in parallel with the ocean on its own set of processors (with a 1 time-step asynchronous coupling between ice and ocean). 
    136  
    137   • BGC running in parallel with the ocean on its own set of processors. 
    138  
    139   • BGC : obviously on-line coarsening significantly reduces the cost of BGC models, further improvement can be achieved by considering SMS term fo BGC as a big 1D vector and a compuation over only the required area (ocean point only, oceans and euphotique layer only etc...). Same idea for sea-ice physics... 
    140  
    141   • Remark: the version of MON currently under development (MOM5: switch to C-grid, use of finit volume approach,...) is using FMS, a GungHo      type approach...and "There are '''   dozens'''    of scientists and engineers at GFDL focused on meeting the evolving needs of climate scientists pushing the envelope of computational tools for studying climate" 
    142  
    143 '''Sebastien''' -- (2014 november 17): some ideas I heard about asynchronous communications: 
    144  
    145   • compute inner domain during communication of the halo: 
    146  
    147 Today in NEMO, we first do loops from 2 to jpi-1 and, next, we do a communication to get values in 1 and jpi that will be needed for the next loop involving neighboring points. So, by default, we compute over the full domain (including halo) and make a communication '''after''' the incomplete loops. [[BR]] We could change this paradigm. Halo exists only to be able to compute data over the inner domains. So we don't really need to compute over the full domain. We could compute only over the inner domain and make a communication '''before''' the loops that are involving neighboring points to update halo. This is what is done in WRF for example. If we do communications before the loops, we cant start non-blocking communication, do the computation for 3 to jpi-2, receive the communication and finally do the computation for 2 and jpi-1 (note that in this case, by default halo do not have updated data when computation is finished). 
    148  
    149   • larger halo: could be done only on some variables that are for example using neighbor of neighbor (see what was done on sor solver). 
    150  
    151   • in 3D loops: hide communication at each level by the computation of the next level... -> do not do 3D communications but n 2D asynchronous communications. Good only if communications are really hidden by the computation at each level (that will be less and less as the size of the subdomain is decreasing... Is it really a good idea? 
    152  
    153 '''Silvia''' -- (2014 november 25): about asynchronous communications: 
    154  
    155  • compute inner domain during communication of the halo: 
    156  
    157 In the past, at CMCC we have carried out some optimization activities on a regional configuration (covering the mediterranean basin at 1/16°) of NEMO (v3.2). The performance analysis highlighted the SOR as one of the most computational intensive kernels, so our optimizations have been focused also on it. One activity aimed at overlapping communication and computation changing the algorithm in the following way: (i) halo computation, (ii) asynchronous communications and (iii) computation over the inner domain (overlapped with communication). The new algorithm has been evaluated on the old Marenostrum system (dismissed in 2013), in the context of an HPC-Europa application. It has been theoretically evaluated using the Dimemas tool (developed at BSC) showing that the new algorithm performed better than the old one, but the experimental results did not confirm the expectations. However, we can plan to test the communication/computation overlap paradigm on new architectures. The idea could be to extract some kernels characterized by the "do loops" you talked about, to change the communication algorithm and to test it before deciding to extend the modification to the entire the code. 
    158  
    159  • larger halo: could be done only on some variables that are for example using neighbor of neighbor (see what was done on sor solver). 
    160  
    161 Larger halo allows to decrease the communication frequency in spite of the computation of a larger domain. It is needed to identify the best trade-off between communication time decrease and computation time increase, that is the halo dimension which minimizes the total execution time. This dimension could depend on the number of MPI processes, the domain size and some architectural parameters such as the communication latency, … (we have published a work on this aspect  "The performance model for a parallel SOR algorithm using the red-black scheme", Int. J. of High Performance Systems Architecture, 2012 Vol.4, no.2, pp.101 - 109)