• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.7
• /
• pp.1561-1568
• /
• 2005

In client-solver environments, clients can execute applications without contact a server by storing data in its cache. To guarantee correction of applications, we need a cache consistency algorithm. Many cache consistency algorithms have been proposed, these were categorized by detection-based and avoidance-based algorithms. In this paper, we propose a new detection-based cache consistency algorithm that can reduce a burden of a client that has poor resource compare with a server Our method controls concurrency of transactions using timestamp ordering and updates a cache dynamically. In addition to we show that our method maintains a one-copy serializability.

• Journal of KIISE:Software and Applications
• /
• v.26 no.9
• /
• pp.1061-1072
• /
• 1999

한 개 이상의 사이트에 공간 데이타가 중복 저장된 분산 공간 DB에서, 동시에 수행될 수 있는 긴 트랜잭션의 변경은 일관성 제어를 위해 다른 사이트에 전파되어야 한다. 이때 같은 영역의 공간 데이타를 서로 다른 사이트에서 동시에 변경할 경우, 변경 상충 문제가 발생하거나 잠금 기법에 의한 오랜 대기 시간이 초래되는 문제가 있다. 또한 공간 객체는 잠금의 대상이 아닌 공간 관련성에 의한 종속성을 가진다.이 논문은 긴 트랜잭션으로 중복된 공간 데이타를 변경할 경우 중복 제어를 위한 변경 전파와 동시성 제어 문제를 다룬다. 중복된 공간 데이타의 변경 병렬성을 향상시키기 위해 영역 잠금 및 SR-bound WRITE 잠금 기법을 제시한다. 한 사이트에서 수정하는 객체들과 다른 사이트에서 수정하는 객체들 사이에 공간 관련성에 의한 종속성이 없을 경우 병렬 수정을 허용하도록 제어하며, 공간 관련성에 의한 종속성이 있을 경우 SR-based 2PC라 불리는, 확장된 2단계 완료 프로토콜로 협동작업을 수행해서 변경 상충을 해결하는 새로운 중복 제어 기법을 설계하고 구현한다.Abstract The update of a long transaction should be propagated to the other sites for consistency control, when spatial database are replicated at multiple sites to achieve availability, reliability, and performance. When the replicated spatial data are updated at the same time, the update of one site would be conflicted with the other or a user would not be able to access the replicated spatial data under the control of locking. Two spatial objects having spatial relationships should be cooperatively updated even if there are no conflicts of locking for them.This paper deals with the issues of concurrency control and update propagation of replicated spatial data. We present the concept of region lock and SR-bound WRITE lock for enhancing the parallelism of updating the replicated spatial data. If there are no spatial relationships between one site's objets and the other's objects, parallel update would be allowed. Concurrent update of two spatial objects having spatial relationships should be propagated and cooperated by using an extended two-phase commit protocol, called spatial relationship-based 2PC.

• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.561-570
• /
• 2002

In order to evaluate the performance of incremental update algorithms, we perform experimental tests on the time of updating view objects. In this paper, the incremental update algorithms are evaluated on two kinds of materialized methods : materialization by value-copy and materialization by preserving object identifiers (OIDs). The result of performance evaluation shows that there is little difference in the updating time of view objects between two materialization methods. The evaluation of query processing on spatial views shows that materialization by value-copy is much better than materialization by preserving OIDs. As the results of overall performance evaluation, it is more desirable to use the incremental update method based on materialization by value-copy than the incremental update method based on materialization by preserving OIDs.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.4
• /
• pp.73-80
• /
• 2016

Multiplayer Online Games(MOG) using the Internet are typically organized based on a CS(client-server) or P2P(peer-to-peer) architecture. We then propose a method that combines a P2P architecture with a CS architecture in order to utilize their advantages. Most MOGs use a primary-copy replication approach that provides strong consistency control over an object. For each object and character there exists an authoritative copy, called primary copy and all other copies are secondary copies or replicas. Any update to the object has to be first performed on the primary copy. In the proposed hybrid architecture, primary copies may reside on the server or be held by clients. In this architecture, load balancing between a server and clients can be achieved by reducing the number of objects maintained by the server. Games consist of various types of actions with different consistency requirements. A multi-level approach to game consistency is sensible as it provides the best trade-off between consistency and performance. The performance for the hybrid game architecture with the primary-copy model is evaluated through simulation experiments and analysis in this paper.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.4
• /
• pp.135-143
• /
• 2015

A Multiplayer Online Game(MOG) is a game capable of supporting hundreds or thousands of players and is mostly played using the Internet. P2P(peer-to-peer) architectures for MOGs can potentially achieve high scalability, low cost, and good performance. The basic idea of many P2P-based games is to distribute the game state among peers and along with it processing, network, and storage tasks. In a primary-copy based replication scheme where any update to the object has to be first performed on the primary copy, this means distributing primary copies of objects among peers. Most multiplayer games use a primary-copy model in order to provide strong consistency control over an object. Games consist of various types of actions that have different levels of sensitivity and can be categorized according to their consistency requirements. With the appropriate consistency level of each action type within a game, this paper allows developers to choose the right trade-off between performance and consistency. The performance for P2P game architecture with the primary-copy model is evaluated through simulation experiments and analysis.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1694-1705
• /
• 1997

In the future mobile computing environment, it will be generalized that a mobile host with portable Laptop of Palmtop accesses to database through wireless communication channel. For solving the problems which are caused from low bandwidth of wireless communication, mobile hosts cache the datum used frequently on them. Thus the mobile hosts must always retain the cache consistency for the correctness of the cached datum. the cache consistency is mainly affected from the unrestricted host mobility and the disconnection of the communication between mobile hosts and mobile support station. In this situation, the strategy to retain efficiently cache consistency is required. In this paper, we propose a strategy using updatable message for retaining the cache consistency, in the mobile computing environment, with replicated database supporting 2 phase commit protocol. This strategy makes use of a updatable message to resolve the cache consistency problem, since mobile host crosses the boundary of cell. In using of this updatable, it find out and cache only the update data of missing invalidation message. As a result, the proposed strategy utilizes network bandwidth efficiently because it is not need to delete all the cached datum with any datum change.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1807-1824
• /
• 2015

As the technologies advance, mobile peer-to-peer (MP2P) networks or systems become one of the major ways to share resources and information. On such a system, the information retrieval (IR), including the development of scalable infrastructures for indexing, becomes more complicated due to a huge increase on the amount of information and rapid information change. To keep the systems on MP2P networks more reliable and consistent, the index structures need to be updated frequently. For a semantic IR system, the index structure is even more complicated than a classic IR system and generally has higher update cost. The most well-known indexing technique used in semantic IR systems is Latent Semantic Indexing (LSI), of which the index structure is generated by singular value decomposition (SVD). Although LSI performs well, updating the index structure is not easy and time consuming. In an MP2P environment, which is fully distributed and dynamic, the update becomes more challenging. In this work, we consider how to update the sematic index generated by LSI and keep the index consistent in the whole MP2P network. The proposed Concept Space Update (CSU) protocol, based on distributed 2-Phase locking strategy, can effectively achieve the objectives in terms of two measurements: coverage speed and update cost. Using the proposed effective synchronization mechanism with the efficient updates on the SVD, re-computing the whole index on the P2P overlay can be avoided and the consistency can be achieved. Simulated experiments are also performed to validate our analysis on the proposed CSU protocol. The experimental results indicate that CSU is effective on updating the concept space with LSI/SVD index structure in MP2P semantic IR systems.

• ETRI Journal
• /
• v.39 no.6
• /
• pp.820-831
• /
• 2017

File systems and applications try to implement their own update protocols to guarantee data consistency, which is one of the most crucial aspects of computing systems. However, we found that the storage devices are substantially under-utilized when preserving data consistency because they generate massive storage write traffic with many disk cache flush operations and force-unit-access (FUA) commands. In this paper, we present DJFS (Delta-Journaling File System) that provides both a high level of performance and data consistency for different applications. We made three technical contributions to achieve our goal. First, to remove all storage accesses with disk cache flush operations and FUA commands, DJFS uses small-sized NVRAM for a file system journal. Second, to reduce the access latency and space requirements of NVRAM, DJFS attempts to journal compress the differences in the modified blocks. Finally, to relieve explicit checkpointing overhead, DJFS aggressively reflects the checkpoint transactions to file system area in the unit of the specified region. Our evaluation on TPC-C SQLite benchmark shows that, using our novel optimization schemes, DJFS outperforms Ext4 by up to 64.2 times with only 128 MB of NVRAM.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.116-118
• /
• 2000

분산 공유 메모리(Distributed Shared Memory)시스템은 사용자에게 간단한 공유메모리 개념을 제공하기 때문에 사용자는 노드 사이의 데이터 이동에 관여할 필요가 없다. DSM에서 일치서 유지를 위한 프로토콜을 선택하는 것은 통신부하를 줄이는데 중요한 역할을 한다. 본 논문은 DSM 프로토콜을 효과적으로 선택하기 위한 새로운 성능평가 모델을 제시한다. 본 연구에서 제안하는 성능평가 모델을 사용함으로써 무효화방식(invalidate protocol), 갱신 방식(update protocol) 그리고 이주방식(migratory protocol)의 성능예측이 가능하다. 본 성능평가모델은 노드들 사이의 데이터 일치성(consistency)유지를 위한 부담을 최소화하는 최적의 DSM 프로토콜을 결정하는데 사용된다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.322-324
• /
• 2001

분산 환경에서 여러 호스트들간의 자료를 공유하는 것은 네트워크에 부하를 줄이고 가용도를 높일 수 있지만 복제된 공유 자료들의 일치성을 유지하는 것이 필요하다. 전통적으로 분산된 공유자료의 일치성을 위해서 무효화방식(invalidate protocol), 갱신방식(update protocol) 그리고 이주방식(migratory protocol)등이 사용되었다. 분산 환경뿐만 아니라 이동컴퓨팅 환경에서도 분산된 호스트들간에 공유자료의 일치성을 유지하기 위해서 적절한 프로토콜을 선택하는 것은 중요하다. 본 논문에서는 이동 컴퓨팅 환경에 효과적으로 적용 할 수 있는 공유자료의 일치성 유지하기 위한 프로토콜을 제안하고 성능 분석을 하였다.