• Title/Summary/Keyword: Storage Buffer

Search Result 262, Processing Time 0.032 seconds

Hybrid Memory Adaptor for OpenStack Swift Object Storage (OpenStack Swift 객체 스토리지를 위한 하이브리드 메모리 어댑터 설계)

  • Yoon, Su-Kyung;Nah, Jeong Eun
    • Journal of the Semiconductor & Display Technology
    • /
    • v.19 no.3
    • /
    • pp.61-67
    • /
    • 2020
  • This paper is to propose a hybrid memory adaptor using next-generation nonvolatile memory devices such as phase-change memory to improve the performance limitations of OpenStack-based object storage systems. The proposed system aims to improve the performance of the account and container servers for object metadata management. For this, the proposed system consists of locality-based dynamic page buffer, write buffer, and nonvolatile memory modules. Experimental results show that the proposed system improves the hit rate by 5.5% compared to the conventional system.

A Simple Procedure for RNA Isolation from Plants and Preservation of Plant Material for RNA Analysis (간편한 고등식물 RNA 분이 방법)

  • Hong, Choo-Bong;Jeon, Jae-Heung
    • Journal of Plant Biology
    • /
    • v.30 no.3
    • /
    • pp.201-203
    • /
    • 1987
  • Total RNA was isolated from two months old wheat, rice, tobacco and sweet potato. The procedure used was simple and provided pure RNA preparation. Lysis of plant tissue in a buffer with guanidine thiocyanate and CsCl density gradient centrifugation separated RNA from the rest of the cellular components. Subsequent cholroform/1-butanol extraction and ethanol precipitation were necessary to ensure contaminant-free RNA preparation. Storage of the lysed plant tissue in the buffer with guanidine thiocyanate preserved the sample for two months without noticeable RNA degradation.

  • PDF

Wear characteristics of boron nitride thin film for durability improvement of ultra- precision component (초정밀 부품의 내구성 향상을 위한 질화붕소 박막의 마멸 특성에 관한 연구)

  • Ku, Kyoung-Jin;Hwang, Byoung-Har;Lin, Li-Yu;Kim, Dae-Eun;Baik, Hong-Koo
    • Transactions of the Society of Information Storage Systems
    • /
    • v.3 no.3
    • /
    • pp.129-134
    • /
    • 2007
  • Boron nitride (BN) is a highly attractive material for wear resistant applications of mechanical components. BN is super hard and it is the second hardest of all known materials. It also has a high thermal stability, high abrasive wear resistance, and in contrast to diamond, BN does not react with ferrous materials. The motivation of this work is to investigate the tribological properties of BN for potential applications in ultra-precision components for data storage, printing, and other precision devices. In this work, the wear characteristics of BN thin films deposited on DLC or Ti buffer layer with silicon substrate using RF-magnetron sputtering technique were analyzed. Wear tests were conducted by using a pin-on-disk type tester and the wear tracks were measured with a surface profiler. Experimental results showed that wear characteristics were dependent on the sputtering conditions and buffer layer. Particularly, BN coated on DLC layer showed better wear resistant behavior. The range of the wear rates for the BN films tested in this work was about 20 to $100{\mu}m^3$/cycle.

  • PDF

Design and Implementation of Buffer Cache for EXT3NS File System (EXT3NS 파일 시스템을 위한 버퍼 캐시의 설계 및 구현)

  • Sohn, Sung-Hoon;Jung, Sung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.12
    • /
    • pp.2202-2211
    • /
    • 2006
  • EXT3NS is a special-purpose file system for large scale multimedia streaming servers. It is built on top of streaming acceleration hardware device called Network-Storage card. The EXT3NS file system significantly improves streaming performance by eliminating memory-to-memory copy operations, i.e. sending video/audio from disk directly to network interface with no main memory buffering. In this paper, we design and implement a buffer cache mechanism, called PMEMCACHE, for EXT3NS file system. We also propose a buffer cache replacement method called ONS for the buffer cache mechanism. The ONS algorithm outperforms other existing buffer replacement algorithms in distributed multimedia streaming environment. In EXT3NS with PMEMCACHE, operation is 33MB/sec and random read operation is 2.4MB/sec. Also, the buffer replacement ONS algorithm shows better performance by 600KB/sec than other buffer cache replacement policies. As a result PMEMCACHE and an ONS can greatly improve the performance of multimedia steaming server which should supportmultiple client requests at the same time.

Integrated Storage System For Automobile Production Line (자동차 생산라인을 위한 통합창고 시스템)

  • Kim, Duksu;Seo, Yoonho
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.37 no.2
    • /
    • pp.1-8
    • /
    • 2014
  • The automobile manufacture is a typical integrated assembly production that the numerous parts are committed sequentially to the assembly line. In this type of automobile manufacture, WBS (white body storage) and PBS (paint body storage) are operated to adjust the production sequence and to buffer. Starvation (impossibility of production owing to the insufficient supply) or blocking (impossibility of production owing to the over capacity) could occur in some chance, hence, both storages (WBS, PBS) are integrated as a prevention. This system is called integrated storage. In this paper, we suggest the simulation model of 'WBS-PBS integrated storage' and methodology of operation considering both 'Color grouping' and 'Option leveling.'

Expected Waiting Times for Storage and Retrieval Requests in Automated Storage and Retrieval Systems (자동창고의 저장 및 불출요구의 대기시간에 관한 연구)

  • Cho, Myeonsig;Bozer, Yavuz A.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.30 no.4
    • /
    • pp.306-316
    • /
    • 2004
  • We present a closed form approximate analytical model to estimate the expected waiting times for the storage and retrieval requests of an automated storage/retrieval (AS/R) system, assuming that the storage/retrieval (S/R) machine idles either at the rack or at the input/output point. The expected waiting times (and the associated mean queue lengths) can play an important role to decide whether the performance of a stable AS/R system is actually acceptable, to determine buffer size (or length) of the input conveyor, and to compute the number of the rack openings which is required to hold the loads which are requested by processing machines but waiting in the rack to be retrieved by the SIR machine. This model can be effectively used in the early design stage of an AS/R system.

Workload-Driven Adaptive Log Block Allocation for Efficient Flash Memory Management (효율적 플래시 메모리 관리를 위한 워크로드 기반의 적응적 로그 블록 할당 기법)

  • Koo, Duck-Hoi;Shin, Dong-Kun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.2
    • /
    • pp.90-102
    • /
    • 2010
  • Flash memory has been widely used as an important storage device for consumer electronics. For the flash memory-based storage systems, FTL (Flash Translation Layer) is used to handle the mapping between a logical page address and a physical page address. Especially, log buffer-based FTLs provide a good performance with small-sized mapping information. In designing the log buffer-based FTL, one important factor is to determine the mapping structure between data blocks and log blocks, called associativity. While previous works use static associativity fixed at the design time, we propose a new log block mapping scheme which adjusts associativity based on the run-time workload. Our proposed scheme improves the I/O performance about 5~16% compared to the static scheme by adjusting the associativity to provide the best performance.

WWCLOCK: Page Replacement Algorithm Considering Asymmetric I/O Cost of Flash Memory (WWCLOCK: 플래시 메모리의 비대칭적 입출력 비용을 고려한 페이지 교체 알고리즘)

  • Park, Jun-Seok;Lee, Eun-Ji;Seo, Hyun-Min;Koh, Kern
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.12
    • /
    • pp.913-917
    • /
    • 2009
  • Flash memories have asymmetric I/O costs for read and write in terms of latency and energy consumption. However, the ratio of these costs is dependent on the type of storage. Moreover, it is becoming more common to use two flash memories on a system as an internal memory and an external memory card. For this reason, buffer cache replacement algorithms should consider I/O costs of device as well as possibility of reference. This paper presents WWCLOCK(Write-Weighted CLOCK) algorithm which directly uses I/O costs of devices along with recency and frequency of cache blocks to selecting a victim to evict from the buffer cache. WWCLOCK can be used for wide range of storage devices with different I/O cost and for systems that are using two or more memory devices at the same time. In addition to this, it has low time and space complexity comparable to CLOCK algorithm. Trace-driven simulations show that the proposed algorithm reduces the total I/O time compared with LRU by 36.2% on average.

2WPR: Disk Buffer Replacement Algorithm Based on the Probability of Reference to Reduce the Number of Writes in Flash Memory

  • Lee, Won Ho;Kwak, Jong Wook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.2
    • /
    • pp.1-10
    • /
    • 2020
  • In this paper, we propose an efficient disk buffer replacement policy which improves hit ratio and reduces writing operations of flash based storages. The flash based storage has many advantages, including a small form factor, non-volatility and high reliability, but there are problems caused by own limitations, like not-in-place update, short life cycle and asymmetric I/O latencies. To redeem these problems, this paper proposes the write weighted probability of reference(2WPR) policy. 2WPR policy predicts re-referencing probability and calculates localities of each page. Furthermore, by weighting write operations to every pages, 2WPR can reduce write operations to flash based storage. In addition, we can improve the performance with higher hit ratio and reduce the number of write operations and consequently shorten the latencies of each operation. The results show that our policy provides improvements of up to 10% for the hit ratio with the reduction of up to 5% for the flash writing operation compared with other policies.

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