+ Java and Ruby:
+ * Bindings now constitute their own package, separated from the main one.
+ Rationale: reduce our maintainance nightmare by reducing the module coupling
+ They will soon be released on their own on gforge.
+ * In the meanwhile:
+ svn co svn://scm.gforge.inria.fr/svn/simgrid/contrib/trunk/simgrid-java
+ svn co svn://scm.gforge.inria.fr/svn/simgrid/contrib/trunk/simgrid-ruby
+
+ GRAS: It is not considered as stable anymore, but experimental. Sorry.
+ * It's not quite deprecated for now because we have no replacement,
+ but it may soon become the case.
+
+ SMPI
+ * New MPI functions supported: MPI_Comm_disconnect, MPI_Comm_get_name
+ * Fortran: New user-level cache variable to store the rank of the running
+ process. This improves performance by an order of magnitude.
+ * C: New coccinelle script to automatically locate and modifiy global and
+ local static variables.
+ * Improved SMPI network model with a sender-side gap to account for multiple
+ parallel sends.
+
+ MSG
+ * New function MSG_comm_get_status(). MSG_comm_test() and MSG_comm_testany()
+ only say if a communication is finished, no matter whether it succeeded or
+ failed. You can call MSG_comm_get_status() to know the status of a finished
+ communication.
+ * New function MSG_task_dsend() to send a task and detach it. When a
+ communication is detached, you are never notified of its success or failure
+ and the memory is released automatically once it is finished. This function
+ is useful when you don't care about the end nor the success of a
+ communication.
+ * Change the prototypes of action replay. Sorry for inconvenience,
+ but this is really more efficient this way (and to adapt your code,
+ you just have to fix the initialization, that shouldn't be too long)
+ * Kill the braindead MSG_task_refcount_dec() function. I guess nobody
+ ever managed to do anything useful with it.
+ * New function MSG_comm_testany(). Similarly to MSG_comm_waitany(), it
+ takes a dynar of communications. It returns immediately and gives the
+ index of a finished communication (if any).
+ * New example: a basic implementation of the Chord P2P algorithm.
+
+ SURF
+ * New model for multi-core CPUs. You can now use the core attribute to
+ precise the number of cores of a host. This is a basic model. Every
+ process running on the host receives at most the power provided in
+ the DTD (throughput<=power). Total throughput of process cannot exceed
+ power * num_cores.
+ * New peer tag. This peer tag creates a tiny AS comprising a host and a
+ router linked by an up-link and a down-link (possibly asymmetrical).
+ This kind of pattern allows to easily build last-mile model style platforms.
+ Aggregating such patterns in a rule-based AS is thus the technique of
+ choice for modeling large peer-to-peer/volunteer computing/cloud platforms.
+ * New model for Vivaldi routing. We transformed the Vivaldi network model
+ into a Vivaldi routing model (based on the rule-based model). This allows to
+ combine Vivaldi based latencies with last-mile platforms.
+
+ SIMIX
+ * Introduce a new context factory "raw", highly inspirated from the
+ ucontext factory, but using manually crafted functions in assembly to
+ do the work in an efficient manner.
+ * Allow to change the used context factory at run time, not only at
+ compilation time. Use --cfg=contexts/factory:raw for maximal speed.
+ * Add an option --cfg=contexts/stacksize:N to set the stack size of the user
+ contextes at runtime (only with raw contexts or ucontexts).
+ * Completely rewrote this module to allow parallel execution of user
+ processes. Use --cfg=contexts/nthreads:N to execute user processes
+ with N parallel threads (the default is 1, meaning no parallelism).
+ * Allow to decide dynamically between sequential and parallel modes.
+ When nthreads > 1, you can use --cfg=contexts/threshold:P to run the user
+ processes in parallel only when their number is greater than or equal to P
+ (the default is 2).
+ * Added a check for NaN of IEEE754 infinite in the double entries of
+ the smx_user.c file