![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
Sorting It Out
Jul. 8th, 2014 06:00 pmWell, I managed to work out an algorithm that should work for the multithreaded topological sort in our environment. Whee!
The problem is that our old balancing routine (which essentially does looping on the generated sort to drive two values to a match with each other) does not play well with multithreading or the new version of the topological sort. I'd been planning to try to rewrite the balancing routine for a while now -- it appears that the time has arrived.
The good news is that it should be faster when I'm done.
The bad news is that getting it done is not faster...
The problem is that our old balancing routine (which essentially does looping on the generated sort to drive two values to a match with each other) does not play well with multithreading or the new version of the topological sort. I'd been planning to try to rewrite the balancing routine for a while now -- it appears that the time has arrived.
The good news is that it should be faster when I'm done.
The bad news is that getting it done is not faster...