• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.633-639
• /
• 2004

The performance of optimistic concurrency control schemes which are generally used for Mobile computing is very sensitive to the transaction abort rate. Even if the abort probability can be reduced by back-shifting the timestamp from the time of requesting a commit, some transactions continuously perform unnecessary operations after the transactions accessed write-write conflicting data. In this paper, we propose an optimistic protocol that can abort the transactions during the execution phase by using the write notification approach. The proposed protocol enhances the performance of the optimistic concurrency control by reducing the unnecessary operations. In addition, we present a simulation study that compares our schemes with the timestamp based certification scheme. This study shows that our scheme outperforms the timestamp based certification scheme.

• International Journal of Computer Science & Network Security
• /
• v.21 no.7
• /
• pp.331-340
• /
• 2021

The Internet of Things (IoT) is a rapidly growing physical network that depends on objects, vehicles, sensors, and smart devices. IoT has recently become an important research topic as it autonomously acquires, integrates, communicates, and shares data directly across each other. The centralized architecture of IoT makes it complex to concurrently access control them and presents a new set of technological limitations when trying to manage them globally. This paper proposes a new decentralized access control architecture to manage IoT devices using blockchain, that proposes a solution to concurrency management problems and enhances resource locking to reduce the transaction conflict and avoids deadlock problems. In addition, the proposed algorithm improves performance using a fully distributed access control system for IoT based on blockchain technology. Finally, a performance comparison is provided between the proposed solution and the existing access management solutions in IoT. Deadlock detection is evaluated with the latency of requesting in order to examine various configurations of our solution for increasing scalability. The main goal of the proposed solution is concurrency problem avoidance in decentralized access control management for IoT devices.

• The KIPS Transactions:PartD
• /
• v.8D no.1
• /
• pp.10-23
• /
• 2001

Transactions in real-time active databases have the notion of activeness where transactions are generated by external effects and another transaction. In this paper, we propose the multi version concurrency control algorithm for real-time active transactions. A real-time active transaction has a timing constraint in the form of a deadline until which the user wants to complete the transaction, and is characterized by triggering relationships which mean that association between a transaction that triggers the execution of another transaction and the triggered transaction. The triggering relationship is an important factor to resolve data conflicts among real-time active transactions. The proposed concurrency control mechanism resolves data conflicts by considering triggering relationships between conflicting transactions as well as priorities and precedence relationships. The conflict resolution mechanism considers association types of the triggering relationship such as abort and commit dependency, and then resolves data conflicts in favor of higher priority transactions. We also present the experimental results of our algorithm comparing other real-time active concurrency control algorithms.

• The Journal of Korean Association of Computer Education
• /
• v.11 no.4
• /
• pp.71-83
• /
• 2008

The recent advances of the information technology have motivated lots of research efforts to develop new computer-aided teaching and learning methodologies on various computer science topics, such as data structures, operating system, computer networks, and computer architecture. However, there have been only few studies to educate the database subject although it is one of the most important topics in the computer science. Specifically, among the various issues in the database subject, a learner often suffers to understand the mechanism of the concurrency control and recovery of database transaction in the database because it highly interacts with other functions in the database. Obviously, an intelligent visualization tool can help a learner to understand the process of the concurrency control and the recovery of database transaction. The purpose of this study is to develop an efficient visualization tool which can help users understand the two phase locking protocol (2PLP)-based concurrency control. Specifically, this visualization tool is designed to encourage a users' participation and raise their interest by visualizing the process of transactions and allowing users to specify and manipulate their own transactions.

• Journal of Internet Computing and Services
• /
• v.7 no.4
• /
• pp.79-90
• /
• 2006

Data broadcasting is an efficient method for disseminating data, and is widely accepted in the database applications of mobile computing environments because of its asymmetric communication bandwidth between a server and mobile clients. This requires new types of concurrency control mechanism to support mobile transactions executed in the mobile clients, which have low-bandwidths toward the server. In this paper, we propose an OCC/DTA (Optimistic Concurrency Control with Dynamic Time-stamp Adjustment) protocol that can be efficiently adapted to mobile computing environments. The protocol reduces communication overhead by using client-side validation procedure and enhances transaction throughput by adjusting serialization order without violating transaction semantics. We show that the proposed protocol satisfies data consistency requirements, and simulate that this protocol can improve the performance of mobile transactions in data broadcasting environments.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.2889-2899
• /
• 1999

To maintain the traditional notion of global serializability in multidatabase systems has been recognized as one of difficult problems due to the autonomy of participating local database systems. In this paper, we propose a global concurrency control algorithm based on the relaxed concurrency control criterion in distributed MDBs, which can be applied to applications in which the database integration has no effect on the integrity constraints. In the proposed algorithm, the process to determine whether a global transaction can be executed or not consists of intra-validation phase and inter-validation phase.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.439-446
• /
• 2003

A crucial limitation in environments where data is broadcast to very large client populations is the low bandwidth available for clients to communicate with servers. Many advanced applications are developed in mobile computing environments, but conventional concurrency controls are not suitable because of the low bandwidth of wireless network. In this paper, we propose a new optimistic concurrency control protocol for mobile transactions. In this protocol, mobile read-only transactions can be completed locally at the clients without additional communication, only mobile update transactions are sent to the server for global validation. Our protocol reduces unnecessary aborts occurred in the previous study using only conflict information. In addition to, our algorithm can detect and resolve non-serializable execution using by data table maintained in a server.

• International Journal of Contents
• /
• v.12 no.1
• /
• pp.60-64
• /
• 2016

As new applications of cloud data management system (CDMS) such as online games, cooperation edit, social network, and so on, are increasing, transaction processing capabilities for CDMS are required. Several transaction processing methods for cloud data management system (CDMS) have been proposed. However, existing transaction processing methods have some problems. Some of them provide limited transaction processing capabilities. Some of them are hard to be integrated with existing CDMSs. In this paper, we proposed a new concurrency control method to support transaction processing capability for CDMS to solve these problems. The proposed method was designed and implemented based on Spark, an in-memory distributed processing framework. It uses RDD (Resilient Distributed Dataset) model to provide fault tolerant to data in the main memory. In our proposed method, database stored in CDMS is loaded to main memory managed by Spark. The loaded data set is then transformed to RDD. In addition, we proposed a multi-version concurrency control method through immutable characteristics of RDD. Finally, we performed experiments to show the feasibility of the proposed method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.356-363
• /
• 2002

Transactions in real-time active databases have the notion of activeness where transactions are generated by external effects and another transaction. In this paper, we improve the real -time active concurrency control algorithm by applying Thomas' write rule and considering relationship between transactions fired by active rules. We also present the experimental results of our algorithm comparing other real-time active concurrency control algorithms. The experimental results show that our algorithm has superior performance with respect to the raio of transactions satisfying deadline.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.131-143
• /
• 2006

The rapid growth of mobile communication technology has provided the expansion of mobile internet services, particularly mobile realtime transaction takes much weight among mobile fields. Current mobile transaction service has serious problems which check its development, such as low bandwidths, hand over, expensive charge system, and low response time. but, There is an increasing demand for various mobile applications to process transactions in a mobile computing fields. In mobile computing environments. A mobile host computing system demands for new concurrency control method to use the bandwidth efficiently, to improve the bottleneck and the response time of transactions. This study suggests about an efficient concurrency control in a mobile computing environment. Concurrency control method in existing method uses two phases locking method. In this method, Many clients can't use the same segment simultaneously, and so useless waiting time increases. The characteristic of this proposed method unlike existing one, Enable the transaction approaching different data in the same segment to minimize the useless waiting time by permitting segments, and therefore improves the coexistence of system. Also, It shows the algorithm of the proposed concurrence control method.