By Topic

Proceedings Ninth Symposium on Reliable Distributed Systems

Date 9-11 Oct. 1990

Filter Results

Displaying Results 1 - 19 of 19
  • Proceedings. Ninth Symposium on Reliable Distributed Systems (Cat. No.90CH2912-4)

    Publication Year: 1990
    Request permission for commercial reuse | PDF file iconPDF (26 KB)
    Freely Available from IEEE
  • The design and implementation of a reliable distributed operating system-ROSE

    Publication Year: 1990, Page(s):2 - 11
    Cited by:  Papers (4)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (908 KB)

    ROSE, a modular distributed operating system that provides support for building reliable applications, is designed and implemented. Failure detection capabilities are provided by a failure detection server. Configuration objects can be used to capture the relationship among multiple processes that cooperate to replicate certain resources. Replicated address space (RAS) objects, whose content is ac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable broadcast for fault-tolerance on local computer networks

    Publication Year: 1990, Page(s):54 - 63
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (932 KB)

    The authors discuss the definition and design of a generic reliable communication architecture on a widely used host-independent platform, such as a local area network (LAN). Two relevant aspects are the use of nonreplicated LANs and self-checking components. The protocol is innovative, in the sense that, although clockless and running on a nonreplicated network, it displays bounded execution time... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general methodology for the system state characterization of event recognitions

    Publication Year: 1990, Page(s):175 - 184
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (884 KB)

    The authors present a methodology for the characterization of event recognitions based on the relationship between the system state at recognition time and its state when the event actually occurred. The methodology incorporates characteristics of the event and computation with a technique for collecting and organizing state information, thus providing an integrated approach to recognition charact... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Preventing state divergence in replicated distributed programs

    Publication Year: 1990, Page(s):104 - 113
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    Replicated execution of distributed programs, which provides a means of masking hardware (processor) failures in a distributed system, is discussed. Application-level entities (processes, objects) are replicated to execute on distinct processors. Such replica entities communicate by message passing. Nondeterminism within the replicas could cause messages to be processed in nonidentical order, prod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A low-cost atomic commit protocol

    Publication Year: 1990, Page(s):66 - 75
    Cited by:  Papers (11)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    The proposed coordinator log transaction execution protocol centralizes logging on a per-transaction basis and exploits piggybacking to provide the semantics of a distributed atomic commit without the associated costs. This protocol eliminates two rounds of messages (one phase) from the presumed commit protocol and dramatically reduces the number of log forces needed for distributed atomic commit.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved algorithm for the symbolic reliability analysis of networks

    Publication Year: 1990, Page(s):34 - 43
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    An efficient Boolean algebraic algorithm for the symbolic reliability and sensitivity analysis of coherent two-terminal networks with s independent components is described. The algorithm is also applicable to a fault tree model without NOT gates. The algorithm uses the concept originally proposed by A. Grnarov, L. Kleinrock, and M. Gerla (1979). After the algorithm is presented, the error... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adjudicators for diverse-redundant components

    Publication Year: 1990, Page(s):114 - 123
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    The authors define the adjudication problem, summarize the existing literature on the topic, and investigate the use of probabilistic knowledge about error/faults in the subcomponents of a fault-tolerant component to obtain good adjudication functions. They prove the existence of an optimal adjudication function, which is useful both as an upper bound on the probability of correctly adjudged obtai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of voting strategies for fault-tolerant distributed systems

    Publication Year: 1990, Page(s):136 - 145
    Cited by:  Papers (32)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    The problem of voting is studied for both the exact and inexact cases. Optimal solutions based on explicit computation of condition probabilities are given. The most commonly used strategies, i.e. majority, median, and plurality are compared quantitatively. The results show that plurality voting is the most powerful of these techniques and is, in fact, optimal for a certain class of probability di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representation and execution support for reliable robot applications

    Publication Year: 1990, Page(s):96 - 103
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    Robot applications, represented as plans, are used to outline a viewpoint that robustness needs to be emphasized in two areas: in the plan representation and in the underlying system software. Robot applications are inherently distributed, since the hardware usually comprises a set of independent actuators and sensors, with the robot programs acting as links between them. A special model of distri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using stashing to increase node autonomy in distributed file systems

    Publication Year: 1990, Page(s):12 - 21
    Cited by:  Papers (7)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    The authors present an enhancement to distributed file systems that allows the users of the system to keep local copies of important files, decreasing the dependency over file servers. Using the notions of stashing and quasi-copies, the system allows users to tune up the quality of the service they want to receive when the file server is not reachable. One of the key points of this work is the foc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal uncertainties in interactions among real-time objects

    Publication Year: 1990, Page(s):165 - 174
    Cited by:  Papers (49)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1020 KB)

    A model of a distributed real-time system which supports reasoning about the consistency and accuracy of real-time data and about the performance of real-time communication protocols is presented. The conventional object model is extended into a model of a real-time (RT-) object which incorporates a real-time clock as a mechanism for initiating an object action as a function of real time. The noti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Voting as the optimal static pessimistic scheme for managing replicated data

    Publication Year: 1990, Page(s):126 - 135
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    The problem of finding an optimal static pessimistic replica control scheme is investigated. It has been widely accepted that coteries (proposed by Garcia-Molina and Barbara) provide the most general framework for such schemes. Under such as assumption, it is demonstrated that the voting scheme is an optimal static pessimistic scheme for fully connected networks with negligible link failure rates,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound on the reliability of an n-dimensional hypercube

    Publication Year: 1990, Page(s):44 - 53
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    A recursive algorithm for computing a lower bound on the all-terminal reliability of an n-dimensional hypercube is presented. The recursive step decomposes an n-dimensional hypercube into lower dimension hypercubes that are linked together. As an illustration of the effectiveness and power of this method, a lower bound is computed on the all-terminal reliability of the 16-dimensi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed lock management in a transaction processing environment

    Publication Year: 1990, Page(s):22 - 31
    Cited by:  Papers (3)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (920 KB)

    Distributed synchronization for data sharing is discussed, and the design of a distributed lock manager for the Camelot transaction facility is presented. The lock manager is a component of a proposed implementation of data sharing in the Camelot environment. A number of experiments that demonstrate the correct operation of the lock manager are reported and its performance is described. The perfor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault tolerant distributed database system via data inference

    Publication Year: 1990, Page(s):86 - 94
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    A knowledge-gased approach for query processing during network partitioning is proposed. The approach uses available domain and summary knowledge to infer inaccessible data to answer a given query. A rule induction technique is used to extract correlated knowledge between attributes from the database contents. This knowledge is represented as rules for data inference. On the basis of a set of quer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RelaX-an extensible architecture supporting reliable distributed applications

    Publication Year: 1990, Page(s):156 - 164
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    The authors provide a description of RelaX (reliable distributed applications support on UniX), a portable and extensible system software layer on top of UNIX-like operating system kernels that supports reliable distributed applications by a generalized transaction mechanism. The transaction mechanism relieves each programmer of dealing explicitly with error recovery and concurrency control in eve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fault tolerant algorithm for distributed mutual exclusion

    Publication Year: 1990, Page(s):146 - 154
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    A fault-tolerant mutual exclusion algorithm for distributed systems is presented. The algorithm uses a distributed queue strategy and maintains alternative paths at each site to provide a high degree of fault tolerance. However, owing to these alternative paths, the algorithm must use reverse messages to avoid the occurrence of directed cycles, which may form when the direction of edges is reverse... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptability experiments in the RAID distributed database system

    Publication Year: 1990, Page(s):76 - 85
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    A series of experiments is being conducted on the RAID distributed database system to study the performance and reliability implications of providing static and dynamic adaptability. The authors' studies of the cost of their adaptable implementation were conducted in the context of the concurrency controller and the replication controller. It is shown that adaptable implementations can be provided... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.