• Title/Summary/Keyword: YAFFS

Search Result 40, Processing Time 0.025 seconds

Design and Implementation of Crash Recovery Technique with Bounded Execution Time for NAND Flash File System (낸드 플래시 파일 시스템을 위한 결함 복구 시간 제한 기법의 설계 및 구현)

  • Kang, Seung-Yup;Park, Hyun-Chan;Kim, Ki-Man;Yoo, Chuck
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.6
    • /
    • pp.330-338
    • /
    • 2010
  • Flash storage devices are very popularly used in portable devices such as cell phones, PDAs and MP3 players. As technology is improved, users want much bigger and faster storage system. Paradoxically, people have to wait more and more time proportionally to the capacity of their storage devices when these are trying to be recovered after file system crash. It is serious problem because booting time of devices is dominated by crash recovery of flash file system. In this paper, we design a crash recovery mechanism, named 'Working Area(WA hereafter)' technique, which has bounded crash recovery execution time. With WA technique, write operations to flash memory are only performed in WA. Therefore, by simply scanning the latest WA. We can recover a file system crash because every change for flash memory is occured only in latest WA. We implement the WA technique based on YAFFS2 and evaluate by comparing with traditional techniques. As a result, WA technique shows that its crash recovery execution time is 25 times faster than Log-based Method when we use 1 gig a bytes NAND flash memory in worst case. This gap will be futher and futher as storage capacity grows.

Boosting up the Mount Latency of NAND Flash File System using Byte-addressable NVRAM (바이트 접근성을 가지는 비휘발성 메모리 소자를 이용한 낸드 플래시 파일 시스템의 부팅시간 개선 기법)

  • Jeon, Byeong-Gil;Kim, Eun-Ki;Shin, Hyung-Jong;Han, Seok-Hee;Won, Yoo-Jip
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.3
    • /
    • pp.256-260
    • /
    • 2008
  • This paper describes an improvement of mount-time delay in NAND Flash file systems. To improve file system mount performance, this work configures a hierarchical storage system with byte-addressable NVRAM and NAND Flash memory, and let the meta data of a file system allocated in the NVRAM. Since the meta data are stored in NVRAM supporting data integrity some of the items, which are stored in Spare area and Object Header area of NAND Flash memory to control meta data of NAND Flash file system, could be eliminated. And also, this work eliminates the scanning operation of the Object Header area of previous work FRASH1.0. The scanning operation is definitely required to find out the empty Object Header address for storing the Object Header data and provokes a certain amount of performance loss in file generation and deletion. In this work, an implemented file system, so-called FRASH1.5, is demonstrated, featuring new data structures and new algorithms. The mount time of FRASH1.5 becomes twice as fast as that of the FRASH1.0. The performance in file generation gets improved by about $3{\sim}8%$. In particular, for most large-size files, the FRASH1.5 has 8 times faster mount time than YAFFS, without any performance loss as seen in the file generation.

Design and Implementation of the Flash File System that Maintains Metadata in Non-Volatile RAM (메타데이타를 비휘발성 램에 유지하는 플래시 파일시스템의 설계 및 구현)

  • Doh, In-Hwan;Choi, Jong-Moo;Lee, Dong-Hee;Noh, Sam-H.
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.2
    • /
    • pp.94-101
    • /
    • 2008
  • Non-volatile RAM (NVRAM) is a form of next-generation memory that has both characteristics of nonvolatility and byte addressability each of which can be found in nonvolatile storage and RAM, respectively. The advent of NVRAM may possibly bring about drastic changes to the system software landscape. When NVRAM is efficiently exploited in the system software layer, we expect that the system performance can be significantly improved. In this regards, we attempt to develop a new Flash file system, named MiNVFS (Metadata in NVram File System). MiNVFS maintains all the metadata in NVRAM, while storing all file data in Flash memory. In this paper, we present quantitative experimental results that show how much performance gains can be possible by exploiting NVRAM. Compared to YAFFS, a typical Flash file system, we show that MiNVFS requires only minimal time for mounting. MiNVFS outperforms YAFFS by an average of around 400% in terms of the total execution time for the realistic workloads that we considered.

Design and Implementation of Analysis Techniques for Fragmented Pages in the Flash Memory Image of Smartphones (스마트폰 플래시 메모리 이미지 내의 단편화된 페이지 분석 기법 및 구현)

  • Park, Jung-Heum;Chung, Hyun-Ji;Lee, Sang-Jin;Son, Young-Dong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.22 no.4
    • /
    • pp.827-839
    • /
    • 2012
  • A cell phone is very close to the user and therefore should be considered in digital forensic investigation. Recently, the proportion of smartphone owners is increasing dramatically. Unlike the feature phone, users can utilize various mobile application in smartphone because it has high-performance operating system (e.g., Android, iOS). As acquisition and analysis of user data in smartphone are more important in digital forensic purposes, smartphone forensics has been studied actively. There are two way to do smartphone forensics. The first way is to extract user's data using the backup and debugging function of smartphones. The second way is to get root permission, and acquire the image of flash memory. And then, it is possible to reconstruct the filesystem, such as YAFFS, EXT, RFS, HFS+ and analyze it. However, this methods are not suitable to recovery and analyze deleted data from smartphones. This paper introduces analysis techniques for fragmented flash memory pages in smartphones. Especially, this paper demonstrates analysis techniques on the image that reconstruction of filesystem is impossible because the spare area of flash memory pages does not exist and the pages in unallocated area of filesystem.

Fast Mount Mechanisms for Improving Flash File System Availability (플래시 파일 시스템의 가용성 향상을 위한 빠른 마운트 기법)

  • Jung, Jin-Man;Kim, Bong-Jae;Jang, Joon-Hyouk;Min, Hong;Cho, Yoo-Kun;Hong, Ji-Man;Jeon, Gwang-Il
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06b
    • /
    • pp.44-47
    • /
    • 2011
  • 임베디드 시스템에 저장매체로 사용되는 NAND플래시 메모리의 용량이 급격하게 증가하여 부팅 과정에서 파일 시스템을 마운트 하는데 필요한 시간이 점점 길어지고 있다. 특히 갑작스럽게 전원공급이 중단되거나 오류로 인해 비정상적인 종료가 발생하면 복구시간은 더 길어질 수 있으며, 이러한 문제는 실시간 저장 매체로서 활용될 수 있는 플래시 파일 시스템의 가용성을 낮게 하여 신뢰성을 떨어뜨리는 요인이 된다. 본 논문에서는 플래시 파일 시스템의 가용성을 높이기 위한 빠른 마운트 기법을 제안한다. 제안 기법은 스마트 체크포인팅 알고리즘을 이용하여 체크포인트의 가용성을 높이는 방법이다. 제안된 기법을 NAND 플래시 전용 파일 시스템인 YAFFS2에 구현하였고, 성능 분석 결과 기존의 기법에 비해 쓰기 빈도가 동적인 환경에서 마운트 시간을 최대 30%정도 줄이는 효과가 있었다.

A Design of a Flash Memory Swapping File System using LFM (LFM 기법을 이용한 플래시 메모리 스와핑 파일 시스템 설계)

  • Han, Dae-Man;Koo, Yong-Wan
    • Journal of Internet Computing and Services
    • /
    • v.6 no.4
    • /
    • pp.47-58
    • /
    • 2005
  • There are two major type of flash memory products, namely, NAND-type and NOR-type flash memory. NOR-type flash memory is generally deployed as ROM BIOS code storage because if offers Byte I/O and fast read operation. However, NOR-type flash memory is more expensive than NAND-type flash memory in terms of the cost per byte ratio, and hence NAND type flash memory is more widely used as large data storage such as embedded Linux file systems. In this paper, we designed an efficient flash memory file system based an Embedded system and presented to make up for reduced to Swapping a weak System Performance to flash file system using NAND-type flash memory, then proposed Swapping algorithm insured to an Execution time. Based on Implementation and simulation studies, Then, We improved performance bases on NAND-type flash memory to the requirement of the embedded system.

  • PDF

An Efficient Recovering Method for A NAND Flash File System (NAND 플래시 파일 시스템을 위한 효율적인 복구 기법)

  • Lee, Seung-Hwan;Lee, Tea-Hoon;Chung, Ki-Dong
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.10b
    • /
    • pp.383-387
    • /
    • 2007
  • 본 논문은 NAND 플래시 메모리를 기반으로 한 임베디드 시스템에서 예기치 않은 오류에 대해 데이터 일관성 지원하는 파일 시스템을 제안 한다. 플래시 메모리는 하드디스크에 비해 작고, 내구성, 저 전력, 읽기속도 등 많은 부분에서 장점을 지니고 있어 임베디드 기기에 유리하다. 하지만 제자리 덮어쓰기가 되지 않고 추가적인 연산을 통해 지움 연산을 해야 하는 단점이 있다. 본 논문에서는 이미지 로그를 사용하여 시스템의 비정상적인 종료를 판단하고 플래시 메모리의 외부 갱신 쓰기 특징을 이용하여 파일 연산 전후 메타데이터의 타입을 다르게 하여 추가적인 로그 쓰기 연산 없이 파일 연산 중 오류를 판단하고 이전의 데이터로 복구론 할 수 있는 파일 시스템을 제안 한다. 또한 빠른 마운트를 지원 하는 파일 시스템에 복구 기법을 추가하고 마운트 시간을 실험 하였다. 실험 결과 정상적인 종료 시 YAFFS에 비해 $76%{\sim}85%$ 마운트 시간을 감소 시켰고 비정상 적인 종료로 인해 오류 복구를 해야 할 때 마운트 시간은 YAFFS에 비해 $40%{\sim}60%$감소 시켰다. 그리고 파일에 대한 연산 시간도 YAFFS 와 차이가 없었다.

  • PDF

The Study on Forensic Methodology of Firefox OS (Firefox OS 포렌식 기법에 관한 연구)

  • Kim, Do-Su;Choi, Jong-hyun;Lee, Sang-jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.5
    • /
    • pp.1167-1174
    • /
    • 2015
  • As the market share of smartphone exponentially increases in mobile market, a number of manufacturers have developed their own operating system. Firefox OS is an open source operating system for the smartphone and tablet which is being developed by the Mozilla Foundation. This OS is designed using JavaScript and operated based on HTML5. Even though the number of manufacturers which release the Firefox OS smartphone is consistently increasing, However it is difficult to analyze artifacts in a smartphone in terms of investigation since existing researches on Firefox OS focused on imaging velocity according to abstract forensic process and block size. In this paper, we propose how to collect data in Firefox OS while minimizing data loss and forensic analysis framework based on analysis results on system and user data leaving in a smartphone.

A Fast Mount and Stability Scheme for a NAND Flash Memory-based File System (NAND 플래시 메모리 기반 파일 시스템을 위한 빠른 마운트 및 안정성 기법)

  • Park, Sang-Oh;Kim, Sung-Jo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.12
    • /
    • pp.683-695
    • /
    • 2007
  • NAND flash memory-based file systems cannot store their system-related information in the file system due to wear-leveling of NAND flash memory. This forces NAND flash memory-based file systems to scan the whole flash memory during their mounts. The mount time usually increases linearly according to the size of and the usage pattern of the flash memory. NAND flash memory has been widely used as the storage medium of mobile devices. Due to the fact that mobile devices have unstable power supply, the file system for NAND flash memory requires stable recovery mechanism from power failure. In this paper, we present design and implementation of a new NAND flash memory-based file system that provides fast mount and enhanced stability. Our file system mounts 19 times faster than JFFS2's and 2 times faster than YAFFS's. The stability of our file system is also shown to be equivalent to that of JFFS2.

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.