Changes between Version 8 and Version 9 of ticket/0829

Timestamp:

2011-06-03T14:55:54+02:00 (13 years ago)

Author:

rblod

Comment:

--

ticket/0829

@@ -116 +116 @@
  CALL nemo_deallocate(zwi)     ! end routine
 }}}
-It was implemented in wrk_nemo_2 and implemented for test in traadv_tvd. To avoid changing all routines before a definitive choice, we choose to keep the old way and duplicate wrk_nemo in wrk_nemo_2 (later saved as wrk_nemo_2_simple), so we declare the double amount of memory.[[BR]]
+It was implemented in wrk_nemo_2 and implemented for test in traadv_tvd. To avoid changing all routines before a definitive choice, we choose to keep the old way and duplicate wrk_nemo in wrk_nemo_2 (later saved as wrk_nemo_2_simple), so we declare the double amount of memory, this would of course not be the case if it was implemented in all routines[[BR]]
 To avoid memory leaks, we could check for instance at the end of step that each counter is equal to one.
 
 ==== 3- Dynamic dynamic memory ====
+
+The point here is to avoid to have hard-coded the maximum of potential work arrays in use, and to optimize the memory size, especially for applications expensive in memory (biogeochemistry, assimilation)[[BR]]
+Here again, as a preliminary test, the implementation is done is w and the previous one is renamed wrk_nemo_2_simple.[[BR]]
+For each type of work arrays, we use an associated chained list to build the working arrays needed. But when we exit a routine, we do not destroy the working array created but we just point back to the beginning of the list. Actually at the end of the first time step we should have built all the memory needed.