• Journal of Digital Contents Society
• /
• v.14 no.1
• /
• pp.51-57
• /
• 2013

Storage device based on Flash Memory have many attractive features such as high performance, low power consumption, shock resistance, and low weight, so they replace HDDs to a certain extent. An Storage device based on Flash Memory has FTL(Flash Translation Layer) which emulate block storage devices like HDDs. A garbage collection, one of major functions of FTL, effects highly on the performance and the lifetime of devices. However, there is no de facto standard for new garbage collection algorithms. To solve this problem, we propose File Clustering Algorithm. File Clustering Algorithm respect to update page from same file at the same time. So, these are clustered to same block. For this mechanism, We propose Page Allocation Policy in FTL and use MIN-MAX GAP to guarantee wear leveling. To verify the algorithm in this paper, we use TPC Benchmark. So, The performance evaluation reveals that the proposed algorithm has comparable result with the existing algorithms(No wear leveling, Hot/Cold) and shows approximately 690% improvement in terms of the wear leveling.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.12
• /
• pp.93-100
• /
• 2010

In this paper, we propose a technique which makes it faster to delete prefixes in an IP address lookup architecture based on parallel TCAMs. In previous deletion schemes, more than one memory movement is needed for the prefix ordering and keeping the available memory space consecutive. For deletion, our scheme stores the address of the deleted prefix in a stack implemented by SRAM instead of actual movement in TCAM. Since SRAM has very short latency compared to TCAM, the proposed scheme can accomplish fast updating. From the experiment with the real forwarding table and update trace, we evaluate the performance of our scheme in terms of the memory access time for the prefix insertion and deletion. The experiment result also shows good performance with considerably small size of stack.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.2
• /
• pp.1-8
• /
• 2022

In this paper, we design and implement a GPU-based parallel algorithm to effectively solve the traveling salesman problem through an ant color system. The repetition process of generating hundreds or thousands of tours simultaneously in TSP utilizes GPU's task-level parallelism, and the update process of pheromone trails data actively exploits data parallelism by 32x32 thread blocks. In particular, through simultaneous memory access of multiple threads, the coalesced accesses on continuous memory addresses and concurrent accesses on shared memory are supported. This experiment used 127 to 1002 city data provided by TSPLIB, and compared the performance of sequential and parallel algorithms by using Intel Core i9-9900K CPU and Nvidia Titan RTX system. Performance improvement by GPU parallelization shows speedup of about 10.13 to 11.37 times.

• The KIPS Transactions:PartD
• /
• v.15D no.6
• /
• pp.755-766
• /
• 2008

Recently, NAND flash memory is becoming into the spotlight as a next-generation storage device because of its small size, fast speed, low power consumption, and etc. compared to the hard disk. However, due to the distinct characteristics such as erase-before-write architecture, asymmetric operation speed and unit, disk-based systems and applications may result in severe performance degradation when directly implementing them on NAND flash memory. Especially when a B-tree is implemented on NAND flash memory, intensive overwrite operations may be caused by record inserting, deleting, and reorganizing. These may result in severe performance degradation. Although ${\mu}$-tree has been proposed in order to overcome this problem, it suffers from frequent node split and rapid increment of its height. In this paper, we propose Log-Structured B-Tree(LSB-Tree) where the corresponding log node to a leaf node is allocated for update operation and then the modified data in the log node is stored at only one write operation. LSB-tree reduces additional write operations by deferring the change of parent nodes. Also, it reduces the write operation by switching a log node to a new leaf node when inserting the data sequentially by the key order. Finally, we show that LSB-tree yields a better performance on NAND flash memory by comparing it to ${\mu}$-tree through various experiments.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.52-54
• /
• 2004

이동객체의 위치 정보는 데이터의 양이 방대하고, 객체의 위치가 변경될 매마다 계속적인 갱신연산이 요구되어진다. 이러한 갱신 연산에서 디스크 접근비용을 최소화하기 위해 최근 Lazy Update R-tree(LUR-tree)가 제안되었다. 그러나 디스크 기반의 색인은 검색 및 갱신 연산의 실시간 처리를 보장할 수 없기 때문에 메인 메모리에서 이동객체의 위치 정보를 유지하는 것이 필요하다. 본 논문에서는 디스크 기반의 LUR-tree를 MBR 압축을 통해 캐시에 최적화되도록 변형한 색인기법을 제안한다. MBR 압축기법은 부모 노드로의 상대적 위치로 표현된 엔트리의 MBR을 변환함수를 통해 2,4,8 바이트의 정수로 변환한다. 제안된 색인은 변환된 MBR의 크기에 따라 엔트리를 동적 할당함으로써, 상위노드에서는 키 비교 회수를 줄이고, 단말 노드로 갈수록 키 비교 횟수는 늘어나지만, 캐시 미스를 줄일 수 있다는 장점으로 인해 검색 및 갱신 성능을 전체적으로 향상시킨다

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.781-783
• /
• 2005

본 논문은 임베디드 시스템에서 대용량 저장시스템에 적합한 NAND 플래시 메모리 기반의 파일 시스템을 제안한다. 플래시 메모리는 비휘발성이며 기존의 하드디스크와 같은 자기 매체에 비해서 크기가 작고 전력소모도 적으며 내구성이 높은 장점을 지니고 있다. 그러나 제자리 덮어쓰기 (update-in-place)가 불가능하고 메모리 셀에 대한 초기화 횟수가 제한되는 단점이 있다. 또한 NAND 플래시 메모리는 바이트 단위의 입출력이 불가능하다. 이러한 특성 때문에 NAND 플래시 메모리를 저장장치로 사용할 경우 기존의 저장 장치 관리 방법과는 다른 방법을 요구한다. 본 논문은 임베디드 시스템에서 대용량 저장장치를 위한 NAND 플래시 메모리 기반의 파일 시스템의 구조를 제시하고, 대용량 파일 지원을 위한 메타 데이터 구조와 데이터 수정 기법을 제안한다.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.2
• /
• pp.345-354
• /
• 2003

An incremental kernel principal component analysis(IKPCA) is proposed for the nonlinear feature extraction from the data. The problem of batch kernel principal component analysis(KPCA) is that the computation becomes prohibitive when the data set is large. Another problem is that, in order to update the eigenvectors with another data, the whole eigenvectors should be recomputed. IKPCA overcomes this problem by incrementally updating the eigenspace model. IKPCA is more efficient in memory requirement than a batch KPCA and can be easily improved by re-learning the data. In our experiments we show that IKPCA is comparable in performance to a batch KPCA for the classification problem on nonlinear data set.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.321-322
• /
• 2011

차세대 저장매체로 각광받고 있는 BPRAM을 이용해, NAND Flash memory의 결점을 보완하고자 하는 많은 연구들이 진행되고 있다. 본 논문에서는 BPRAM과 NAND Flash를 이용하여, 계층적 스토리지에 사용하는 하이브리드 파일 시스템인 Compressing Metadata File System(CMFS)을 개발하였다. CMFS는 Mount time에 필요한 메타데이터를 BPRAM에 저장하여 마운트 시간을 줄이고, 메타데이터를 Update하기 위한 Overhead를 줄이기 위해 부분 갱신 기법을 개발하였다. 또한 메타데이터의 저장을 위해 필요한 BPRAM의 용량를 줄이기 위해 메타데이터를 경량화 및 압축하고, 압축률을 높이기 위해 Hybrid Coding 압축기법을 개발하여 적용한다. Marvel PXA320(806MHz) 보드를 이용하여 CMFS의 성능을 측정하였으며, 타 압축 기법보다 높은 메타데이터의 압축률을 보였다.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.406-409
• /
• 2008

Clustering data streams has an importance over many applications like sensor networks. Existing hierarchical methods follow a semi fuzzy clustering that yields duplicate clusters. In order to solve the problems, we propose an extended online divisive agglomerative clustering on data streams. It builds a tree-like top-down hierarchy of clusters that evolves with data streams using geometric time frame for snapshots. It is an enhancement of the Online Divisive Agglomerative Clustering (ODAC) with a pruning strategy to avoid duplicate clusters. Our main features are providing update time and memory space which is independent of the number of examples on data streams. It can be utilized for clustering sensor data and network monitoring as well as web click streams.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.688-695
• /
• 2000

We present a multi-view autostereoscopic display system based on volume holographic storage technique. In this proposed system, the interference pattern of spatial multiplexed plane reference and angular multiplexed plane object beams are recorded into a photorefractive crystal, which plays a role of guiding object beams of multi-view images into the desired persfective directions. For reconstruction, object beams containing the desired multi-view image information, which satisfy Bragg matching condition, are illuminated in the time-division multiplexed manner onto the crystal. Then multiple stereoscopic images are Projected to the display plane for autostereoscopic 3D viewing.