메뉴 건너뛰기




Volumn 18, Issue 4, 2006, Pages 267-277

On the inherent weakness of conditional primitives

Author keywords

Conditionals; Mutual exclusion; Object implementations; Space lower bounds

Indexed keywords

CONDITIONALS; MUTUAL EXCLUSION; OBJECT IMPLEMENTATIONS; SPACE LOWER BOUNDS;

EID: 33646507102     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-005-0136-5     Document Type: Conference Paper
Times cited : (8)

References (10)
  • 1
    • 0036939044 scopus 로고    scopus 로고
    • An improved lower bound for the time complexity of mutual exclusion
    • Anderson, J.H., Kim, Y.J.: An improved lower bound for the time complexity of mutual exclusion. Distrib. Comput. 15(4), 221-253 (2002)
    • (2002) Distrib. Comput. , vol.15 , Issue.4 , pp. 221-253
    • Anderson, J.H.1    Kim, Y.J.2
  • 2
    • 0141498457 scopus 로고    scopus 로고
    • Shared-memory mutual exclusion: Major research trends since 1986
    • Anderson, J.H., Kim, Y.J., Herman, T.: Shared-memory mutual exclusion: major research trends since 1986. Distrib. Comput. 16(2-3), 75-110 (2003)
    • (2003) Distrib. Comput. , vol.16 , Issue.2-3 , pp. 75-110
    • Anderson, J.H.1    Kim, Y.J.2    Herman, T.3
  • 3
    • 38249000189 scopus 로고
    • Bounds on shared memory for mutual exclusion
    • Burns, J.R., Lynch, N.A.: Bounds on shared memory for mutual exclusion. Information and Computation 107(2), 171-184 (1993)
    • (1993) Information and Computation , vol.107 , Issue.2 , pp. 171-184
    • Burns, J.R.1    Lynch, N.A.2
  • 5
    • 0031270779 scopus 로고    scopus 로고
    • Contention in shared memory algorithms
    • Dwork, C., Herlihy, M., Waarts, O.: Contention in shared memory algorithms. J. ACM 44(6), 779-805 (1997)
    • (1997) J. ACM , vol.44 , Issue.6 , pp. 779-805
    • Dwork, C.1    Herlihy, M.2    Waarts, O.3
  • 6
    • 0141854015 scopus 로고    scopus 로고
    • Hundreds of impossibility results for distributed computing
    • Fich, F., Ruppert, E.: Hundreds of impossibility results for distributed computing.Distrib. Comput. 16(2-3), 121-163 (2003)
    • (2003) Distrib. Comput. , vol.16 , Issue.2-3 , pp. 121-163
    • Fich, F.1    Ruppert, E.2
  • 9
    • 0342468144 scopus 로고    scopus 로고
    • Time and space lower bounds for non-blocking implementations
    • Jayanti, P., Tan, K., Toueg, S.: Time and space lower bounds for non-blocking implementations. Siam J. Comput. 30(2), 438-456 (2000)
    • (2000) Siam J. Comput. , vol.30 , Issue.2 , pp. 438-456
    • Jayanti, P.1    Tan, K.2    Toueg, S.3
  • 10
    • 0029352227 scopus 로고
    • A fast, scalable mutual exclusion algorithm
    • Yang, J.H., Anderson, J.H.: A fast, scalable mutual exclusion algorithm. Distrib. Comput. 9(1), 51-60 (1995)
    • (1995) Distrib. Comput. , vol.9 , Issue.1 , pp. 51-60
    • Yang, J.H.1    Anderson, J.H.2


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