Changes between Version 2 and Version 3 of ticket/0829

Timestamp:

2011-05-31T10:01:14+02:00 (13 years ago)

Author:

rblod

Comment:

--

ticket/0829

@@ -13 +13 @@
 === Description ===
 
-Computing  aspects of dynamic memory implementation are already described there http://forge.ipsl.jussieu.fr/nemo/wiki/2011WP/2011Stream2/DynamicMemory, possible conseuqneces  there https://forge.ipsl.jussieu.fr/nemo/wiki/2011Stream2/DynamicMemory_improvments . This branch deals with the first aspect, ie the practical implementation. [[BR]]
+Computing  aspects of dynamic memory implementation are already described there http://forge.ipsl.jussieu.fr/nemo/wiki/2011WP/2011Stream2/DynamicMemory, possible consequences  there https://forge.ipsl.jussieu.fr/nemo/wiki/2011Stream2/DynamicMemory_improvments . This branch deals with the first aspect, ie the practical implementation. [[BR]]
 Dynamic memory implementation is clearly a step forward, an current implementation from branch dev_r2586_dynamic_mem; is quiet clean, with careful checks of availability of the work arrays. However:
  * Assignation of work arrays by hand leads to some difficulties considering the number of options and combinations of options available in NEMO
  * In term of memory, the number of work arrays have to be hard-coded to the maximum combination, ie we always use more memory than needed
+Investigation of improvements follows the following steps:
+ * Implementation of timing functionalities : this topic has been discussed within NEMO group for years, since the dynamic memory developments are impacting all the routines, implementing timing in the same time makes sense 
+ * Small changes in current implementation : the work-arrays are a in list automatically incremented and decremented, no more assigned by hand. This solves limitation 1 above.
+ * More radical change : the working space is build dynamically. This solves limitation 2.
+
+==== Timing ====
+==== Auto-assignement ====
+==== Dynamic dynamic memory ====
+
 
 ----