- 27 Nov, 2019 1 commit
-
-
It is still not working, however we now have no more redundant code, making debugging it simpler.
FritzFlorian committed
-
- 19 Nov, 2019 1 commit
-
-
Everything so far is untested. We only made sure tha fast path still seems to function correctly. Next up is writing tests for both the fast and slow path to then introduce the slow path. After that we can look at performance optimizations.
FritzFlorian committed
-
- 07 Nov, 2019 1 commit
-
-
This showcases the expected performance when a task executes a sub-tree without inference from other threads. We target to stay about 6x slower than a normal function call.
FritzFlorian committed
-
- 01 Oct, 2019 1 commit
-
-
FritzFlorian committed
-
- 31 Jul, 2019 1 commit
-
-
FritzFlorian committed
-
- 30 Jul, 2019 1 commit
-
-
FritzFlorian committed
-
- 29 Jul, 2019 2 commits
-
-
This makes the programming model a full dataflow implementation, as it allows for branching and recursion.
FritzFlorian committed -
Recursion works by using a function node, calling the graph again. We separated an graph invocation form an function invocation within an graph, making the graph only handle one concern.
FritzFlorian committed
-
- 24 Jul, 2019 1 commit
-
-
FritzFlorian committed
-
- 22 Jul, 2019 1 commit
-
-
FritzFlorian committed
-
- 19 Jul, 2019 1 commit
-
-
We separated the structure (input-output flow) from the rest of the architecture and reworked some template programming to have better access to the types required at compile time.
FritzFlorian committed
-
- 11 Jul, 2019 1 commit
-
-
The data can now flow into a graph, follow its path on inptus/outputs and be fetched from the graph after execution. Currently graphs are executed synchronous.
FritzFlorian committed
-
- 10 Jul, 2019 1 commit
-
-
FritzFlorian committed
-
- 09 Jul, 2019 2 commits
-
-
We need some tricks in template programming to have a clean user facing API while internally using our classes with more capabilities.
FritzFlorian committed -
This is the base building block for creating the actual dataflow functions and networks, as their main functionality is having data flow through connected nodes.
FritzFlorian committed
-
- 18 Jun, 2019 1 commit
-
-
FritzFlorian committed
-
- 12 Jun, 2019 1 commit
-
-
Now all algorithms are used without the parallel pre-/suffix and the for_each method has an specialization for integer ranges.
FritzFlorian committed
-
- 06 Jun, 2019 1 commit
-
-
FritzFlorian committed
-
- 30 Apr, 2019 1 commit
-
-
FritzFlorian committed
-
- 17 Apr, 2019 1 commit
-
-
FritzFlorian committed
-
- 12 Apr, 2019 1 commit
-
-
FritzFlorian committed
-
- 09 Apr, 2019 2 commits
-
-
FritzFlorian committed
-
We do this to properly separate the cache alginment logic in the next step, allowing us to port all cache aligned objects without worrying about portability.
FritzFlorian committed
-
- 05 Apr, 2019 1 commit
-
-
FritzFlorian committed
-
- 02 Apr, 2019 3 commits
-
-
There are serval ways we could optimize the calls, but for now this should be enough for first tests.
FritzFlorian committed -
FritzFlorian committed
-
FritzFlorian committed
-
- 01 Apr, 2019 1 commit
-
-
FritzFlorian committed
-
- 15 Mar, 2019 1 commit
-
-
Seperate library from other parts of project (samples, playground, testing, ...). We still are in one 'toplevel' cmake project, so we can for exmaple compile everything (library and playground) in debug mode, for simple development.
FritzFlorian committed
-