4 ms·
In some cases, perhaps most cases, this gets hard. In other cases this is still easy. For example, when the ordering of the output doesn't matter. I'm dealing
by melvinroest 6y ago
In some cases, perhaps most cases, this gets hard.
In other cases this is still easy. For example, when the ordering of the output doesn't matter. I'm dealing with such a case in a data conversion program.
A super simple example for when ordering doesn't matter is when you do parallel addition.
- CyberDildonics 6y agoI'm not sure exactly what you are saying, but not all synchronization is about ordering. Addition is still synchronization since eventually multiple numbers will need to be merged into one output.
- melvinroest 6y agoSure, and that can cause issues potentially. But since addition is commutative [1], you don't have to wait on an exact ordering and synchronize for that. All you have to synchronize for is waiting until all the numbers are added. [1] for HN'ers that don't know the word, it means a + b is the same as b + a.
- CyberDildonics 6y agoWhat I said originally was that everything is synchronized at some point. You started talking about ordering and addition unprompted. Are you sure you meant to reply to this thread?