CIRS: A State-Conscious Concurrency Control Protocol for Replicated Real-Time Databases
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 1
Abstract
Replication [5] is the technique of using multiple copies of a server or a resource for better availability and erformance.Each copy is called a replica. The main goal of replication is to improve availability, since a service is available even if some of its replicas are not. This helps mission critical services, such as many financial systems or reservation ystems, where even a short outage can be very disruptive and expensive.A prerequisite for realizing the banefits of replication, however, is the devlopement of high performance concurrency machenism. Current applications, such as Web-based services, electronic commerce, mobile telecommunication system, etc., are distributed in nature and manipulate time-critical databases. In order to enhance the performance and the availability of such applications, one of the main techniques is to replicate data on multiple sites of the network. Therefore, the major issue is to develop efficient replica concurrency control protocols that are able to tolerate the overload of the distributed system. In fact, if the system is not designed to handle overloads, the effects can be catastrophic and some primordial transactions of the application can miss their deadlines. In this paper we present CIRS (Concurrency control In Replicated realtime Systems) a state conscious concurrency control protocol in replicated distributed environment which is specially for firm realtime database system. CIRS mechanism uses S2PL (Static Two Phase Locking) for deadlock free environment. It also includes veto power given to a cohort after receiving PREPARE message from its coordinator. Also with some more assumptions like sending an extra message in execution phase but after completion of execution at local copy which is described later in this paper the proposed mechanism has a significant increased performance over O2PL and MIRROR in decreasing execution time of the current transaction and it also decreases the waiting time of transactions in wait queue.
Authors and Affiliations
Vishal Pathak , Ajay Pratap , Rabin Kr. Singh , Abhishek Kr. Singh
Keywords
Related Articles
- EP ID EP102740
- DOI -
- Views 105
- Downloads 0
Significance of Web 2.0 in Digital Libraries
The rapid development of Information and Communication Technologies has provided a well sophisticated environment to develop the digital libraries. A digital library is a large-scale, organized collection of complex and...
Ambient Noise Tomography of the Central India
In the recent years, earthquakes have been used in understanding the Earth. The travel times of the body waves; P and S waves, the dispersion of the group and phase velocities of the surface waves and the information der...
Energy Efficient Routing In MANET Using OLSR
Energy-efficient MANET routing protocol OSLR is widely used for routing in ad hoc networks. Residual energy of nodes play a vital role in route discovery in MANET. To support energy-efficient routing, accurate state info...
Investigation of data clustering preprocessing algorithm on independent attributes to improve the performance of CLONALG
It is a popularly held belief that preprocessing of data generally improves the classification efficiency of data mining algorithms. We study the effects of preprocess by utilizing an algorithm to cluster points in a dat...
Approaches for Managing and Analyzing Unstructured Data
Large volumes of data that will be stored and accessed in future is unstructured. The unstructured data is generated in a very fast pace and uses large storage areas. This increases the storage budget. Extracting value f...