A TOKEN BASED K-RESILIENT MUTUAL EXCLUSION ALGORITHM FOR DISTRIBUTED SYSTEMS
| Autor: | Dhananjay M. Dhamdhere, Sandeep S. Kulkarni |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 1994 |
| Předmět: |
Computer science
Distributed computing media_common.quotation_subject Fault Tolerance Fault tolerance Security token Data structure Computer Science Applications Theoretical Computer Science Suzuki-Kasami algorithm Distributed Systems Algorithmics Signal Processing Mutual exclusion Simplicity Mutual Exclusion Distributed Computing Algorithm Ricart–Agrawala algorithm Information Systems media_common K-Resiliency |
| Zdroj: | IndraStra Global. |
| ISSN: | 2381-3652 |
| DOI: | 10.1016/0020-0190(94)00019-0 |
| Popis: | This paper presents a token based mutual exclusion algorithm which is k-resilient in that it can tolerate up to k site/link failures. The algorithm uses many features of the token based algorithm by Raymond and inherits many of its advantages, viz. simplicity of the token message and the local data structure at each site. Correctness proofs of the algorithm and complexity analysis are included. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|