+Version 3.29 (October 7. 2021)
+------------------------------
+
+To celebrate the "Ask a stupid question" release, we wish that every user ask one question about SimGrid.
+On `Mattermost <https://framateam.org/simgrid/channels/town-square>`_,
+`Stack Overflow <https://stackoverflow.com/questions/tagged/simgrid>`_,
+or using the `issues tracker <https://framagit.org/simgrid/simgrid/-/issues>`_.
+
+ * Python bindings for the platform creation API
+ * Introduce non-linear resource sharing, allowing decay models
+ * New documentation section on realistic I/O modeling
+ * (+ many bug fixes and internal refactoring)
+
+This release finishes the work on programmatic platforms, that was ongoing since 3.27. It is now possible to define a complete platform in either C++
+or python, and the XML approach is now deprecated. It will probably remain around for a long time, but no evolution is planned. New features will not
+be ported to the XML parser (unless you provide a patch, of course).
+
+This release also paves the way for new models, with the introduction of two new features to the model solver:
+
+ * Non-linear resource sharing was introduced, allowing to model resource whose performance heavily degrades with contention. This may be used in the
+ future for Wi-Fi links, where the total amount of data exchanged in a cell drops when the amount of stations reaches a threshold.
+ * Dynamic factors model variability in the speed of activities. This can be used to model an overhead (e.g., there is a 20 bytes header in a 480
+ bytes TCP packet so the factor 0.9583) but the novelty is this factor can now easily be adjusted depending on activity's and resources
+ characteristics.
+
+ This existed for network (e.g., the effective bandwidth depends on the message in SMPI piecewise-linear network model) but it is now more general
+ (the factor may depend on the source and destination and thus account to different behaviors for intra-node communications and extra-node
+ communications) and is available for CPUs (e.g., if you want to model an affinity as in the "Unrelated Machines" problem in scheduling) and disks
+ (e.g., if you want to model a stochastic capacity) too.
+
+ The same mechanism is also available for the latency, which allows to easily introduce complex variability patterns.
+
+These new features are not used yet in the provided models, but this will probably change in future releases.
+
+Version 3.30 (January 30. 2022)
+---------------------------
+
+The Sunday Bloody Sunday release.
+
+In may 2016, the future organization of the S4U activities was drafted on a Hawaiian whiteboard. We defined the life cycle of activities, their types,
+and the way to combine them. All of this had been implemented since, but one piece was still missing: the capacity to express dependencies and vetoes
+that can prevent an activity to start. The underlying idea was to be able to manage application DAGs, a la SimDag, through the S4U API, and have
+maestro to handle the execution of such DAGs.
+
+This release finishes this work, which is presented in a new set of examples (`examples/cpp/dag-*`). The direct consequences on the code base of this
+new feature are:
+
+ * The SimDag API for the simulation of the scheduling of Directed Acyclic Graphs has been finally dropped. It was marked as deprecated for a couple
+ of years.
+ * The removal of SimDag led us to also remove the export to Jedule files that was tightly coupled to SimDag. The instrumentation of DAG simulation
+ is still possible through the regular instrumentation API based on the Paje format.
+
+On the bindings front, we dropped the Lua bindings to create new platforms, as the C++ and Python interfaces are much better to that extend.
+Also, the algorithm tutorial can now be taken in Python, for those of you alergic to C++.