• Title/Summary/Keyword: Block Cleaning

Search Result 25, Processing Time 0.022 seconds

Design and Implementation of MODA Allocation Scheme based on Analysis of Block Cleaning Cost (블록 클리닝 비용 분석에 기초한 MODA할당 정책 설계 및 구현)

  • Baek, Seung-Jae;Choi, Jong-Moo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.11
    • /
    • pp.599-609
    • /
    • 2007
  • Due to the restrictions of Flash memory such as overwrite limitation and write/erase operational unit differences, block cleaning is required in Flash memory based file systems and known as a key factor on the performance of file systems. In this paper, we identify three parameters, namely utilization, invalidity and uniformity, and analyze how the parameters affect the cost of block cleaning. The analysis show that as uniformity degrades, the cost of block cleaning increases drastically. To overcome this problem, we design a new modification-aware(MODA) page allocation scheme that strives to keep uniformity high by separating frequently-updating data from infrequently-updating data. Real implementation experiments conducted on an embedded system show that the MODA scheme can actually enhance uniformity of Flash memory, which consequently leads to reduce the cost of block cleaning with an average of 123%, compared to the traditional sequential allocation scheme that is used in YAFFS.

Efficient Page Allocation Method Considering Update Pattern in NAND Flash Memory (NAND 플래시 메모리에서 업데이트 패턴을 고려한 효율적인 페이지 할당 기법)

  • Kim, Hui-Tae;Han, Dong-Yun;Kim, Kyong-Sok
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.5
    • /
    • pp.272-284
    • /
    • 2010
  • Flash Memory differs from the hard disk, because it cannot be overwritten. Most of the flash memory file systems use not-in-place update mechanisms for the update. Flash memory file systems execute sometimes block cleaning process in order to make writable space while performing not-in-place update process. Block cleaning process collects the invalid pages and convert them into the free pages. Block cleaning process is a factor that affects directly on the performance of the flash memory. Thus this paper suggests the efficient page allocation method, which reduces block cleaning cost by minimizing the numbers of block that has valid and invalid pages at a time. The result of the simulation shows an increase in efficiency by reducing more block cleaning costs than the original YAFFS.

A Study of Purity-based Page Allocation Scheme for Flash Memory File Systems (플래시 메모리 파일 시스템을 위한 순수도 기반 페이지 할당 기법에 대한 연구)

  • Baek, Seung-Jae;Choi, Jong-Moo
    • The KIPS Transactions:PartA
    • /
    • v.13A no.5 s.102
    • /
    • pp.387-398
    • /
    • 2006
  • In this paper, we propose a new page allocation scheme for flash memory file system. The proposed scheme allocates pages by exploiting the concept of Purity, which is defined as the fraction of blocks where valid Pages and invalid Pages are coexisted. The Pity determines the cost of block cleaning, that is, the portion of pages to be copied and blocks to be erased for block cleaning. To enhance the purity, the scheme classifies hot-modified data and cold-modified data and allocates them into different blocks. The hot/cold classification is based on both static properties such as attribute of data and dynamic properties such as the frequency of modifications. We have implemented the proposed scheme in YAFFS and evaluated its performance on the embedded board equipped with 400MHz XScale CPU, 64MB SDRAM, and 64MB NAND flash memory. Performance measurements have shown that the proposed scheme can reduce block cleaning time by up to 15.4 seconds with an average of 7.8 seconds compared to the typical YAFFS. Also, the enhancement becomes bigger as the utilization of flash memory increases.

An Efficient Cleaning Scheme for File Defragmentation on Log-Structured File System (로그 구조 파일 시스템의 파일 단편화 해소를 위한 클리닝 기법)

  • Park, Jonggyu;Kang, Dong Hyun;Seo, Euiseong;Eom, Young Ik
    • Journal of KIISE
    • /
    • v.43 no.6
    • /
    • pp.627-635
    • /
    • 2016
  • When many processes issue write operations alternately on Log-structured File System (LFS), the created files can be fragmented on the file system layer although LFS sequentially allocates new blocks of each process. Unfortunately, this file fragmentation degrades read performance because it increases the number of block I/Os. Additionally, read-ahead operations which increase the number of data to request at a time exacerbates the performance degradation. In this paper, we suggest a new cleaning method on LFS that minimizes file fragmentation. During a cleaning process of LFS, our method sorts valid data blocks by inode numbers before copying the valid blocks to a new segment. This sorting re-locates fragmented blocks contiguously. Our cleaning method experimentally eliminates 60% of file fragmentation as compared to file fragmentation before cleaning. Consequently, our cleaning method improves sequential read throughput by 21% when read-ahead is applied.

An Adaptive Garbage Collection Policy for NAND Flash Memory (낸드 플래시 메모리를 위한 적응형 가비지 컬렉션 정책)

  • Han, Gyu-Tae;Kim, Sung-Jo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.5
    • /
    • pp.322-330
    • /
    • 2009
  • In order to utilize NAND flash memory as storage media which does not allow update-in-place and limits the number of block erase count, various garbage collection policies supporting wear-leveling have been investigated. Conventional garbage collection policies require cleaning-index calculation for the entire blocks to choose a block to be garbage-collected to support wear-leveling whenever a garbage collection is required, which results in performance degradation of system. This paper proposes a garbage collection policy which supports wear-leveling using a threshold value, which is in fact a variance of erase counts and by the maximum erase count of all blocks, without calculating the cleaning-index. During garbage collection, the erase cost is minimized by using the Greedy Policy if the variance is less than the threshold value. It achieves wear-leveling by excluding the block with the largest erase count from erase target blocks if the variance is larger than threshold value. The proposed scheme shows that a standard deviation approaches to zero as the erase count of blocks approaches to its upper limit and the measured speed of garbage collection is two times faster than the conventional schemes.

A Study on Efficiency Improvement of Surface Preparation Process for Ship's Block - the Effect of Design and Operation Parameters for the Abrasive Recovery System (조선용 블록의 도장 전처리 효율 향상 연구 - 연마재 회수 효율 제어 인자별 특성 평가)

  • Baek Jea jin;Lee Byung Hun
    • Special Issue of the Society of Naval Architects of Korea
    • /
    • 2005.06a
    • /
    • pp.198-205
    • /
    • 2005
  • Reduction of labor hour for cleaning up of the used abrasives after blasting. is attempted by improving the efficiency of abrasive recovery process in the protective coating of ship's block, For this purpose, the theoretical background for pneumatic transport technology in the abrasive recovery system as well as experimental evaluation on the effect of design parameters such as flow pattern, saltation velocity and pressure drop on the efficiency of the abrasive recovery system are employed . By optimizing the operating parameters such as the length and diameter of the suction hose, specification of recovery device and recovery mouth, a new method which can dramatically increase the efficiency of abrasive recovery system, is proposed.

  • PDF

File System for Performance Improvement in Multiple Flash Memory Chips (다중 플래시 메모리 기반 파일시스템의 성능개선을 위한 파일시스템)

  • Park, Je-Ho
    • Journal of the Semiconductor & Display Technology
    • /
    • v.7 no.3
    • /
    • pp.17-21
    • /
    • 2008
  • Application of flash memory in mobile and ubiquitous related devices is rapidly being increased due to its low price and high performance. In addition, some notebook computers currently come out into market with a SSD(Solid State Disk) instead of hard-drive based storage system. Regarding this trend, applications need to increase the storage capacity using multiple flash memory chips for larger capacity sooner or later. Flash memory based storage subsystem should resolve the performance bottleneck for writing in perspective of speed and lifetime according to its physical property. In order to make flash memory storage work with tangible performance, reclaiming of invalid regions needs to be controlled in a particular manner to decrease the number of erasures and to distribute the erasures uniformly over the whole memory space as much as possible. In this paper, we study the performance of flash memory recycling algorithms and demonstrate that the proposed algorithm shows acceptable performance for flash memory storage with multiple chips. The proposed cleaning method partitions the memory space into candidate memory regions, to be reclaimed as free, by utilizing threshold values. The proposed algorithm handles the storage system in multi-layered style. The impact of the proposed policies is evaluated through a number of experiments.

  • PDF

Mounting Time Reduction and Clean Policy using Content-Based Block Management for NAND Flash File System (NAND 플래시 파일 시스템을 위한 내용기반 블록관리기법을 이용한 마운트 시간 감소와 지움 정책)

  • Cho, Wan-Hee;Lee, Dong-Hwan;Kim, Deok-Hwan
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.3
    • /
    • pp.41-50
    • /
    • 2009
  • The flash memory has many advantages such as low power consumption, strong shock resistance, fast I/O and non-volatility. And it is increasingly used in the mobile storage device. Many researchers are studying the YAFFS, NAND flash file system, which is widely used in the embedded device. However, the existing YAFFS has two problems. First, it takes long time to mount the YAFFS file system because it scans whole spare areas in all pages. Second, the cleaning policy of the YAFFS does not consider the wear-leveling so that it cannot guarantee the duration of data completely. In order to solve these problems, this paper proposes a new content-based YAFFS that consists of a mounting time reduction technique and a content-cleaning policy by using content-based block management. The proposed method only scans partial spare areas of some special pages and provides the block swapping which enables the wear-leveling of data blocks. We performed experiments to compare the performance of the proposed method with those of the JFFS2 system and YAFFS system. Experimental results show that the proposed method reduces the average mounting time by 82.2% comparing with JFFS2 and 42.9% comparing with YAFFS. Besides, it increases the life time of the flash memory by 35% comparing with the existing YAFFS whereas no overheat is added.

Immunological and Pathological Aspects of Respiratory Tract Infection with Stenotrophomonas maltophilia in BALB/c Mice

  • Zgair, Ayaid Khadem;Chhibber, Sanjay
    • Journal of Microbiology and Biotechnology
    • /
    • v.20 no.11
    • /
    • pp.1585-1591
    • /
    • 2010
  • A comprehensive study on the production of inflammatory mediators in the lungs of BALB/c mice following infection with Stenotrophomonas maltophilia was conducted. The levels of pro-inflammatory cytokines, tumor necrosis factor alpha (TNF-${\alpha}$), and interleukin-1${\beta}$ (IL-1${\beta}$) were raised in the lungs of infected mice compared with control. The production of anti-inflammatory cytokine IL-10 was slightly delayed. Its peak level was on the $2^{nd}$ day, whereas the peak of pro-inflammatory cytokines was observed on day 1 after intranasal challenge. This was accompanied by a rise in myeloperoxidase (MPO) and malondialdehyde (MDA) on day 1. The increase in MPO levels matched with histopathological observations, as neutrophils infiltration was detected on the first day. Alveolar macrophages (AMs) obtained from infected animals showed a higher rate of uptake and killing when exposed to bacteria in vitro, compared with similar experiments conducted with AMs from normal mice (control). This suggests that AMs were more efficient in cleaning the bacteria. The nitric oxide (NO) production however started early during infection but reached its maximum on the $3^{rd}$ day. No mortality was observed among the infected animals, and infection was resolved by the $5^{th}$ day post infection. No drastic changes in the lung tissue were observed on histopathological examination.

Removal of Hydrophobic Contaminant using Amphiphilic Block Copolymer (양친성 블록공중합체를 이용한 소수성 오염원제거)

  • Lee, Junhyup;Shim, Jaeyoul;Kim, Younguk
    • Journal of the Korean GEO-environmental Society
    • /
    • v.15 no.3
    • /
    • pp.15-19
    • /
    • 2014
  • Spilling pollutants and its contamination to the ground have serious impact to public resulting in various research about remediation techniques. In this study, the use of amphiphilic block copolymer for remediation was investigated with a series of laboratory tests on removal of hydrophobic contaminant in soil. Four types of amphiphilic block copolymer were developed and the efficiency of the cleaning was compared with surfactant using arbitrary diesel-contaminated soils. The results of the study show that the use of amphiphilic polymer in the soil washing process significantly enhanced the remediation of the contaminated soil and a potential of new methodology of eco-friendly remediation.