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

• Journal of KIISE:Databases
• /
• v.37 no.3
• /
• pp.171-175
• /
• 2010

This paper analyzes the tag data inconsistency problem caused by incomplete execution of the tag access operation to the RFID tag's memory and proposes a protocol to control consistent tag data accesses with finalizing the incomplete operation. Passive RFID tag cannot guarantee complete execution of the tag access operations because of uncertainty and unexpected disconnection of RF communications. This leads to the tag data inconsistency problem. To handle this, we propose a concurrency control protocol which defines incomplete tag operations as continuous queries and monitors the tags're-observation continuously. The protocol finalizes the incomplete operation when the tag is re-observed while it blocks inconsistent data accesses from other operations. We justify the proposed protocol by analyzing the completeness and consistency. The experiments show that the protocol shows better performance than the traditional lock-based concurrency control protocol.

• Journal of Korean Society for Geospatial Information Science
• /
• v.5 no.2 s.10
• /
• pp.193-205
• /
• 1997

It is required for multi-users to share massive mapping data effectively that distributed data model in the Client-Server environment is developed for the replication consistency. The existing model is not effective to the long transaction just like a mapping system, since it does not account lot consistency between GUI screen and database replications even though it emphasizes on the replication consistency. The performance of concurrency control is very important for those long transactions, especially the mapping systems. This model is to support consistency between GUI screen and replicas using display locks. It suggests consistency model improving process performance by modifying memory consistency model and optimistic concurrency control for mapping data's characteristics.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.257-271
• /
• 2008

Wireless broadcast environments has character that a number of mobile client can receive data streaming from central server no matter how they are so many. Because it is asymmetric bandwidth in that uplink and downlink bandwidth are different. This advantage helps wireless broadcast environments is used in many applications. These applications work almost read operation and need control concurrency using transaction unit. Previous concurrency control scheme in single channel is not adapted in multi channel environments because consistency of data are broken when a mobile client tunes in a broadcast cycle in a channel and then move into another channel and listen to different broadcast cycle with already accessed broadcast cycle. In this paper, we propose concurrency control for read-only mobile transactions in multiple wireless broadcast channel. First of all, we adapt index and data dedicated channel and propose LBCPC(Longest Broadcast Cycle Per Channel) as new unit of consistency. In index dedicated channel, it is repeatedly broadcasted data in same BCPC(Broadcast Cycle Per Channel) until LBCPC. And mobile transaction executes validation using control information every LBCPC. As a result, consistency of data is kept and average response time is shorter than one in single channel because waiting time for restart reduces. And as control information is broadcasted more frequently than in single channel, it is guaranteed currency about data accessed by transaction. Finally, according to the simulation result, we verify performance of our scheme in multi channel as comparing average response time with single channel.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 1997.10b
• /
• pp.215-227
• /
• 1997

데이터베이스 공유 시스템(database sharing system)은 고성능의 트랜잭션 처리를 위한 시스템으로서, 별도의 메모리와 운영체제 그리고 데이터베이스 관리 시스템(DBMS)을 가진 처리 노드와 고속의 통신 시스템으로 구성된다. 공유 데이터는 다수의 DBMS에 의해 동시에 캐싱 될 수 있으므로 처리노드 간의 일관성 유지를 위해 동시성 제어(concurrency control)와 일관성 제어(coherency control) 기법이 필요하다. 본 연구에서는 동적 PCA 관 리 방식과 이를 위한 버퍼 무효화 기법을 제안한다. 제안된 동적 PCA 관리 방식은 시스템 환경의 변화에 대한 적응성을 제공한다. 또한 공유 데이터의 일관성 유지를 위한 세 가지의 버퍼 무효화 기법은 디스크 I/O 오버헤드와 메시지 전송량을 감소함으로써 동적 PCA 관리 를 효율적으로 지원할 수 있다.

• Journal of KIISE:Software and Applications
• /
• v.26 no.6
• /
• pp.735-751
• /
• 1999

클라이언트-서버 DBMS에 대한 기존의 연구는 클라이언트 데이터 캐슁이 캐쉬 일관성 유지에 드는 오버헤드에도 불구하고 시스템의 성능향상에 유용함을 보여주었다 본 논문에서는 시간적 제약을 가지는 실시간 트랜잭션을 처리하는데 있어서도 클라이언트 데이터 캐슁이 실시간 트랜잭션의 마감시간 충족률을 높이는데 유용하다는 것을 보였다. 기존실시간 데이터베이스 시스템에서 동시성 제어 기법과 실시간 트랜잭션 스케쥴링 기법을 통합한 것처럼 , 캐쉬 일관성 유지 및 동시성 제어 기법과 실시간 트랜잭션 스케쥴링 기법을 통합한 낙관적 알고리즘을 제시하고 클라이너트 데이터 캐슁을 지원하지 않는 경우와 그 성능을 비교하였다. 성능 평가 결과데이타의 지역성이 낮은 작업부하에서는 , 클라이언트 캐쉬의 이용으로 인해 마감시간을 어긴 실시간 트랜잭션의 비율 감소가 크지 않았지만(10%이하), 데이터의 지역성이 높은 작업부하에서는 그 감소폭이 컸다. HOTCOLD 작업부하의 경우 클라이언트의 수가 50, 트랜잭션의 데이터 변경률이 20% 일 때 마감시간을 어긴 실시간 트랜잭션의 비율이 약 47%감소하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.205-207
• /
• 1998

ECA 규칙에 근거한 능동성 개념은 실시간 데이터베이스에서 중요한 연구 분야이다. 기존에 연구된 실시간 동시성 제어 기법들은 능동성 개념을 지원하지 않기 때문에 실시간 능동 데이터베이스를 위한 동시성 제어 기법을 제안한다. 기존에 제안된 실시간 다중버전 동시성 제어 기법을 능동 데이터베이스에 적용하여 시간 제약과 능동 규칙을 동시에 만족하도록 고안하였다. 특히, 본 연구에서 제안한 동시성 제어 기법은 ECA 규칙에 의해서 실행된 트랜잭션들 사이의 선행관계와 능동관계를 연관시켜 데이터베이스의 일관성을 유지한다.

• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.985-990
• /
• 2007

This paper presents a novel control algorithm for position control of pneumatic cylinder. Generally, it is difficult to control the pneumatic servo system, due to nonlinearities such as air compressibility, the opening area of the valve, and frictional force between the cylinder and the piston. Especially, it is of significant importance for the control consisten-cy to return the cylinder pressures at equilibrium point to the initial states, still with guaranteeing the continuity of the pressures. For this purpose, the proposed control algorithm makes pressures of both cylinder chambers identical in magnitude but different in direction. The effectiveness and practicability of the control algorithm for the precise position control of the pneumatic cylinder are verified through the simulation study.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.91-99
• /
• 2014

The main game architectures for multiplayer online games are the traditional client-server architectures, multi-server architectures and P2P(peer-to-peer) architectures. P2P architectures, due to their distributed and collaborative nature, have low infrastructure costs and can achieve high scalability as well as fast response time by creating direct connections between players. However, P2P architectures face many challenges. Distributing a game among peers makes maintaining control over the game more complex. These architectures also tend to be vulnerable to churn and cheating. Providing consistency control in P2P systems is also more difficult since conflicting updates might be executed at different sites resulting in inconsistency. In order to avoid or correct inconsistencies, most multiplayer games use a primary-copy replication approach where any update to the object has to be first performed on the primary copy. This paper presents the primary-copy model with the update dissemination mechanism that provides consistency control over an object in P2P architectures for multiplayer online games. The performance for this model is evaluated through simulation experiments and analysis.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.477-491
• /
• 2002

The broadcast environment has asymmetric communication aspect that is typically much greater communication bandwidth available from server to clients than in the opposite direction. In addition, mobile computing systems generate mostly read-only transactions from mobile clients for retrieving different types of information such as stock data, traffic information and news updates. Since previous concurrency 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 optimistic concurrency control based on timestamp interval for broadcast environment. The following requirements are satisfied by adapting weak consistency that is the appropriate correctness criterion of read-only transactions: (1) the mutual consistency of data maintained by the server and read by clients (2) the currency of data read by clients. We also adopt the timestamp Interval protocol to check the weak consistency efficiently. As a result, we improved a performance by reducing unnecessary aborts and restarts of read-only transactions caused when global serializability was adopted.