|
|
|
|
|
by samsquire
1043 days ago
|
|
Thanks so much for your comment ! :-) I'm a beginner myself. But I enjoying modelling parallleism dataflow, and data dependency and concurrency as trees for performance and graphs for coorfination. Which is kind of structured concurrency. If you take this graph of data flow or concurrency: digraph G {
start -> task1;
task1 -> task2;
task1 -> task3;
task2 -> task4;
task3 -> task5;
task4 -> task6;
task5 -> task6;
task6->end;
}
(paste it into https://dreampuf.github.io/GraphvizOnline to see a visual representation)Where task 1 diverges, you can run task2 and task3 in parallel, because they don't depend on eachother's outputs. Then you need to join task4 and task5 to task6. My email is in my profile, I'd love to chat about your thoughts on what futuristic software means to you. For me it means futuristic interactions with computers, alternative approaches to programming. |
|