Efficient at-most-once messages based on synchronized clocks

被引：1
|
作者：
机构：
来源：
| 1600年 / 20期
关键词：
D O I：
10.1145/99517.99530
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] EFFICIENT AT-MOST-ONCE MESSAGES BASED ON SYNCHRONIZED CLOCKS
    LISKOV, B
    SHRIRA, L
    WROCLAWSKI, J
    ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1991, 9 (02): : 125 - 142
  • [2] The Strong At-Most-Once Problem
    Kentros, Sotirios
    Kari, Chadi
    Kiayias, Aggelos
    DISTRIBUTED COMPUTING, DISC 2012, 2012, 7611 : 386 - 400
  • [3] At-Most-Once Semantics in Asynchronous Shared Memory
    Kentros, Sotirios
    Kiayias, Aggelos
    Nicolaou, Nicolas
    Shvartsman, Alexander A.
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2009, 5805 : 258 - 273
  • [4] CORRECTNESS OF AT-MOST-ONCE MESSAGE DELIVERY PROTOCOLS
    LAMPSON, BW
    LYNCH, NA
    SOGAARDANDERSEN, JF
    FORMAL DESCRIPTION TECHNIQUES, VI, 1994, 22 : 385 - 400
  • [5] Solving the at-most-once problem with nearly optimal effectiveness
    Kentros, Sotirios
    Kiayias, Aggelos
    THEORETICAL COMPUTER SCIENCE, 2013, 496 : 69 - 88
  • [6] Brief Announcement: At-Most-Once Semantics in Asynchronous Shared Memory
    Kentros, Sotirios
    Kiayias, Aggelos
    Nicolaou, Nicolas
    Shvartsman, Alexander A.
    SPAA'09: PROCEEDINGS OF THE TWENTY-FIRST ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2009, : 43 - 44
  • [7] Using adaptive timeouts to achieve at-most-once message delivery
    Chaudhuri, S
    Coan, BA
    Welch, JL
    DISTRIBUTED COMPUTING, 1995, 9 (03) : 109 - 117
  • [8] USING ADAPTIVE TIMEOUTS TO ACHIEVE AT-MOST-ONCE MESSAGE DELIVERY
    CHAUDHURI, S
    COAN, BA
    WELCH, JL
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 579 : 150 - 166
  • [9] AT-MOST-ONCE MESSAGE DELIVERY - A CASE-STUDY IN ALGORITHM VERIFICATION
    LAMPSON, B
    LYNCH, N
    SOGAARDANDERSEN, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 630 : 317 - 324
  • [10] Brief Announcement: Solving the At-Most-Once Problem with Nearly Optimal Effectiveness [Extended Abstract]
    Kentros, Sotirios
    Kiayias, Aggelos
    PODC 11: PROCEEDINGS OF THE 2011 ACM SYMPOSIUM PRINCIPLES OF DISTRIBUTED COMPUTING, 2011, : 229 - 230
12345