Atomic objects have suitable properties for realizing reliable distributed computing. Using semantic information of atomic objects can make reliable distributed computing highly concurrent. Traditional semantics based concurrency control and recovery algorithms use undo operations for recovering objects. However, it is sometimes di cult to de ne undo operations. We propose an alternative approa...

Broadcast is widely accepted as an efficient technique for disseminating data to a large number of mobile clients over a single or multiple channels. Due to the limited uplink bandwidth from mobile clients to server, conventional concurrency control methods cannot be directly applied. There has been many researches on concurrency control methods for wireless broadcast environments. However, the...

The objectives of multidatabase transaction management are to avoid the inconsistent retrievals and to preserve the global consistency in the presence of multidatabase updates. In order to maintain the global consistency, the MDBS must ensure the global integrity constraints as well as the global serializability of transactions. The global transaction manager must have the responsibility for gl...

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 separate sites can generate inconsistencies in the stored information. Several replica c...

Over the past few years, cloud computing and the growth of global large scale computing systems have led to applications which require data management across multiple datacenters. Initially the models provided single row level transactions with eventual consistency. Although protocols based on these models provide high availability, they are not ideal for applications needing a consistent view ...

This paper describes the design and implementation of a distributed file repository that supports data sharing in a variable connected environment. Our design is based on the observation that it is difficult to make a clean cut between the various choices for important issues like consistency and concurrency control when the system is designed. Hence, we make it possible for the user to choose ...

Distributed locking is commonly adopted for performing concurrency control in distributed systems. It incorporates additional steps for handling deadlocks. This activity is carried out by methods based on wait-for-graphs or probes. The present study examines detection of conflicts based on enhanced local processing for distributed concurrency control. In the proposed “edge detection” approach, ...

Inverted files are frequently used as index data structures for very large text databases. Most applications of this data structure are for read-only query operations. However, the problem of introducing update operations has deserved little attention so far and yet it has important applications. In this paper we propose an optimistic concurrency control algorithm devised to handle mixes of upd...

Hyder supports reads and writes on indexed records within classical multi-step transactions. It is designed to run on a cluster of servers that have shared access to a large pool of networkaddressable raw flash chips. The flash chips store the indexed records as a multiversion log-structured database. Log-structuring leverages the high random I/O rate of flash and automatically wear-levels it. ...

Among the concurrency control techniques proposed for transactional clients in broadcast environments, BCC-TI [6] has been demonstrated to have better performance than a simple adaptation of optimistic concurrency control with forward validation. Our work adapts BCC-TI to enforce quasi-consistency [3], and introduces caching. Through simulation experiments, we demonstrate the workload character...