• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.963-967
• /
• 2009

The Log-structured File System (LFS) collects all modified data into a memory buffer and writes them sequentially to a segment on disk. Therefore, it has the potential to utilize the maximum bandwidth of storage devices where sequential writes are much faster than random writes. However, as disk space is finite, LFS has to conduct cleaning to produce free segments. This cleaning operation is the main reason LFS performance deteriorates when file system utilization is high. To overcome painful cleaning and reduced performance of LFS, we propose the segment space recycling (SSR) scheme that directly writes modified data to invalid areas of the segments and describe the classification method of data and segment to consider locality of reference for optimizing SSR scheme. We implement U-LFS, which employs our segment space recycling scheme in LFS, and experimental results show that SSR scheme increases performance of WOLF by up to 1.9 times in HDD and 1.6 times in SSD when file system utilization is high.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.3
• /
• pp.97-103
• /
• 2020

Linux Cgroups takes a fundamental role for sharing system resources among multiple containers on container-based cloud computing environment. Especially for I/O resource, Linux Cgroups supports a mechanism for sharing I/O bandwidth in proportion to I/O weight. However, the current mechanism of Linux Cgroups using BFQ I/O scheduler seriously degrades the I/O performance with high bandwidth storage device such as NVMe SSDs. In this paper, we proposed a new feedback based I/O bandwidth sharing scheme for Linux Cgroups which allocates I/O credits to containers according to I/O weights and adjusts the amount of credits to performance fluctuation of NVMe SSDs. The proposed scheme is implemented on Linux kernel 5.3 and evaluated. The evaluation results show that it can share the I/O bandwidth among multiple containers proportionally to I/O weights while improving I/O performance more than twice as high as the existing scheme.

• Journal of Advanced Navigation Technology
• /
• v.13 no.6
• /
• pp.957-963
• /
• 2009

It is necessary for the resource management system to manage for the resource in distributed networking environment. Because of increasing the complexity of vast computer system and business environment, needs of RMS is increasing. Based on the common information model to use of objected oriented technology, through analysis of the reference model for the resource management system of the SNIA, we intend to implement the application program to manage the NGS system that consist of SSD and DRAM. To visualize, it is use the GUI Interface. It is possible for application program(Client) to detect and manage the system that consist of the NGS system. Also, status information that is divided into three cataloges(Minor/Major/Critical) can be displayed and it provide support of configuration functionality to manage devices.

• Journal of KIISE
• /
• v.43 no.7
• /
• pp.725-735
• /
• 2016

Smart TV uses Webkit as a web browser engine to provide contents such as web surfing, VOD watching, and games. Webkit uses web resources, such as HTML, CSS, JavaScript, and images, in order to run applications. At the start of an application, Webkit loads resources to the memory and creates DOM tree and render tree, which is a time consuming process. However, DOM tree and render tree created by the smart TV application do not change over time because the smart TV application uses web resources stored in a disk. If DOM tree and render tree can be stored and reused, it is possible to reduce loading time of an application. In this paper, we propose FastIO technique that selectively adds persistency to dynamically allocated memory. FastIO reduces overall application loading time by eliminating the process of loading resources from storage, parsing the HTML documents, and creating DOM tree and render tree. Comparison of the application resource loading times indicates that the web browser with FastIO is 7.9x, 44.8x, and 2.9x faster than the legacy web browser in an SSD, Ramdisk, and eMMC environment, respectively.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.248-250
• /
• 2012

SSD와 같은 낸드 플래시 기반의 저장 장치가 새로운 저장 매체로 각광받고 있다. 낸드 플래시 저장 장치의 특성을 살려 보다 효과적으로 사용하기 위해서는 입출력 패턴을 분석하고 정의하는 과정이 필요하다. 본 논문에서는 기존에 수행되어진 낸드 플래시 기반 저장 장치들의 패턴화 및 벤치마킹을 분석하여 각각의 특징을 확인하고 이해하기 쉽게 정리하여 향후 낸드 플래시 관련 연구에 사용될 수 있도록 한다. 또한 각 방법의 한계를 지적하여 새로운 낸드 플래시 패턴화에 적용할 수 있는 아이디어를 제안한다.

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

PCM은 바이트 단위 읽고 쓰기가 가능한 비휘발성 메모리로서 차세대 스토리지로 주목받고 있다. 기존의 디스크 캐싱 기법은 하드 디스크나 SSD와 같이 섹터 단위로 엑세스하는 장치를 위하여 페이지 단위의 캐싱을 하고 있다. 하지만, 바이트 단위 접근이 가능한 고성능 PCM의 특성을 활용하기 위해서는 PCM 스토리지를 위한 효율적인 단위의 디스크 캐싱 기법이 필요하다. 본 논문에서는 페이지 단위가 아닌 128바이트 단위 I/O요청을 위한 캐싱 방법을 제안하며, 이를 기반으로 몇 가지 워크로드에 대하여 실험을 진행하여 I/O 요청의 크기와 개수 변화를 추정한다. 실험 결과를 바탕으로 제안한 기법이 PCM 스토리지에서 더 적합함을 보인다.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.15 no.5
• /
• pp.539-545
• /
• 2015

Deduplication technique can expand the lifespan and capacity of flash memory-based storage devices by eliminating duplicated write operations. The deduplication techniques can be classified into two approaches, i.e., online and offline approaches. We propose an offline deduplication technique that uses a lightweight hash algorithm, whereas the previous offline technique uses a high-cost hash algorithm. Therefore, the memory space for caching hash values can be reduced, and more pages can be examined for deduplication during short idle intervals. As a result, it can provide shorter write latencies compared to the online approach, and can show low garbage collection costs compared to the previous offline deduplication technique.

• Journal of the Semiconductor & Display Technology
• /
• v.19 no.3
• /
• pp.112-117
• /
• 2020

NAND flash memory is a non-volatile memory that retains stored data even without power supply. Internal memory used as a data storage device and solid-state drive (SSD) is used in portable devices such as smartphones and digital cameras. However, NAND flash memory carries the risk of electric shock, which can cause errors during read/write operations, so use error correction codes to ensure reliability. It efficiently recovers bad block information, which is a defect in NAND flash memory. BBT (Bad Block Table) is configured to manage data to increase stability, and as a result of experimenting with the error correction code algorithm, the bit error rate per page unit of 4Mbytes memory was on average 0ppm, and 100ppm without error correction code. Through the error correction code algorithm, data stability and reliability can be improved.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.11a
• /
• pp.12-15
• /
• 2020

Data access characteristics can directly affect the efficiency of the system execution. This research is to design an accurate predictor by using historical memory access information, where highly accessible data can be migrated from low-speed storage (SSD/HHD) to high-speed memory (Memory/CPU Cache) in advance, thereby reducing data access latency and further improving overall performance. For this goal, we design a locally weighted linear regression prefetch scheme to cope with irregular access patterns in large graph processing applications for a DARM-PCM hybrid memory structure. By analyzing the testing result, the appropriate structural parameters can be selected, which greatly improves the cache prefetching performance, resulting in overall performance improvement.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.05a
• /
• pp.525-526
• /
• 2023

최근 빅데이터를 처리하기 위한 고용량의 저장장치의 연구가 활발하게 진행되고 있다. 특히 낸드 플래시 메모리 기반 저장장치인 SSD(Solid State Drive)는 고속 데이터 처리가 가능하기 때문에 다양한 저장 시스템에서 사용되고 있다. 그러나 낸드 플래시 메모리는 읽기 속도가 빠르고 쓰기 속도가 느린 비대칭 구조를 가지고 있어 데이터 쓰기 작업이 진행 중일 때 다른 작업이 대기하게 되어 전체적인 시스템 성능에 영향을 미칠 수 있다. 이에 대해 대부분의 연구에서는 쓰기 성능을 개선하기 위한 버퍼 관리 정책들이 제안되었다. 기술의 발전으로 쓰기 성능은 개선되었지만, 그에 비해 읽기 성능이 저조한 문제가 있다. 본 논문에서는 읽기 성능이 쓰기 성능보다 취약한 점을 분석하고 플래시 메모리 내에 저장장치 속도를 개선하기 위해 앞으로 읽기 요청 가능성이 있는 예상 데이터를 선형회귀 모델을 적용하여 전송 대기 시간 중 미리 읽는 정책을 제안한다.