메뉴 건너뛰기




Volumn 2, Issue 3, 1987, Pages 161-175

Algorithms for distributed termination detection

Author keywords

Asynchronous communication systems; Atomic model of computation; Communication deadlock detection; Decentralized control; Diffusing computation; Distributed programming; Distributed termination; Global quiescence; Global snapshots; Termination detection

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

EID: 0023593920     PISSN: 01782770     EISSN: 14320452     Source Type: Journal    
DOI: 10.1007/BF01782776     Document Type: Article
Times cited : (198)

References (62)
  • 13
    • 84936591960 scopus 로고    scopus 로고
    • Cohen S, Lehman D (1982) Dynamic systems and their distributed termination. Proc ACM SIGACT-SIGOPS Symp Principles Distributed Comput, Ottawa, pp 29–33
  • 21
    • 84936585570 scopus 로고
    • A termination detector for static and dynamic distributed systems with asynchronous non-first-in-first-out communication
    • L., Kott, LNCS, 226, Springer, Berlin Heidelberg New York
    • (1986) 13th Coll Automata, Lang and Programming , pp. 196-205
    • Lai, T-H1
  • 22
    • 0017996760 scopus 로고
    • Time, clock and the ordering of events in a distributed system
    • (1978) Commun ACM , vol.21 , Issue.7 , pp. 558-565
    • Lamport, L.1
  • 25
    • 84936591961 scopus 로고    scopus 로고
    • Lozinskii EL (1985) A remark on distributed termination. Proc 5th Internat Conf on Distributed Computing Systems, Denver, pp 416–419
  • 29
    • 84936591964 scopus 로고    scopus 로고
    • Misra J (1983) Detecting termination of distributed computations using markers. Proc 2nd Ann ACM Symp Principles Distributed Comput, Montreal, Quebec, pp 290–294
  • 31
    • 0020789582 scopus 로고
    • A distributed solution of the distributed termination problem
    • (1983) Inf Process Lett , vol.17 , Issue.1 , pp. 43-46
    • Rana, S.P.1
  • 32
    • 84936679136 scopus 로고
    • Distributed termination in CSP: Symmetric solutions with minimal storage
    • K., Mehlhorn, LNCS, 182, Springer, Berlin Heidelberg New York
    • (1985) Proc STACS 85 , pp. 267-278
    • Richier, J-L1
  • 33
    • 84936591965 scopus 로고
    • Model and complexity of termination for distributed computations
    • J., Gruska, B., Rovan, J., Wiedermann, LNCS, 233, Springer, Berlin Heidelberg New York
    • (1986) Proc Math Found Comp Sc 86 , pp. 564-572
    • Rozoy, B.1
  • 49
    • 0023312640 scopus 로고
    • A distributed algorithm for distributed termination
    • It is not the ‘classical’ distributed termination problem: processes are never reactivated. See also Tel G, Van Leeuwen J (1987) Comments on “A distributed algorithm for distributed termination”. Inf Process Lett 25:349
    • (1987) Inf Process Lett , vol.24 , pp. 293-297
    • Hazari, C.1    Zedan, H.2
  • 50
    • 84936591952 scopus 로고    scopus 로고
    • Helary J-M, Jard C, Plouzeau N, Raynal M (1987) Detection of stable properties in distributed applications. Proc 6th ACM Symp Principles Distributed Comput
  • 56
    • 84936545441 scopus 로고
    • High level petri nets and distributed termination
    • K., Voss, H.J., Genrich, G., Rozenberg, Springer, Berlin Heidelberg New York
    • (1987) Concurrency and nets , pp. 349-362
    • Müller, H.1
  • 62
    • 0022985226 scopus 로고
    • Programmtransformationen zur Ende-Erkennung bei verteilten Berechnungen
    • (1986) Informationstechnik , vol.28 , Issue.4 , pp. 204-213
    • Zöbel, D.1


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