• 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.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1687-1696
• /
• 1996

Most of the main memory database systems use two-phase locking(2PL)for concurrency control. The 2PL method is preferred over other methods for concurrency control because of its simplicity and common usage. However, conventional concurrency control solution will function poorly when the data are memory resident. In this paper, we propose a new optimistic concurrency control protocol for a main memory database system. In our proposed protocol, transaction conflict information is used in validation phase to improve data conflict resolution decisions. Our experiments show that the proposed protocol performs better than 2PL in terms of throughput for main memory database system enshrinements.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.185-194
• /
• 2002

Most of mobile computing systems allow mostly read-only transactions from mobile clients for retrieving various types of Information such as stock data, traffic information and news updates. Since previous concurrence control protocols, however, do not consider such a particular characteristics, the performance degradation occurs when previous schemes are applied to the broadcast environment. In this paper, we propose OCC/UTF(Optimistic Concurrence Control with Update Transaction First) that is most appropriate for broadcast environment. OCC/UTF lets a query transaction, that has already read the data item which was invalidated by update transaction, read again the same data item without the abort of the query transaction due to non-serializability. Therefore, serializable order is maintained and the query transaction is committed safely regardless of commitment of update transactions. In OCC/UTF, Clients need not require server to commit their query transactions. Because of broadcasting the validation reports including values updated recently to clients, it reduces the overhead of requesting recent values from the server and the server need not also re-broadcast the newest values. As a result, OCC/UTF makes full use of the asymmetric bandwidth. It can also improve transaction throughput by increasing the commit ratio of query transactions as much as possible.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.8
• /
• pp.1153-1160
• /
• 2002

So far, the main applications of mobile client are querying data. However, we need a new mechanism to update data at a mobile client as mobile systems are advanced and extended. So, we present a optimistic concurrency control to schedule mobile transactions may include update operations.'rho read-only transactions can be terminated without sending information to a server, and update transactions are terminated by validating at a server. In our method, we can reduce the additional aborts by using a timestamp ordering and serialization graph test mechanism rather than using only conflict information between concurrent transactions.

• Journal of Advanced Navigation Technology
• /
• v.12 no.4
• /
• pp.357-365
• /
• 2008

Broadcast is a efficient interactive method between a server and mobile clients via wireless channel and broadcast environments are incarnating as various applications. Most studies have been proposed in broadcast environments deal with read-only mobile transactions, many applications are emerging recently that need to manage the update transactions at mobile clients. So we propose a concurrency control for mobile transactions consisted mainly of update operations in broadcast environments. As an optimistic approach is applied for scheduling update transactions, repetitive aborts of update transactions are occur due to conflict between transactions. To solve this problem update transactions must have been executed with distributed manner, but unnecessary aborts are occur as well because of continuous restart. Thus, in this paper we propose a method that transactions are executed distributed manner and can avoid unnecessary aborts of update transactions. Proposed method has no unnecessary uplink and can save resources of mobile client.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.6
• /
• pp.623-634
• /
• 2003

In this paper, we propose a collaborative multimedia authoring system. Our authoring system represents a multimedia presentation in a 3D coordinate system. One axis represents the traditional timeline information (T-zone), and the other two axes represent spatial coordinates (XY-zone). Our system represents a visual media objects as a 3D parallelepipeds and audio media objects as cylinders. This interface allows for simultaneous authoring and manipulation of both the temporal and the spatial aspects of a presentation. Using our system, users can design multimedia presentations collaboratively in the unified spatio-temporal space while freely traversing the spatial domain and the temporal domain without changing the context of authoring. In addition, we suggest an efficient mechanism of concurrency control for shared objects generated by our collaborative writing system. The mechanism is mainly based on the user awareness, the multiple versions, and the access permission of shared objects. Our concurrency control mechanism is designed to keep data consistency by minimizing the collision due to the delay or the failure of network communication and to allow maximum responsiveness for users using optimistic concurrency control. Also, the mechanism maximize the responsiveness by refining the locking granularity and applying different concurrency control mechanisms to each.

• KSCI Review
• /
• v.1 no.2
• /
• pp.95-107
• /
• 1995

The concurrency control can be critical to the performance of transaction processing systems. Conventional locking takes the blocking phenomenon, where waiting transactions continue to hold locks and block other transactions from progressing. The proposed scheme reduces the blocking probability by deferring the blocking behavior of transactions to the later stages of their execution. The transaction execution can be divided into a nonblocking phase where transactions wait for locks but do not block other transactions and a blocking phase as in conventional locking. However data accessed during the nonblocking phase can lead to transaction abort. By properly balancing the blocking and abort effects, the proposed scheme can lead to better performance than either the conventional locking or the optimistic concurrency control(OCC) scheme at all data and resource contention levels.

• The KIPS Transactions:PartD
• /
• v.11D no.6
• /
• pp.1213-1220
• /
• 2004

With the significant advances in mobile computing technology, there is an increasing demand for various mobile applications to process trans-actions in a real-time. When remote data access is considered in a mobile environment, data access delay becomes one of the most serious problems in meeting the deadline of real-time transaction. The mobile real-time transaction should be assured not only correctness of result of trans-action but also completion time of transaction. In this paper, we propose an optimistic concurrency control method to solve conflict among mobile real-time transactions. It minimizes influence on the cascade abort and delay of transactions that occur by disconnection and hand over in a mobile environment.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.140-149
• /
• 2004

Data broadcast has received much attention as a very efficient method for disseminating data items in mobile environment with large number of mobile clients. In this approach, a database server periodically and continuously broadcasts data items through wireless channels and clients perform read-only transactions by accessing necessary data items from the air. While broadcasting, the server must also process update transactions on the database, which raises an obstacle for client's accessing consistent data. In this research, we propose a new algorithm SCDSC(Serialization Checking with DirtySet on Commit) which is an alternative for solving the concurrency control problem efficiently. The SCDSC is a kind of optimistic concurrency control in that a client checks the consistency of data using a DirtySet as a part of data broadcast when it commits its transaction. In each broadcast cycle, the server updates and disseminates the DirtySet with newly changed data items for last few cycles in the sliding window approach. We perform an analysis and a simulation study to evaluate the performance of our SCDSC algorithm in terms of data consistency and data currency.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1418-1432
• /
• 1996

In addition t improved availability, replication of data can enhance performance of distributed real-time transaction processing system by allowing transactions initiated at multiple node to be processed concurrently. To satisfy both the consistency and real-time constraints, it is necessary to integrate concurrency control and atomic commitment protocols with time-driven scheduling methods. blocking caused by existing concurrency control protocols is incompatible with time-driven scheduling because they cannot schedule transactions to meet given deadlines. To maintain consistency of replicated data and to provide a high degree of schedulability and predictability , the proposed time-driven scheduling methods integrate optimistic concurrency control protocols that minimize the duration of blocking and produce the serialization by reflecting the priority transactions. The atomicity of transactions is maintained to ensure successful commitment in distributed environment. Specific time-driven scheduling techniqueare discussed, together with an analysis of the performance of this scheduling.