Publication

Abstract : It’s important for software practitioners to understand mutual exclusion in different systems because most of the problems in concurrent systems boil down to achieve mutual exclusion. Mutual exclusion for different types of concurrent scenarios-multithreaded, parallel, distributed can be achieved in different ways by the constructs provided by the programming language. For each of the mentioned types, the performance (or behavior) varies in different ways. The performance of mutual exclusion algorithms is measured by mainly six metrics. This paper shows the comparison between the performance of a chosen synchronization algorithm by analyzing the sequence diagrams obtained from Java Interactive Visualization Environment (JIVE), a dynamic analysis framework for Java program visualization. This paper also presents the results and observations obtained after comparing dining philosophers problem in the above mentioned scenarios. The results are based on the metrics - Message complexity, Synchronization delay and Response Time. The analysis is done on low load performance.