FRI-2G.303-1-CCT1-09
COMPARATIVE ANALYSIS OF DEKKER’S AND PETERSON’S ALGORITHMS IN TIME-SHARING SYSTEMS
Abstract
This report explores the "frozen quantum" issue in mutual exclusion algorithms used in time-sliced operating systems. It compares Peterson's and Dekker's approaches, particularly under preemptive scheduling. The analysis highlights a key drawback in Peterson's algorithm, where a process interrupted after raising its flag but before entering the critical section causes complete CPU quantum wastage and reduced system performance. In contrast, Dekker's method shows improved efficiency by allowing temporary flag release during contention, which enhances CPU usage. Simulations indicate that Dekker's algorithm performs notably better in high-contention environments. The findings challenge conventional assumptions about algorithm efficiency and emphasize the critical importance of context-aware synchronization mechanism selection in modern operating systems.
Keywords
Operating Systems, Mutual Exclusion Algorithms, Teaching Tools
REFERENCES
- Dijkstra, E. W. (1965) ‘Solution of a problem in concurrent programming control’, Communications of the ACM.
- Golemanov, T. and Golemanova, E. (2020) ‘Using TOST in Teaching Operating Systems and Concurrent Programming Concepts’, Advances in Science, Technology and Engineering Systems, 5(6). doi: 10.25046/aj050610.
- Peterson, G. L. (1981) ‘Myths About the Mutual Exclusion Problem’, Information Processing.
- Silberschatz, A. (2018) Operating System Concpets, Wiley.
- Tanenbaum, A. S. and Bos, H. (2016) Modern Operating Systems, Education. Pearson India; 4th edition.