LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 250-252 of 486

    • A Simple and Efficient Randomized Byzantine Agreement Algorithm 

      Chor, Benny; Coan, Brian A. (1984-08)
      A new randomized Byantine agreement algorithm is presented. This algorithm operates in a synchronous systems of n processors, at most t of which can fail. The algorithm reaches agreement in O(t/log n) expected rounds and ...

    • A New Fault-tolerant Algorithm for Clock Sychronization 

      Lundelius, Jennifer; Lynch, Nancy A. (1984-07)
      We describe a new fault-tolerant algorithm for solving a variant of Lamport's clock synchronization problem. The algorithm is designed for a system of distributed processes that communicate by sending messages. Each process ...

    • Software for Interactive On-line Conferences 

      Sarin, Sunil K.; Greif, Irene (1984-07)
      A layered architecture for the implementation of real-time conferences is presented. In a real-time conference a group of users, each at his or her own workstation, share identical views of on-line application information. ...