Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
finam
Manage
Activity
Members
Labels
Plan
Issues
32
Issue boards
Milestones
Code
Merge requests
4
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Monitor
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
FINAM
finam
Commits
b58aa943
Commit
b58aa943
authored
2 years ago
by
Martin Lange
Browse files
Options
Downloads
Patches
Plain Diff
add section on the new scheduling algorithm
parent
19319069
No related branches found
Branches containing commit
No related tags found
Tags containing commit
1 merge request
!145
Release 0.4.0 blog post
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
docs/source/blog/posts/release-0-4-0.rst
+15
-1
15 additions, 1 deletion
docs/source/blog/posts/release-0-4-0.rst
with
15 additions
and
1 deletion
docs/source/blog/posts/release-0-4-0.rst
+
15
−
1
View file @
b58aa943
...
...
@@ -11,7 +11,7 @@ FINAM 0.4 released
After two months of hard work since the last release, FINAM 0.4 comes with a full load of new features
and usability improvements. This version is a real breakthrough in the development of FINAM!
Highlights are new grid data types, automatic metadata and units handling,
Highlights are
a
new
scheduling algorithm,
grid data types, automatic metadata and units handling,
more flexible exchange during initialization, and a completely reworked documentation.
What's new?
...
...
@@ -19,6 +19,20 @@ What's new?
FINAM 0.4 comes with several new major features around data and metadata handling.
Scheduling algorithm
^^^^^^^^^^^^^^^^^^^^
The old scheduling algorithm simply selected the component most back in time.
It had the flaw that the data received by a component was usually associated to time passed,
rather than to the time span of the next step to perform.
The new algorithm recursively analyzes dependencies and updates upstream components before advancing downstream components.
This way, components can rely on data that is not outdated.
For circular couplings, we provide a new adapter that extrapolates in time, so the dependency cycle can be interrupted.
For more details on the new algorithm, see the book chapter :doc:`/finam-book/principles/coupling_scheduling`.
Metadata for all coupling slots
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment