Abstract
The initial software solutions to solve the Process Synchronization problems, which ultimately led to the use of Semaphores are usually hard for a beginner to understand and appreciate. The reason is that one has to do lots of book keeping in tracing these algorithms, which involve multiple processes and variable instances. In order to prove the correctness of any synchronization problem, it has to be tested over the Critical Section conditions which again might be a tough exercise. In this paper we propose a model called "Laurel and Hardy" to understand and prove the (in)completeness of the software solutions to the Process Synchronization problem. A series of dramas is enacted between the two comedians Laurel and Hardy which makes understanding of synchronization problem solutions and testing it over Critical Section conditions very simple. We attempt to convince the readers that Laurel and Hardy model can be used as a potential tool for the analysis of any synchronization algorithms and also in assessing the (in)completeness of it. In addition, Laurel and Hardy model can be used as a teaching aid in beginner's Operating System course.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
