• Title/Summary/Keyword: overwrite

Search Result 45, Processing Time 0.023 seconds

Cost Models of Energy-based Query Optimization for Flash-aware Embedded DBMS (플래시 기반 임베디드 DBMS의 전력기반 질의 최적화를 위한 비용 모델)

  • Kim, Do-Yun;Park, Sang-Won
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.3
    • /
    • pp.75-85
    • /
    • 2008
  • The DBMS are widely used in embedded systems. The flash memory is used as a storage device of a embedded system. The optimizer of existing database system assumes that the storage device is disk. There is overhead to overwrite on flash memory unlike disk. The block of flash memory should be erased before write. Due to this reason, query optimization model based on disk does not adequate for flash-aware database. Especially embedded system should minimize the consumption of energy, but consumes more energy because of excessive erase operations. This paper proposes new energy based cost model of embedded database and shows the comparison between disk based cost model and energy based cost model.

A Study on Flash Memory Management Techniques (플래시메모리의 관리 기법 연구)

  • Kim, Jeong-Joon;Chung, Sung-Taek
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.4
    • /
    • pp.143-148
    • /
    • 2017
  • Flash Memory which is light and strong external shock as storage of small electronics like smartphone, digital camera, car black box has been widely used. Since the operation speed of the read operation and the write operation are different from each other, and the flash memory has the feature that it is not possible to overwrite, the delete operation is added to solve these problems. Wear-leveling must also be considered, since the number of erase times of the flash memory is limited. Many studies have been conducted on the substitutional algorithms of flash memory based on these characteristics of recent flash memories. So, to solve the problem that has existing buffer replacement algorithm this thesis divide page into 6 groups and when proposed algorithm select victim page, it consider reference page frequency and page recency.

A Device of Static Buffer Overflow Detection by using Function Summary and Tracking Information Flow of Buffer Domain (함수요약 및 버퍼의 도메인 정보흐름 추적에 의한 정적 버퍼넘침 탐지방안)

  • Lee, Hyung-Bong;Park, Jeong-Hyun;Park, Hyun-Mee
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.6
    • /
    • pp.703-714
    • /
    • 2001
  • In C language, a local buffer overflow in stack can destroy control information stored near the buffer. In case the buffer overflow is used maliciously to overwrite the stored return address, the system is exposed to serious security vulnerabilities. This paper analyzes the process of buffer overflow hacking and methodologies to avoid the attacks in details. And it proposes a device of static buffer overflow detection by using function summary and tracking information flow of buffer domain at assembly source code level(SASS, Static Assembly Source code Scanner) and then show the feasibility and validity of it by implementing a prototype in Pentium based Linux environment.

  • PDF

An Efficient Buffer Page Replacement Strategy on Flash Memory (플래시 메모리상에서 효율적인 버퍼 페이지 교체 기법)

  • Park Jongmin;Park Dong-Joo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11b
    • /
    • pp.172-174
    • /
    • 2005
  • 플래시 메모리는 오늘날 다양한 형태로 우리 생활의 일부를 차지하고 있다. 휴대 전화기, MP3 플레이에, PDA등과 같은 모바일제품, 이동식 저장매체, 유비쿼터스 컴퓨팅 환경 등에 광범위하게 활용되고 있다. 이처럼 많은 분야에서 사용되는 주된 이유는 플래시 메모리의 장점인 저전력 비휘발성, 고성능, 물리적 안정성, 휴대성을 갖기 때문이다. 더불어 최근에는 Gb급 플래시 메모리도 개발되어 하드디스크의 자리를 대체할 수 있는 상황에 이르렀다. 하지만, 플래시 메모리는 하드디스크와 달리 이미 데이터가 기록된 블록에 대해 덮어쓰기(overwrite)가 되지 않는다는 특성을 갖고 있다. 덮어쓰기 위해서는 해당 블록을 지우고(즉, 소거(erase)) 쓰기 작업을 수행해야 한다. 이로 인해 플래시 메모리의 데이터 읽기/쓰기/소거에 비용이 하드 디스크와 같이 동일한 것이 아니라 서로 다르다(읽기 비용을 1로 가정할 경우 쓰기와 소거는 각각 8, 65)[1][5][6]. 따라서 OS, DBMS 등과 같은 시스템 소프트웨어에서 사용된 기존 버퍼 교체 기법은 플래시 메모리의 특성이 고려되지 않았기 때문에 플래시 메모리의 특성을 고려한 효율적인 버퍼 교체기법이 필요하다. 본 논문에서는 플래시 메모리의 서로 다른 연산 비용 고려한 새로운 버퍼 교체 기법을 제안한다.

  • PDF

Phase-change optical media for computer data storage (컴퓨터 정보저장용 상변화형 광기록매체)

  • 김명룡
    • Electrical & Electronic Materials
    • /
    • v.8 no.2
    • /
    • pp.229-236
    • /
    • 1995
  • Multimedia has created a system environment that needs a combination of diverse peripherals, faster I/O, and easier configuration. The sheer volume of data one can expect with multimedia hardware and applications storage systems of higher capacity and faster data transfer rate. Unlike the magneto-optical(MO)disk technology which uses bias magnetic field in writing, both the reading and the writing in the phase change (PC) technology are performed only by laser light. In PC optical media, an active layer is reversibly converted between amorphous state and crystalline state by changing irradiation conditions of focused laser beam. Thus, as compared with MO disk, the PC disk has such great advantages that signals can be reproduced by change of reflectance of laser beams in the same manner as the compact disc. The reflectivity of a phase-change spot can be altered in a single pass under the head only through modulation of laser power. The principles and the current status of phase-change optical recording media combined with possible applications are discussed in the present article.

  • PDF

Performance Evaluation of Fixed-Grid File Index on NAND Flash Memory (NAND 플래쉬메모리에서 고정그리드화일 색인의 성능 평가)

  • Kim, Dong-Hyun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.2
    • /
    • pp.275-282
    • /
    • 2015
  • Since a NAND-flash memory is able to keep data during electricity-off and has small cost to store data per bytes, it is widely used on hand-held devices. It is necessary to use an index in order to process mass data effectively on the flash memory. However, since the flash memory requires high cost for a write operation and does not support an overwrite operation, it is possible to reduce the performance of the index when the disk based index is exploited. In this paper, we implement the fixed grid file index and evaluate the performance of the index on various conditions. To do this, we measure the average processing time by the ratio of query operations and update operations. We also the compare the processing times of the flash memory with those of the magnetic disk.

A Survey of the Index Schemes based on Flash Memory (NAND 플래쉬메모리 기반 색인에 관한 연구)

  • Kim, Dong-Hyun;Ban, Chae-Hoon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.10
    • /
    • pp.1529-1534
    • /
    • 2013
  • Since a NAND-flash memory is able to store mass data in a small sized chip and consumes low power, it is exploited on various hand-held devices, such as a smart phone and a sensor node, etc. To process efficiently mass data stored in the flash memory, it is required to use an index. However, since the write operation of the flash memory is slower than the read operation and an overwrite operation is not supported, the usage of existing index schemes degrades the performance of the index. In this paper, we survey the previous researches of index schemes for the flash memory and classify the researches by the methods to solve problems. We also present the performance factor to be considered when we design the index scheme on the flash memory.

Block Unit Mapping Technique of NAND Flash Memory Using Variable Offset

  • Lee, Seung-Woo;Ryu, Kwan-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.8
    • /
    • pp.9-17
    • /
    • 2019
  • In this paper, we propose a block mapping technique applicable to NAND flash memory. In order to use the NAND flash memory with the operating system and the file system developed on the basis of the hard disk which is mainly used in the general PC field, it is necessary to use the system software known as the FTL (Flash Translation Layer). FTL overcomes the disadvantage of not being able to overwrite data by using the address mapping table and solves the additional features caused by the physical structure of NAND flash memory. In this paper, we propose a new mapping method based on the block mapping method for efficient use of the NAND flash memory. In the case of the proposed technique, the data modification operation is processed by using a blank page in the existing block without using an additional block for the data modification operation, thereby minimizing the block unit deletion operation in the merging operation. Also, the frequency of occurrence of the sequential write request and random write request Accordingly, by optimally adjusting the ratio of pages for recording data in a block and pages for recording data requested for modification, it is possible to optimize sequential writing and random writing by maximizing the utilization of pages in a block.

Hot Data Verification Method Considering Continuity and Frequency of Write Requests Using Counting Filter

  • Lee, Seung-Woo;Ryu, Kwan-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.6
    • /
    • pp.1-9
    • /
    • 2019
  • Hard disks, which have long been used as secondary storage in computing systems, are increasingly being replaced by solid state drives (SSDs), due to their relatively fast data input / output speeds and small, light weight. SSDs that use NAND flash memory as a storage medium are significantly different from hard disks in terms of physical operation and internal operation. In particular, there is a feature that data overwrite can not be performed, which causes erase operation before writing. In order to solve this problem, a hot data for frequently updating a data for a specific page is distinguished from a cold data for a relatively non-hot data. Hot data identification helps to improve overall performance by identifying and managing hot data separately. Among the various hot data identification methods known so far, there is a technique of recording consecutive write requests by using a Bloom filter and judging the values by hot data. However, the Bloom filter technique has a problem that a new bit array must be generated every time a set of items is changed. In addition, since it is judged based on a continuous write request, it is possible to make a wrong judgment. In this paper, we propose a method using a counting filter for accurate hot data verification. The proposed method examines consecutive write requests. It also records the number of times consecutive write requests occur. The proposed method enables more accurate hot data verification.

A wear-leveling improving method by periodic exchanging of cold block areas and hot block areas (Cold 블록 영역과 hot 블록 영역의 주기적 교환을 통한 wear-leveling 향상 기법)

  • Jang, Si-Woong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.175-178
    • /
    • 2008
  • While read operation on flash memory is fast and doesn't have any constraints, flash memory can not be overwritten on updating data, new data are updated in new area. If data are frequently updated, garbage collection, which is achieved by erasing blocks, should be performed to reclaim new area. Hence, because the number of erase operations is limited due to characteristics of flash memory, every block should be evenly written and erased. However, if data with access locality are processed by cost benefit algorithm with separation of hot block and cold block, though the performance of processing is high, wear-leveling is not even. In this paper, we propose CB-MG (Cost Benefit between Multi Group) algorithm in which hot data are allocated in one group and cold data in another group, and in which role of hot group and cold group is exchanged every period. Experimental results show that performance and wear-leveling of CB-MG provide better results than those of CB-S.

  • PDF