• Title/Summary/Keyword: Disk Buffer

Search Result 127, Processing Time 0.036 seconds

Design Optimization Techniques for the SSD Controller (SSD 컨트롤러 최적 설계 기법)

  • Yi, Doo-Jin;Han, Tae-Hee
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.48 no.8
    • /
    • pp.45-52
    • /
    • 2011
  • Flash memory is becoming widely prevalent in various area due to high performance, non-volatile features, low power, and robust durability. As price-per-bit is decreased, NAND flash based SSDs (Solid State Disk) have been attracting attention as the next generation storage device, which can replace HDDs (Hard Disk Drive) which have mechanical properties. Especially for the single package SSD, if channel number or FIFO buffer size per channel increases to improve performance, the size of a controller and I/O pin count will increase linearly with channel numbers and form factor will be affected. We propose a novel technique which can minimize form factor by optimizing the number of NAND flash channels and the size of interface FIFO buffer in the SSD. For SSD with 10 channel and double buffer, the experimental results show that buffer block size can be reduced about 73% without performance degradation and total size of a controller can be reduced about 40% because control block per channel and I/O pin count decrease according to decrease channel number.

CPWL : Clock and Page Weight based Disk Buffer Management Policy for Flash Memory Systems

  • Kang, Byung Kook;Kwak, Jong Wook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.2
    • /
    • pp.21-29
    • /
    • 2020
  • The use of NAND flash memory is continuously increased with the demand of mobile data in the IT industry environment. However, the erase operations in flash memory require longer latency and higher power consumption, resulting in the limited lifetime for each cell. Therefore, frequent write/erase operations reduce the performance and the lifetime of the flash memory. In order to solve this problem, management techniques for improving the performance of flash based storage by reducing write and erase operations of flash memory with using disk buffers have been studied. In this paper, we propose a CPWL to minimized the number of write operations. It is a disk buffer management that separates read and write pages according to the characteristics of the buffer memory access patterns. This technique increases the lifespan of the flash memory and decreases an energy consumption by reducing the number of writes by arranging pages according to the characteristics of buffer memory access mode of requested pages.

SLAM : An Efficient Buffer Management Strategy using Spatial Locality of Spatial Data (SLAM : 공간 데이타의 공간적 근접성을 이용한 효율적인 버퍼관리기법)

  • An, Jae-Yong;Min, Jun-Gi;Jeong, Jin-Wan
    • Journal of KIISE:Databases
    • /
    • v.29 no.5
    • /
    • pp.393-403
    • /
    • 2002
  • One of the major issues of DBMS is the buffer management. Because fetching data from the database disk is costly, the number of disk I/O's must be minimized in order to improve the DBMS performance. Although there have been many buffer management strategies to minimize the disk I/O, those strategies usually focused on just the temporal locality. Since there are the spatial locality as well as the temporal locality in the spatial database, strategies using only the temporal locality cannot achieve the optimal performance in the spatial database. In this paper, we propose a new buffer management strategy, the Spatial Locality Area Measure(SLAM) strategy, that considers not only the temporal locality but also the spatial locality. The SLAM buffer management strategy consists of two core structures, the SLM-tree and the M-LRU. We show the efficiency of the proposed strategy through experiments over various buffer sizes and reference frequencies.

Separation Characteristics of Whey Protein by High Performance Membrane Chromatography (고성능 막 크로마토그래피에 의한 유청 단백질의 분리특성)

  • 홍승범;노경호
    • KSBB Journal
    • /
    • v.16 no.6
    • /
    • pp.533-537
    • /
    • 2001
  • ${\alpha}$-lactalbumin and ${\beta}$-lactoglobulin in whey proteins were separated by high performance membrane chromatography (HPMC). The separation mechanism involved anion-exchange, and the stationary phase was anion CIM (Convective Interaction Media) DEAE, QA disk and cation exchanger SO$_3$(16${\times}$3 mm). Two types of mobile phase were used, buffer A (20 mM Tris-HCI, pH 7.3) and buffer B(buffer A + 1 M NaCl), As the amount of NaCl dissolved in buffer linearly increased, which enabled a gradient elution mode. The optimum mobile phase and operating condition (Buffer A/Buffer B = 100/0 - 30/70 vol%, gradient time 1 min, 30/70 - 10/90 vol.%, gradient time 2 min) were experimentally determined. In this experimental condition, ${\alpha}$-lacta1bumin, ${\beta}$-lactoglobulin were separated within 5 min at a mobile phase flow rate of 4 mL/min.

  • PDF

Adaptive Service Mode Conversion to Minimize Buffer Space Requirement in VOD Server (주문형 비디오 서버의 버퍼 최소화를 위한 가변적 서비스 모드 변환)

  • Won, Yu-Jip
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.5
    • /
    • pp.213-217
    • /
    • 2001
  • Excessive memory buffer requirement in continuous media playback is a serious impediment of wide spread usage of on-line multimedia service. Skewed access frequency of available video files provides an opportunity of re-using the date blocks which has been loaded by one session for later usage. We present novel algorithm which minimizes the buffer requirement in multiple sessions of multimedia playbacks. In continuous media playback originated from the disk, a certain amount of memory buffer is required to synchronize asynchronous disk. Read operation and synchronous playback operation. As aggregate playback bandwodth increases, larger amount of buffer needs to be allocated for this synchronization purpose. The focus of this work is to study the asymptotic behavior of the synchronization buffer requirement and to develop an algorithm coping with this excessive buffer requirement under bandwidth congestioon. We argue that in a large scale continuous media server, it may not be necessary to read the blocks for each session directly from the disk. The beauty of our work lies in the fact that it dynamically adapts to disk utilization of the server and finds the optimal way of servicinh the individual sessions while minimizing the overall buffer space requirement. Optimality of the proposed algorithm is shown by proof. The effectiveness and performance of the proposed scheme is examined via simulation.

  • PDF

FRM: Foundation-policy Recommendation Model to Improve the Performance of NAND Flash Memory

  • Won Ho Lee;Jun-Hyeong Choi;Jong Wook Kwak
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.8
    • /
    • pp.1-10
    • /
    • 2023
  • Recently, NAND flash memories have replaced magnetic disks due to non-volatility, high capacity and high resistance, in various computer systems but it has disadvantages which are the limited lifespan and imbalanced operation latency. Therefore, many page replacement policies have been studied to overcome the disadvantages of NAND flash memories. Although it is clear that these policies reflect execution characteristics of various environments and applications, researches on the foundation-policy decision for disk buffer management are insufficient. Thus, in this paper, we propose a foundation-policy recommendation model, called FRM for effectively utilizing NAND flash memories. FRM proposes a suitable page replacement policy by classifying and analyzing characteristics of workloads through machine learning. As an implementation case, we introduce FRM with a disk buffer management policy and in experiment results, prediction accuracy and weighted average of FRM shows 92.85% and 88.97%, by training dataset and validation dataset for foundation disk buffer management policy, respectively.

A Buffer Replacement Algorithm utilizing Reference Interval Information (참조 시간 간격 정보를 활용하는 버퍼 교체 알고리즘)

  • Koh, Jeong-Gook;Kim, Gil-Yong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.12
    • /
    • pp.3175-3184
    • /
    • 1997
  • To support large storage capacity and real-time characteristics of continuous media storage systems, we need to improve the performance of disk I/O subsystems. To improve the performance, we exploited buffer sharing scheme that reduces the number of disk I/Os. We utilized the advance knowledge of continuous media streams that is used to anticipate data demands, and so Promoting the sharing of blocks in buffers. In this paper, we proposed a buffer replacement algorithm that enables subsequent users requesting the same data to share buffer efficiently. The proposed algorithm manages buffers by utilizing reference interval information of blocks. In order to verify validity of the proposed algorithm, we accomplished simulation experiments and showed the results of performance improvements compared to traditional buffer replacement algorithms.

  • PDF

Corrosion and Passivation of Nickel Rotating Disk Electrode in Borate Buffer Solution (Borate 완충용액에서 니켈 회전원판전극의 부식과 부동화)

  • Kim, Younkyoo
    • Journal of the Korean Chemical Society
    • /
    • v.57 no.5
    • /
    • pp.533-539
    • /
    • 2013
  • The electrochemical corrosion and passivation of Ni rotating disk electrod in borate buffer solution was studied with potentiodynamic and electrochemical impedance spectroscopy. The mechanisms of both the active dissolution and passivation of nickel and the hydrogen evolution in reduction reaction were hypothetically established while utilizing the Tafel slope, impedance data, the rotation speed of Ni-RDE and the pH dependence of corrosion potential and current. Based on the EIS data, an equivalent circuit was suggested. In addition, carefully measured were the electrochemical parameters for specific anodic dissolution regions. It can be concluded from the data collected that the $Ni(OH)_2$ oxide film, which is primarily formed by passivation, is converted to NiO by dehydration under the influence of an electrical field.

An Efficient Recovery Technique using Global Buffer on SAN Environments (SAN 환경에서의 전역 버퍼를 이용한 효율적인 회복 기법)

  • Park, Chun-Seo;Kim, Gyeong-Bae;Lee, Yong-Ju;Park, Seon-Yeong;Sin, Beom-Ju
    • The KIPS Transactions:PartA
    • /
    • v.8A no.4
    • /
    • pp.375-384
    • /
    • 2001
  • The shared disk file systems use a technique known as file system journaling to support recovery of metadata on the SAN(Storage Area Network). In the existing journaling technique, the metadata that is dirtied by one host must be updated to disk space before some hosts access it. The system performance is decreased because the disk access number is increased. In this paper, we describe a new recovery technique using a global buffer to decrease disk I/O. It transmits the dirtied metadata into the other hosts through Fibre Channel network on the SAN instead of disk I/O and supports recovery of a critical data by journaling a data as well as metadata.

  • PDF

Advanced Disk Block Caching Algorithm for Disk I/O sub-system (디스크 입출력 서브시스템을 위한 개선된 디스크 블록 캐싱 알고리즘)

  • Jung, Soo-Mok;Rho, Kyung-Taeg
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.6
    • /
    • pp.139-146
    • /
    • 2007
  • A hard disk. which can be classified as an external storage is usually capacious and economical. In spite of the attractive characteristics and efforts on the performance improvement, however, the operation of the hard disk is apparently slower than a processor and the advancement has also been slowly conducted since it is based on mechanical process. On the other hand. the advancement of the processor has been drastically performed as semiconductor technology does. So, disk I/O sub-system becomes bottleneck of computer systems' performance. For this reason. the research on disk I/O sub-system is in progress to improve computer systems' performance. In this paper, we proposed multi-level LRU scheme and then apply it to the computer systems with buffer cache and disk cache. By applying the proposed scheme to computer systems. the average access time to ask blocks can be decreased. The efficiency of the proposed algorithm was verified by simulation results.

  • PDF