<story><title>Look ma, no locks</title><url>http://lucteo.ro/2018/11/18/look-ma-no-locks/</url></story><parent_chain></parent_chain><comment><author>barbegal</author><text>This is a confusing article. The main content is a description of how to implement a simple operating system scheduler which effectively is implementing locks using instruction level primitives.&lt;p&gt;The author has completely neglected the most common cases where either &amp;quot;tasks&amp;quot; require multiple resources (e.g. when copying between two files) or where the ordering of tasks is important. It is these two conditions that lead to deadlocks and livelocks.</text></comment>
<story><title>Look ma, no locks</title><url>http://lucteo.ro/2018/11/18/look-ma-no-locks/</url></story><parent_chain></parent_chain><comment><author>Noumenon72</author><text>I&amp;#x27;m expecting someone to come denigrate your approach in the comments, but the fact you made this readable and kept me with you to the end is a real feat of communication. Thanks for putting in all the effort to re-explain, color-code, and consider objections.</text></comment>