• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.2
• /
• pp.247-251
• /
• 2010

Using SCM in storage systems introduce new potentials for improving I/O performance and reliability. In this paper, we study the use of SCM as a buffer cache that guarantees transactional unit writes. Our proposed method can improve storage system reliability and performance at the same time and can recover the storage system immediately upon a system crash. The Proposed method is based on the LINUX JBD(Journaling Block Device), thus reliability is equivalent to JBD. In our experiments, the file system that adopts our method shows better I/O performance even while guaranteeing high reliability and shows fast file system recovery time (about 0.2 seconds).

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.795-798
• /
• 2017

최근 멀티코어 프로세서가 개발됨에 따라 병렬 프로그래밍은 멀티코어를 효과적으로 활용하기 위한 기법으로 그 중요성이 높아지고 있다. 트랜잭셔널 메모리는 처리 방식에 따라 HTM, STM, HyTM으로 구분되며, 최근 HTM 및 STM 결합한 HyTM 이 활발히 연구되고 있다. 그러나 기존의 HyTM 는 HTM과 STM의 동시성 제어를 위해 블룸필터를 사용하는 반면, 블룸필터의 자체적인 긍정 오류를 해결하지 못한다. 아울러, 트랜잭션 처리를 위한 메모리 할당/해제를 기존의 락 메커니즘을 사용하여 관리한다. 따라서 멀티코어 환경에서 스레드 수가 증가할수록 트랜잭션 처리 효율이 떨어진다. 본 논문에서는 멀티코어 환경에서 효율적인 트랜잭션 처리를 위한 메모리 관리 기반 하이브리드 트랜잭셔널 메모리 기법을 제안한다. 제안하는 기법은 트랜잭션 처리에 최적화된 블룸필터를 제공함으로써, 병렬적으로 동시에 수행되는 서로 다른 환경의 트랜잭션에 대해 일관성 있는 처리를 지원한다. 아울러, CPU 캐시라인에 최적화된 메모리 기법을 통해, 메모리 할당량이 적은 트랜잭션은 로컬 캐시에 할당함으로써 트랜잭션의 빠른 처리를 지원한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.115-118
• /
• 2014

트랜잭셔널 메모리는 다중 코어 시스템에서 lock 을 대체할 메모리 동기화 기법으로 소개되었다. 트랜잭셔널 메모리를 사용하는 시스템에서 같은 주소의 메모리에 동시에 접근하여 충돌이 일어난 트랜잭션은 충돌해결정책에 의해 유효화 될지 버려질지 선택된다. 기존의 트랜잭셔널 메모리는 고정된 충돌해결정책을 사용하여, 상황에 따라 가장 유리한 트랜잭션을 선택 해주지 못하는 한계가 있었다. 본 논문에서는 상황에 따라 여러 정책 중 유리한 충돌해결정책을 판단하여 적용시키는 방법을 제안한다. STAMP 벤치마크를 통한 시뮬레이션 결과, 제안하는 방법은 기존에 사용되는 Timestamp, Karma 충돌해결정책 대비 평균 22% 높은 성능 향상을 보였다.

• Journal of Software Assessment and Valuation
• /
• v.17 no.2
• /
• pp.19-29
• /
• 2021

Blockchain technology fulfills the reliance requirement and is now entering a new stage of performance. However, the current blockchain technology has significant disadvantages in scalability and latency because of its architecture. Therefore, to adopt blockchain technology to real industry, we must overcome the performance issue by redesigning blockchain architecture. This paper introduces several element technologies and a novel blockchain architecture TPAC, that preserves blockchain's technical advantage but shows more stable and faster transaction processing performance and low latency.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.226-229
• /
• 2010

최근 프로세서가 코어 개수를 늘리는 구조로 발전함에 따라 병렬프로그래밍의 중요성이 더욱 강조되고 있다. 병렬프로그래밍에서 발생하는 공유자원에 대한 경쟁조건을 제어하기 위한 효율적인 방법으로 여러 가지 락-프리 동기화 기법이 제안되어 왔다. 그 중 소프트웨어 트랜잭션 메모리는 지금까지 하드웨어적인 방법과 소프트웨어적인 방법 등 여러 가지 방법으로 구현되었지만 여러 가지 하드웨어적인 제약과 기존의 소스코드를 수정해야 하는 문제점이 있다. 이러한 문제를 해결하기 위해 본 논문에서는 동적 코드 변환기술을 이용한 소프트웨어 트랜잭션 메모리 기법을 제안하고 기존 구현과 비교 평가하였다.

• Journal of Internet Computing and Services
• /
• v.16 no.1
• /
• pp.67-74
• /
• 2015

In recent years, frequent itemset mining for considering the importance of each item has been intensively studied as one of important issues in the data mining field. According to strategies utilizing the item importance, itemset mining approaches for discovering itemsets based on the item importance are classified as follows: weighted frequent itemset mining, frequent itemset mining using transactional weights, and utility itemset mining. In this paper, we perform empirical analysis with respect to frequent itemset mining algorithms based on transactional weights. The mining algorithms compute transactional weights by utilizing the weight for each item in large databases. In addition, these algorithms discover weighted frequent itemsets on the basis of the item frequency and weight of each transaction. Consequently, we can see the importance of a certain transaction through the database analysis because the weight for the transaction has higher value if it contains many items with high values. We not only analyze the advantages and disadvantages but also compare the performance of the most famous algorithms in the frequent itemset mining field based on the transactional weights. As a representative of the frequent itemset mining using transactional weights, WIS introduces the concept and strategies of transactional weights. In addition, there are various other state-of-the-art algorithms, WIT-FWIs, WIT-FWIs-MODIFY, and WIT-FWIs-DIFF, for extracting itemsets with the weight information. To efficiently conduct processes for mining weighted frequent itemsets, three algorithms use the special Lattice-like data structure, called WIT-tree. The algorithms do not need to an additional database scanning operation after the construction of WIT-tree is finished since each node of WIT-tree has item information such as item and transaction IDs. In particular, the traditional algorithms conduct a number of database scanning operations to mine weighted itemsets, whereas the algorithms based on WIT-tree solve the overhead problem that can occur in the mining processes by reading databases only one time. Additionally, the algorithms use the technique for generating each new itemset of length N+1 on the basis of two different itemsets of length N. To discover new weighted itemsets, WIT-FWIs performs the itemset combination processes by using the information of transactions that contain all the itemsets. WIT-FWIs-MODIFY has a unique feature decreasing operations for calculating the frequency of the new itemset. WIT-FWIs-DIFF utilizes a technique using the difference of two itemsets. To compare and analyze the performance of the algorithms in various environments, we use real datasets of two types (i.e., dense and sparse) in terms of the runtime and maximum memory usage. Moreover, a scalability test is conducted to evaluate the stability for each algorithm when the size of a database is changed. As a result, WIT-FWIs and WIT-FWIs-MODIFY show the best performance in the dense dataset, and in sparse dataset, WIT-FWI-DIFF has mining efficiency better than the other algorithms. Compared to the algorithms using WIT-tree, WIS based on the Apriori technique has the worst efficiency because it requires a large number of computations more than the others on average.

• Journal of Korea Game Society
• /
• v.20 no.6
• /
• pp.13-22
• /
• 2020

RIO is a new network API for Windows that is designed to have high I/O performance through low overhead and latency. Using RIO, MMO game servers may have much performance benefits. In addition, HTM has better productivity and performance compared to existing synchronization methods, so adopting it may produce better performance, also. In this paper, we improved server performance by implementing a new MMO game server architecture optimized with RIO and HTM. The performance of the server was verified through a benchmark program, and the number of concurrent users increased by 19%.

• Journal of Korean Academy of Nursing
• /
• v.4 no.2
• /
• pp.78-92
• /
• 1974

It is the purpose of this study to make clear the way in which people can lead a more desirable human life, that is, to ascertain the method of achieving therapeutic change through transaction between nurses and psychiatric patients. The various problems proposed by th9 above-stated aims of study can be shown, such as: What kind of influences does the method of a nurse′s communication have upon the response of psychiatric patients? 1) What are the general methods of communication used by the nurses? 2) Are there any differences between the control group and experimental group in the patients′ "Child" response? 3) Are there any differences between the control group and experimental group in the Patients "Adult" response? 4) What is the most desirable method of communication for therapeutic change in the patients? In an effort to solve the above questions this study attempted and managed to draw a random sampling of 200 patients being accommodated in the National Mental Hospital by dividing them into two groups, experimental groups and control groups, and recording the transactions between nurses and patients. In the course of carrying,: out this study, the experimental group was interviewed by the nurses specially trained In the P.A.C theory. and the control group interviewed at random by the nurses with no special training in communication. Further, the communication between nurses and patients in a free, relaxed atmosphere was allowed only for 15 minutes, whereupon the nurses were requested to make process-recording according to her memory of nurse patient transaction. The process-recording which recorded a series ol transactions between the nurses and the patients was analyzed according to Berne and Harris′transactional Analysis Standard. Through this standard, the writer of this study examined the significance of difference to compare the transactions brought forth between the experimental group and the control group. The following is a summary of the study which the writer of this thesis undertook. Hypothesis to The method of communication which the nurses usually apply to the patients will be higher in "Parent" than in "Adult". The communication which the nurses carried out in the control group turned out to be not significant between "Adult" and "Parent" Accordingly hypothesis 1. carne to be rejected. Hypothesis 2. The patients "Adult" response will be higher in the experimental group than in the control group. According to the result of a CR examination, as the communication showed a significant difference on P〈.01 level′ hypothesis 2 became affirmative. Hypothesis 3. The patients′"Child" response will be higher in the control group than in the experimental group. Hypothesis 3 proved affirmative since it showed an significant degree on P〈.01 level according to the result of a CR examination. Hypothesis 4 "Adult" response of the patient will be higher in frequency by nurses′"Adult" stimulus than nurse′s "Parent" stimulus Chi-square examination revealed significant difference on P〈.05 level. Hypo. 4 is affirmed. The following conclusions are drawn out based on the result of this study. 1) The generally used method of communication stimulus used by nurses for patients proved to be "Adult" and "Parent" in similar proportion. 2) The group in which the nurses could increase the patients "Adult" response proved to be higher in the experimental group than in the control group. Therefore, the communication (or stimulus) which has been applied in the experimental group can be said to be possible method of achieving therapeutic change. 3) Since the patients′"Child" response were higher in the control group than in the experimental group the communication method used In the control group was suggested as the less agreeable method of achieving therapeutic change than that used in the experimental Group. 4) "Adult" response of patient was elicited in significantly greater percentage when the "Adult" stimulus was used by the nurse. Therefore the most desirable method of-communication to give therapeutic change definitely was shown to be the "Adult" stimulus. Recommendations for further studies are as follows: 1) Studies on nurses′role perception in nurse-patient relationships. 2) Studies on patients′response to the method of communication used by nurses according to variables such as sex, social status, educational background, state of health. 3) Application of T.A, method to various groups of patients. 4) Study of various methods to improve student skill in use of process recording.