• The Journal of the Korea Contents Association
• /
• v.4 no.3
• /
• pp.71-80
• /
• 2004

In distributed file-systems, cooperative caching algorithm which owns the data cached at each node jointly is used to reduce an expense of disk access. Cooperative caching algorithm is the method that increases a cache hit-ratio and decrease a disk access as it holds the cache information of distributed systems in common and makes cache larger virtually. Recently, several cooperative caching algorithms decrease the message costs by using approximate information of the cache and increase the cache hit-ratio by using local and global cache fields dynamically. And they have an advantage that increases the whole field hit-ratio by sending a replaced buffer to the idle node on buffers replacement in order to maintain the replaced cache in the cache field. However the wrong approximate information deteriorates the performance, the consistency maintenance goes to great expense to exchange messages and the cost that manages Age-information of each node to choose the idle node increases. In this thesis, we propose a cooperative cache algorithm that maintains correct cache information, minimizes the maintenance cost for consistency and the management cost for buffer Age-information. Also, we show the superiority of our algorithm through the performance evaluation.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.07a
• /
• pp.145-146
• /
• 2018

중앙 집중적인 단일 컨트롤러를 이용할 경우 메시지 과부하로 인해 응답이 지연될 수 있으므로 스위치들이 기존의 컨트롤러를 대신하여 새로운 컨트롤러와 연결되어 트래픽을 처리하는 다중 컨트롤러가 효율적이다. 본 논문에서는 SDN 분산 컨트롤러에서 일관성 문제를 해결하기 위해 우선순위에 기반을 둔 향상된 인공벌 군집(ABC) 알고리즘을 제안한다.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.288-298
• /
• 1995

Load balancing attempts to improve the performance of a distributed computing system by transferring some of the workload of a congested site to others. A load balancing scheme that supports both the source-initiated and the server- initiated load balancing is proposed in this paper. It can model both the m/m/1 queue(no load balancing) and the m/m/n queue(perfect load balancing) as the extreme State variables are replicated into every site, and copy consistency constraints are relaxed more weakly. We propose weak copy consistency constraints which correlate the outdated state information to that of the current state. We also derive sufficient conditions under which each scheduler can guarantee the load balancing without communication Using this model, the problem of load balancing is converted to that of maintaining the consistency of states and communication overhead becomes less than that of the bidding algorithm. The scheme is simulated by event tracing, compared to the two extreme cases and the bidding algorithm. The results show that the mean response time and the number of messages are reduced by 0-35% and 40-100% respectively, compared with the bidding algorithm. Finally the effects of some system parameters are described.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.647-654
• /
• 2003

The replication of data is used to increase its availability and to improve the performance of a system. The distributed database system has to maintain both the database consistency and the replica consistency. This paper proposes an algorithm which resolves the conflict of the operations by using the mechanism based on the structure that the replicas of each data item are hierarchically organized. Each update is propagated along the tree based on the fact that the root of each data item is the primary replica in partially replicated databases. The use of a hierarchy of data may eliminate useless propagation since the propagation can be done only to sites having the replicas. In consequence, the propagation delay of updates may be reduced. By using the timestamp and a compensating transaction, our algorithm resolves the non-serializability problem caused by the conflict of operations that can happen on the way of the update propagation due to the lazy propagation. This resolution also guarantees the data consistency.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.469-480
• /
• 2008

A shared disk (SD) cluster couples multiple nodes for high performance transaction processing, and all the coupled nodes share a common database at the disk level. To reduce the number of disk accesses, each node caches database pages in its memory buffer. Since a particular page may be cached simultaneously in different nodes, cache consistency should be maintained to ensure that nodes can always access the most recent version of database pages. Most cache consistency schemes proposed in the SD cluster adopted LRU as a buffer replacement algorithm. In this paper, we first present four buffer replacement algorithms that consider the characteristics of the SD cluster. Then we compare the performance of the buffer replacement algorithms. We perform the experiments on a variety of cluster configurations and database workloads. The experiment results show that the proposed algorithms achieve performance improvement up to 5 times of LRU algorithm.

• 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 Biomedical Engineering Research
• /
• v.20 no.3
• /
• pp.291-297
• /
• 1999

Source consislency filtering (SCF) is very effective at removing nOIse when only one or a few leads among multi-lead ECG signals are contaminated. When the noise at one or only a few leads are statistically uncorrelated with signals at other leads, SCF seleclIvely removes the noise with a neglIgIble amount of distortion in the original signal waveform. In order to enhance the understanding of this new method, we describe the lheory and implementational details of SCF in this paper. Numerical implementation and test results of SCF on a multi-lead ECG dalabase show that SCF is a new kind of adaptive filters utilizmg spatial as well as temporal information in multi-c.hannel signals origmatmg from a single source. We also describe the limitations and future improvements in using SCF.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.2
• /
• pp.11-20
• /
• 2000

Topological relationships play an important role in query optimization in spatial databases. If topological relationships are known a priori, then expensive query processing can be avoided. In this paper we address the problems of： ⅰ) identifying topological relationships among spatial objects, ⅱ) checking consistency of specified topological relationships, and ⅲ) exhaustively deriving new topological relationships from the ones specified. These activities lead to an efficient query processing when queries associated with topological relationships are invoked. Specifically, eight types of topological relationships (｛equal, disjoint, overlap, meets, contains, contained-in, properly-contains, and properly-contained-in｝) are considered. We present an algorithm to check the consistency of specified topological relationships and to derive all possible relationships from the given set of known relationships.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.135-139
• /
• 2009

In this paper we present INCUI, a user interface based on natural view of physical user interface of target devices and services in pervasive computing environment. We present a concept of Intuitively Natural and Consistent User Interface (INCUI) consisted of an image of physical user interface and a description XML file. Then we elaborate how INCUI template can be used to consistently map user interface components structurally and visually. We describe the process of INCUI mapping and a novel mapping method selection architecture based on domain size, types of source and target INCUI. Especially we developed and applied an extended LCS-based algorithm using prefix/postfix/synonym for similarity calculation.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.799-807
• /
• 2000

In this paper, object replication Client/server under distributed computing system is design and implementation. Today many end-users have a computer communication by using internet in the distributed system of client/server. If many users request services to a specific remote server, the server should have got a overhead for hat service processing, delayed the speed for replay, and bring a bottleneck in communication network. Therefore object replication method was proposed to solve this problems. The growth of internet works and distributed applications has increased the need for large scale replicated systems. However, existing replication protocols do not address scale and autonomy issues adequately. Further, current application protocol require consistency of different levels, and therefore should be the selection function of consistency in them, in order to have particular semantics of each level. In this paper, server overhead and bottleneck happening in remote procedure call be using server object replication. Therefore access transparency can be improved by sharing object duplicately. So it will Keep up with the consistency within the replicated objects.