메뉴 건너뛰기




Volumn 55, Issue 1, 1998, Pages 109-120

Efficient Vector Time with Dynamic Process Creation and Termination

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0004542796     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1998.1493     Document Type: Article
Times cited : (8)

References (17)
  • 1
  • 2
    • 0026188189 scopus 로고
    • Concerning the size of logical clocks in distributed systems
    • Charron-Bost B. Concerning the size of logical clocks in distributed systems. Information Process. Lett. 39:1991;11-16.
    • (1991) Information Process. Lett. , vol.39 , pp. 11-16
    • Charron-Bost, B.1
  • 3
    • 0023833640 scopus 로고
    • Timestamps in message-passing systems that preserve the partial ordering
    • Fidge C. J. Timestamps in message-passing systems that preserve the partial ordering. Australian Computer Sci. Commun. 10:1988;56-66.
    • (1988) Australian Computer Sci. Commun. , vol.10 , pp. 56-66
    • Fidge, C.J.1
  • 4
    • 0026202534 scopus 로고
    • Logical time in distributed computing systems
    • Fidge C. J. Logical time in distributed computing systems. IEEE Computer. 24:1991;28-33.
    • (1991) IEEE Computer , vol.24 , pp. 28-33
    • Fidge, C.J.1
  • 7
    • 0017996760 scopus 로고
    • Time, clocks, and the ordering of events in a distributed system
    • Lamport L. Time, clocks, and the ordering of events in a distributed system. Commun. ACM. 21:1978;558-565.
    • (1978) Commun. ACM , vol.21 , pp. 558-565
    • Lamport, L.1
  • 8
    • 0003055324 scopus 로고
    • Virtual time and global states of distributed systems
    • Mattern F. Virtual time and global states of distributed systems. Parallel and Distributed Algorithms. 1989;215-226.
    • (1989) Parallel and Distributed Algorithms , pp. 215-226
    • Mattern, F.1
  • 9
    • 0001167874 scopus 로고
    • Efficient algorithms for distributed snapshots and global virtual time approximation
    • Mattern F. Efficient algorithms for distributed snapshots and global virtual time approximation. J. Distributed Parallel Computing. 18:1993;423-434.
    • (1993) J. Distributed Parallel Computing , vol.18 , pp. 423-434
    • Mattern, F.1
  • 11
    • 0031124940 scopus 로고    scopus 로고
    • Complete process recovery: Using vector time to handle multiple failures in distributed systems
    • Richard III G. G., Singhal M. Complete process recovery: Using vector time to handle multiple failures in distributed systems. IEEE Concurrency. 5:1997;50-59.
    • (1997) IEEE Concurrency , vol.5 , pp. 50-59
    • Richard G.G. III1    Singhal, M.2
  • 15
    • 12244279838 scopus 로고
    • Detecting causal relationships in distributed computations: In search of the holy grail
    • Schwarz R., Mattern F. Detecting causal relationships in distributed computations: In search of the holy grail. Distributed Computing. 7:1994;149-174.
    • (1994) Distributed Computing , vol.7 , pp. 149-174
    • Schwarz, R.1    Mattern, F.2


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