Finally I made it work ! You can download and run bidir_orbit_01.c and configure it to cover the orbit of your choice. It will use 2 CPU/cores/theads to step forward and backwards at the same time.
This time, I did my best to keep it simple. I implemented only one FIFO but it would still miss some joins. What is the solution ? Since I code the FIFO from scratch, I can modify its behaviour and keep the last element in the queue. This ensures that all new values are compared with the last one!
All the joins are correctly detected now so I can finally think of running it on w26, after I added a progress bar and other resume features. And this time I'll make it run on a different computer to prevent accidental interruptions.
It's about time w26 gets validated !!!
Discussions
Become a Hackaday.io Member
Create an account to leave a comment. Already have an account? Log In.