... | ... | @@ -32,8 +32,6 @@ The particularity of this given order is that we don't have to fully complete a |
|
|
|
|
|
With everything that has been stated, we can now create the following data flow diagram : !
|
|
|
|
|
|

|
|
|
|
|
|
# First implementation
|
|
|
|
|
|
To begin with, we will put a taskwait between each call of the main training loop. However the rest of the program will be task-based, as shown by the following sketch:
|
... | ... | |