How can you solve the core problem in concurrent programming? How can you avoid using locks, but still have safety for your resources?
Look ma, no locks
by Lucian Radu Teodorescu
From the article:
We previously argued that threads are not the answer to parallelism problems, and also that we should avoid locks as much as possible. But how can we have a world in which threads do not block each other?
We want to explore here a systematic way for replacing locks (mutexes, read-write mutexes, semaphores) in our systems with tasks. We argue that there is a general schema that allows us to move from a world full of locks to a world without locks, in which the simple planning and execution of tasks makes things simpler and more efficient.
Add a Comment