Parallel and distributed algorithms and implementations: Time based mutual exclusion

A parallel algorithm is required to satisfy mutual exclusion in order to execute all processes properly. To execute Mutual exclusion, there must be required to satisfy these two conditions: synchronization and concurrent execution of all processes. Though failure of process inside the critical region may occur and that makes all other processes to wait until that process exit or stop using that critical region. This may lead to infinite time of wait for other process. This problem might be solved by time based mutual exclusion. In this paper we will present one solution for such failure. We create a new data structure of every critical region which is shared by other processes in the parallel and distributed environment. We introduce timestamp based data structure which tries to recover from such process failure. This timestamp based data structure has certain attributes based on that attributed we will recover from the failure of that process.