메뉴 건너뛰기




Volumn 32, Issue 3, 1999, Pages 241-280

Accessing nearby copies of replicated objects in a distributed environment

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES;

EID: 0033433272     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000118     Document Type: Article
Times cited : (118)

References (20)
  • 4
    • 0029369741 scopus 로고
    • Online tracking of mobile users
    • B. Awerbuch and D. Peleg. Online tracking of mobile users. Journal of the ACM, 37:1021-1058, 1995.
    • (1995) Journal of the ACM , vol.37 , pp. 1021-1058
    • Awerbuch, B.1    Peleg, D.2
  • 6
    • 0000182415 scopus 로고
    • A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations
    • H. Chernoff, A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 23:493-509, 1952.
    • (1952) Annals of Mathematical Statistics , vol.23 , pp. 493-509
    • Chernoff, H.1
  • 12
    • 0022141776 scopus 로고
    • Fat-trees: Universal networks for hardware-efficient supercomputing
    • C. E. Leiserson, Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Transactions on Computers C-34:892-900, 1985.
    • (1985) IEEE Transactions on Computers , vol.C-34 , pp. 892-900
    • Leiserson, C.E.1
  • 19
    • 0023266822 scopus 로고
    • How to share memory in a distributed system
    • E. Upfal and A. Wigderson. How to share memory in a distributed system. Journal of the ACM, 34:116-127, 1987.
    • (1987) Journal of the ACM , vol.34 , pp. 116-127
    • Upfal, E.1    Wigderson, A.2


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