Publications
Search

Publications :: Search

A LIGHT - WEIGHT DISTRIBUTED SYSTEM FOR THE PROCESSING OF REPLICATED COUNTER - LIKE OBJECTS

Show publication

On this page you see the details of the selected publication.

    Publication properties
    Title: A LIGHT - WEIGHT DISTRIBUTED SYSTEM FOR THE PROCESSING OF REPLICATED COUNTER - LIKE OBJECTS
    Rating: (not rated yet)
    Discussion: 0 comments
    Date: 6 / 2013
    Publication type: Journal article
    Authors:
    No. First name Last name Show
    1. Joel M. Crichlow
    2. Stephen J. Hartley
    3. Michael Hosein
    Bookmark:

    The following keywords have been assigned to this publication so far. If you have logged in, you can tag this publication with additional keywords.

    Keywords
    1. Availability,
    2. Distributed System
    3. Replication

    If you log in you can tag this publication with additional keywords

    A publication can refer to another publication (outgoing references) or it can be referred to by other publications (incoming references).

    Incoming References
    No incoming references have been assigned to this publication yet.
    Outgoing References
    No outgoing references have been assigned to this publication yet.

    If you log in you can add references to other publications

    A publication can be assigned to a conference, a journal or a school.

    Venue
    This publication has not been assigned to a venue.

    Abstract

    In order to increase availability in a distributed system some or all of the data items are replicated and stored at separate sites. This is an issue of key concern especially since there is such a proliferation of wireless technologies and mobile users. However, the concurrent processing of transactions at separa te sites can g enerate inconsistencies in the stored information. We have built a distributed service that manages updates to widely deployed counter - like replicas. There are many heavy - weight distributed systems targeting large information critical applications. Our sys tem is intentionally, relatively light - weight and useful for the somewhat reduced information critical applications. The service is built on our distributed concurrency control scheme which combines optimism and pessimism in the processing of transactions. The service allows a transaction to be processed immediately (optimistically) at any individual replica as long as the transaction satisfies a cost bound. All transactions are also proc essed in a concurrent pessimistic manner to ensure mutual consistency.