Now showing items 7-12 of 12

    • Low Cost Management of Replicated Data 

      Joseph, Thomas A. (Cornell University, 1985-11)
    • Low Cost Management of Replicated Data in Fault-Tolerant Distributed Systems 

      Birman, Kenneth P.; Joseph, Thomas A. (Cornell University, 1984-10)
      Many distributed systems replicate data for fault tolerance or availability. In such systems, a logical update on a data item results in a physical update on a number of copies. The synchronization and communication ...
    • An Overview of the Isis Project 

      Birman, Kenneth P.; Abbadi, Amr El; Dietrich, Wally; Joseph, Thomas A.; Raeuchle, Thomas (Cornell University, 1984-10)
      The goal of the ISIS projest is to provide a high-level support for fault-tolerant distributed computing by automatically replicating data and code. The extent to which information is replicated and the physical location ...
    • Programming with Shared Bulletin Boards in Asynchronus Distributed Systems 

      Birman, Kenneth P.; Joseph, Thomas A.; Schmuck, Frank B.; Stephenson, Patrick (Cornell University, 1986-08)
      We consider loosely coupled distributed computing systems in which processes interact through shared resources, which are modeled as bulletin boards. The first part of the paper formalizes the notion of consistent behavior ...
    • Reliable Communication in the Presence of Failures 

      Birman, Kenneth P.; Joseph, Thomas A. (Cornell University, 1985-07)
      We report on the design and correctness of a communication facility for a distributed computer system. The facility provides support for fault tolerant process groups in the form of a family of reliable multicast protocols ...
    • State Machines and Assertions (An Integrated Approach to Modelingand Verification of Distributed Systems 

      Joseph, Thomas A.; Raeuchle, Thomas; Toueg, Sam (Cornell University, 1985-11)
      This paper describes a methodology for modeling and verifying protocols for asynchronous message passing systems. It combines the techniques of finite state analysis and axiomatic verification. It overcomes the problem ...