Distributed Mutual Exclusion Based on Causal Ordering

摘要: Problem statement: Causality among events, more formally the causal ordering relation, is a powerful tool for analyzing and drawing inferences about distributed systems. The knowledge of relation between processes helps designers system itself solve variety problems in In algorithms design, such helped ensure fairness liveness algorithms, maintained consistent databases design deadlock-detection algorithm. It also to build checkpoint failure recovery detect data inconsistencies replicated databases. Approach: this study, we implemented Suzuki-Kasami’s token based algorithm that realized mutual exclusion n processes. Two files sequence numbers were used one compute number requests sent other entering critical section. Results: was guaranteed requests. If process Pi requested section before Pj, then will enter its Pj. Conclusion: presented here, assumes if request req req’s, be satisfied req’s.