A Low-Latency Non-Blocking Atomic Commitment

Conference Paper · October 2001with3 Reads
    • "Another important problem is that solutions relying on pure partial replication will likely need to resort to distributed atomic commitment that is the current bottleneck of distributed information systems. Recent protocols for high performance distributed atomic commitment such as the commit server [29] can be a solution to leverage partial replication to boost the scalability of database replication. The use of group communication might hamper the scalability. "
    [Show abstract] [Hide abstract] ABSTRACT: Grid technologies have matured over the last few years. This level of maturity is especially true in the field of scientific computing in which Grids have become the main infrastructure for scientific problem solving. Due to its success, the use of Grid technology rapidly finds its introduction into other fields. One of such fields is enterprise computing in which Grids are seen as a new architecture for data centers. In this paper, we describe the vision of enterprise Grids, current scientific achievements that will leverage this vision, and challenges ahead.
    Full-text · Article · Jan 2007
    • "It has been suggested in [31] that lower bounds can be circumvented by using optimistic techniques. Paper [26] shows that the latency of nonblocking atomic commit can be effectively reduced to two rounds by using an optimistic approach (by effectively we mean that aborts are extremely unlikely). This commit protocol can be easily integrated into the MTRDS algorithm in order to provide a higher level of availability without an increased latency. "
    [Show abstract] [Hide abstract] ABSTRACT: Middleware platforms are becoming very popular among system developers. Due to its popularity, there is an increasing demand for dependable middleware support. In the past few years several research efforts have concentrated in augmenting the dependability of middle-ware infrastructures which have led to the definition of the FT-Corba specification. Active replication is one of the main techniques that have been used to achieve some of the required dependability attributes such as high-availability. This kind of replication requires determin-istic replicas to behave as a state machine what has been traditionally achieved by restricting replicas to be single-threaded. Unfortunately, single-threading results too restrictive for mid-dleware servers, especially transactional ones, where it is not admissible to process requests sequentially. In this paper, we show how it is possible to remove this restriction. We present a deterministic scheduling algorithm for multithreaded replicas in a transactional framework. Determinism of multithreaded replicas is achieved with a combination of reliable total order multicast and a deterministic scheduler. The former guarantees that all the replicas see the external events in the same order. The latter, ensures that all threads are scheduled in the same way at all replicas. One of the novelties of the approach is that determinism is achieved without resorting to inter-replica communication. Additionally, the paper also addresses how to perform online recovery while maintaining replica determinism in order to keep a high level of availability. £ This paper consolidates results from the papers [1] and [2].
    Full-text · Article · Jan 2002 · Journal of Grid Computing
  • [Show abstract] [Hide abstract] ABSTRACT: With the advent of cheaper hardware and Internet, distributed systems have become pervasive. Due to this increasing dependability on distributed systems, there is a growing need to guarantee the availability and consistency of services in the presence of component failures and network partitions. However, a distributed systems without fault-tolerance is more vulnerable than its centralized version. Fault-tolerance plays a crucial role to guarantee the availability and consistency of the system in the advent of failures and network partitions. Traditional fault- tolerant distributed systems have adopted ad-hoc approaches and based on monolithic architectures. These monolithic systems prevent the reuse of its components and are difficult to maintain. The goal of this project is to propose a new approach for building fault-tolerant distributed systems, a component-based architecture in which components devoted to different aspects of fault-tolerance can be woven together to achieve the desired degree of dependability.
    Article · · Journal of Grid Computing
Show more