Analysis of Synchronization Mechanisms in Operating Systems
Oluwatoyin Kode, Temitope Oyemade

TL;DR
This study compares four synchronization mechanisms across macOS, Windows, and Linux, revealing reentrant locks are fastest but less consistent, while mutex-based mechanisms offer more predictable performance.
Contribution
It provides an empirical comparison of synchronization mechanisms across multiple operating systems, highlighting performance and consistency trade-offs.
Findings
Reentrant locks had the lowest average execution time.
Synchronized methods and blocks showed higher consistency.
Platform dependence affected reentrant lock performance.
Abstract
This research analyzed the performance and consistency of four synchronization mechanisms-reentrant locks, semaphores, synchronized methods, and synchronized blocks-across three operating systems: macOS, Windows, and Linux. Synchronization ensures that concurrent processes or threads access shared resources safely, and efficient synchronization is vital for maintaining system performance and reliability. The study aimed to identify the synchronization mechanism that balances efficiency, measured by execution time, and consistency, assessed by variance and standard deviation, across platforms. The initial hypothesis proposed that mutex-based mechanisms, specifically synchronized methods and blocks, would be the most efficient due to their simplicity. However, empirical results showed that reentrant locks had the lowest average execution time (14.67ms), making them the most efficient…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Nonlinear Dynamics and Pattern Formation
