메뉴 건너뛰기




Volumn , Issue , 2013, Pages 151-158

A robust permission-based hierarchical distributed k-mutual exclusion algorithm

Author keywords

Distributed Systems; Fault Tolerance; Hi ADSD; Mutual Exclusion

Indexed keywords

BASIC BUILDING BLOCK; CRITICAL RESOURCES; DISTRIBUTED MUTUAL EXCLUSION; DISTRIBUTED SPANNING TREES; DISTRIBUTED STRATEGIES; DISTRIBUTED SYSTEMS; HI-ADSD; MUTUAL EXCLUSIONS;

EID: 84892739576     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPDC.2013.28     Document Type: Conference Paper
Times cited : (6)

References (29)
  • 2
    • 0017996760 scopus 로고
    • Time clocks, and the ordering of events in a distributed system
    • Jul
    • L. Lamport, "Time clocks, and the ordering of events in a distributed system," Commun. ACM, vol. 21, pp. 558-565, Jul. 1978.
    • (1978) Commun. ACM , vol.21 , pp. 558-565
    • Lamport, L.1
  • 4
    • 0019439018 scopus 로고
    • An optimal algorithm for mutual exclusion in computer networks
    • Jan
    • G. Ricart and A. K. Agrawala, "An optimal algorithm for mutual exclusion in computer networks," Commun. ACM, vol. 24, pp. 9-17, Jan. 1981.
    • (1981) Commun. ACM , vol.24 , pp. 9-17
    • Ricart, G.1    Agrawala, A.K.2
  • 5
    • 0026141709 scopus 로고
    • A simple taxonomy for distributed mutual exclusion algorithms
    • Apr.
    • M. Raynal, "A simple taxonomy for distributed mutual exclusion algorithms," SIGOPS Oper. Syst. Rev., vol. 25, pp. 47-50, Apr. 1991.
    • (1991) SIGOPS Oper. Syst. Rev. , vol.25 , pp. 47-50
    • Raynal, M.1
  • 6
    • 0037402303 scopus 로고    scopus 로고
    • A survey of permission-based distributed mutual exclusion algorithms
    • May
    • P. C. Saxena and J. Rai, "A survey of permission-based distributed mutual exclusion algorithms," Comput. Stand. Interfaces, vol. 25, no. 2, pp. 159-181, May 2003.
    • (2003) Comput. Stand. Interfaces , vol.25 , Issue.2 , pp. 159-181
    • Saxena, P.C.1    Rai, J.2
  • 7
    • 0017722619 scopus 로고
    • Distributed systems-Towards a formal approach
    • G. Le Lann, "Distributed systems-Towards a formal approach," in IFIP Congress, 1977, pp. 155-160.
    • (1977) IFIP Congress , pp. 155-160
    • Le Lann, G.1
  • 8
    • 0022151877 scopus 로고
    • A distributed mutual exclusion algorithm
    • Nov
    • I. Suzuki and T. Kasami, "A distributed mutual exclusion algorithm," ACM Trans. Comput. Syst., vol. 3, pp. 344-349, Nov. 1985.
    • (1985) ACM Trans. Comput. Syst. , vol.3 , pp. 344-349
    • Suzuki, I.1    Kasami, T.2
  • 9
    • 0024607971 scopus 로고
    • A tree-based algorithm for distributed mutual exclusion
    • Jan
    • K. Raymond, "A tree-based algorithm for distributed mutual exclusion," ACM Trans. Comput. Syst., vol. 7, pp. 61-77, Jan. 1989.
    • (1989) ACM Trans. Comput. Syst. , vol.7 , pp. 61-77
    • Raymond, K.1
  • 10
    • 0030577965 scopus 로고    scopus 로고
    • A log (n) distributed mutual exclusion algorithm based on path reversal
    • Apr.
    • M. Naimi, M. Trehel, and A. Arnold, "A log (n) distributed mutual exclusion algorithm based on path reversal," J. Parallel Distrib. Comput., vol. 34, pp. 1-13, Apr. 1996.
    • (1996) J. Parallel Distrib. Comput. , vol.34 , pp. 1-13
    • Naimi, M.1    Trehel, M.2    Arnold, A.3
  • 11
    • 0023401462 scopus 로고
    • The information structure of distributed mutual exclusion algorithms
    • Aug
    • B. A. Sanders, "The information structure of distributed mutual exclusion algorithms," ACM Trans. Comput. Syst., vol. 5, pp. 284-299, Aug. 1987.
    • (1987) ACM Trans. Comput. Syst. , vol.5 , pp. 284-299
    • Sanders, B.A.1
  • 12
    • 0024608694 scopus 로고
    • A distributed algorithm for multiple entries to a critical section
    • Feb.
    • K. Raymond, "A distributed algorithm for multiple entries to a critical section," Inf. Process. Lett., vol. 30, pp. 189-193, Feb. 1989.
    • (1989) Inf. Process. Lett. , vol.30 , pp. 189-193
    • Raymond, K.1
  • 14
    • 0032659763 scopus 로고    scopus 로고
    • Embedding and reconfiguration of spanning trees in faulty hypercubes
    • Mar
    • D. R. Avresky, "Embedding and reconfiguration of spanning trees in faulty hypercubes," IEEE Trans. Paral. Distr. Sys., vol. 10, no. 3, pp. 211-222, Mar. 1999.
    • (1999) IEEE Trans. Paral. Distr. Sys. , vol.10 , Issue.3 , pp. 211-222
    • Avresky, D.R.1
  • 18
    • 0031672517 scopus 로고    scopus 로고
    • A hierarchical adaptive distributed system-level diagnosis algorithm
    • Jan
    • E. P. Duarte Jr. and T. Nanya, "A hierarchical adaptive distributed system-level diagnosis algorithm," IEEE Transactions on Computers, vol. 47, no. 1, pp. 34-45, Jan. 1998.
    • (1998) IEEE Transactions on Computers , vol.47 , Issue.1 , pp. 34-45
    • Duarte Jr., E.P.1    Nanya, T.2
  • 20
    • 24144496599 scopus 로고    scopus 로고
    • A survey of self-stabilizing spanning-Tree construction algorithms
    • Technical Report IC/ 2003
    • F. C. Gärtner, "A survey of self-stabilizing spanning-Tree construction algorithms," Swiss Federal Institute of Technology (EPFL), Technical Report IC/2003/38, 2003.
    • Swiss Federal Institute of Technology (EPFL) , vol.38 , pp. 2003
    • Gärtner, F.C.1
  • 22
    • 0036852770 scopus 로고    scopus 로고
    • Neko: A single environment to simulate and prototype distributed algorithms
    • November
    • P. Urb́an, X. D́efago, and A. Schiper, "Neko: A single environment to simulate and prototype distributed algorithms," Journal of Inf. Science and Eng., vol. 18, no. 6, pp. 981-997, November 2002.
    • (2002) Journal of Inf. Science and Eng. , vol.18 , Issue.6 , pp. 981-997
    • Urb́an, P.1    D́efago, X.2    Schiper, A.3
  • 23
    • 0029227364 scopus 로고
    • A distributed k-mutual exclusion algorithm
    • May
    • S. Bulgannawar and N. Vaidya, "A distributed k-mutual exclusion algorithm," in ICDCS, May 1995, pp. 153-160.
    • (1995) ICDCS , pp. 153-160
    • Bulgannawar, S.1    Vaidya, N.2
  • 24
    • 2842536947 scopus 로고    scopus 로고
    • Distributed mutual exclusion on hypercubes
    • Jul.
    • M. Naimi, "Distributed mutual exclusion on hypercubes," SIGOPS Oper. Syst. Rev., vol. 30, pp. 46-51, Jul. 1996.
    • (1996) SIGOPS Oper. Syst. Rev. , vol.30 , pp. 46-51
    • Naimi, M.1
  • 26
    • 0022145769 scopus 로고
    • How to assign votes in a distributed system
    • Oct.
    • H. Garcia-Molina and D. Barbara, "How to assign votes in a distributed system," J. ACM, vol. 32, pp. 841-860, Oct. 1985.
    • (1985) J. ACM , vol.32 , pp. 841-860
    • Garcia-Molina, H.1    Barbara, D.2
  • 27
    • 84976715309 scopus 로고
    • An efficient and fault-Tolerant solution for distributed mutual exclusion
    • Feb
    • D. Agrawal and A. El Abbadi, "An efficient and fault-Tolerant solution for distributed mutual exclusion," ACM Trans. Comput. Syst., vol. 9, pp. 1-20, Feb. 1991.
    • (1991) ACM Trans. Comput. Syst. , vol.9 , pp. 1-20
    • Agrawal, D.1    El Abbadi, A.2
  • 28
    • 83755171486 scopus 로고    scopus 로고
    • Quorum based mutual exclusion in asynchronous systems with unreliable failure detectors
    • Springer
    • S.-H. Park and S.-H. Lee, "Quorum based mutual exclusion in asynchronous systems with unreliable failure detectors," in Grid and Distributed Computing. Springer, 2011, vol. 261, pp. 25-34.
    • (2011) Grid and Distributed Computing. , vol.261 , pp. 25-34
    • Park, S.-H.1    Lee, S.-H.2
  • 29
    • 70350752321 scopus 로고    scopus 로고
    • A timer-free fault tolerant k-mutual exclusion algorithm
    • M. Bouillaguet, L. Arantes, and P. Sens, "A timer-free fault tolerant k-mutual exclusion algorithm," in LADC, 2009, pp. 41-48.
    • (2009) LADC , pp. 41-48
    • Bouillaguet, M.1    Arantes, L.2    Sens, P.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.