Incrementer using Combining tree

This video shows an example of parallel counter operation implemented using a combining tree.
This has O(lgn) complexity when run in parallel while the normal counter with locks will have a complexity of O(n)

Bakery Algorithm

https://www.youtube.com/watch?v=sfVKdT0TgLQ