A General Mutual Exclusion Primitive: Simulation And Evaluation

The need for control of concurrent processes is a consequence of problems associated with their unmanaged execution. The mechanisms that enable such control are generally called synchronization or mutual exclusion primitives. When processes try to access shared data simultaneously, mutual exclusion is to be enforced. Over the past three decades, the mutual exclusion phenomenon has emerged as one of the foremost paradigms of the difficulties associated with parallel and distributed programming, and several solutions for it have been offered. In this paper a new primitive for mutual exclusion is proposed. This primitive was implemented and evaluated in a simulated setting. It was shown to satisfy the requirements for any mutual exclusion scheme. The new primitive compares favourably with other well-known and efficient n-process mutual exclusion primitives in terms of the worst-case waiting time, the number of variables used, and understandability.