• Title/Summary/Keyword: Fast Storage

Search Result 555, Processing Time 0.028 seconds

Design and Implementation of an Efficient FTL for Large Block Flash Memory using Improved Hybrid Mapping (향상된 혼합 사상기법을 이용한 효율적인 대블록 플래시 메모리 변환계층 설계 및 구현)

  • Park, Dong-Joo;Kwak, Kyoung-Hoon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.1
    • /
    • pp.1-13
    • /
    • 2009
  • Flash memory is widely used as a storage medium of mobile devices such as MP3 players, cellular phones and digital cameras due to its tiny size, low power consumption and shock resistant characteristics. Currently, there are many studies to replace HDD with flash memory because of its numerous strong points. To use flash memory as a storage medium, FTL(Flash Translation Layer) is required since flash memory has erase-before-write constraints and sizes of read/write unit and erase unit are different from each other. Recently, new type of flash memory called "large block flash memory" is introduced. The large block flash memory has different physical structure and characteristics from previous flash memory. So existing FTLs are not efficiently operated on large block flash memory. In this paper, we propose an efficient FTL for large block flash memory based on FAST(Fully Associative Sector Translation) scheme and page-level mapping on data blocks.

Development of Flash Memory Management Algorithm (플래쉬 메모리 관리 알고리즘 개발)

  • Park, In-Gyu
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.38 no.1
    • /
    • pp.26-45
    • /
    • 2001
  • The Flash memory market: is an exciting market that has quickly over the last 10 years. Recently Flash memory provides a high-density. truly non-volatile, high performance read write memory solutions, also is characterized by low power consumption, extreme ruggedness and high reliability. Flash memory is an optimum solution for large nonvolitilc storage operations such as solid file storage, digital video recorder, digital still camera, The MP3 player and other portable multimedia communication applications requiring non-volatility. Regardless of the type of Flash memory, Flash media management software is always required to manage the larger Flash memory block partitions. This is true, since Flash memory cannot be erased on the byte level common to memory, but must be erased on a block granularity. The management of a Flash memory manager requires a keen understanding of a Flash technology and data management methods. Though Flash memory's write performance is relatively slow, the suggested algorithm offers a higher maximum write performance. Algorithms so far developed is not suitable for applications which is requiring more fast and frequent accesses. But, the proposed algorithm is focused on the justifiable operation even in the circumstance of fast and frequent accesses.

  • PDF

Scaling down data/index page structure of the NVRAM based DBMS with the small size blocks (소형 블록 DBMS의 데이터/인덱스 페이지 구조 소형화를 통한 NVRAM 성능 개선)

  • Bae, Sang-Hee;Lee, Taehwa;Cha, Jaehyuk
    • Journal of Digital Contents Society
    • /
    • v.14 no.1
    • /
    • pp.15-23
    • /
    • 2013
  • In response to the demands of large-scale data processing with low-power and new application, a storage system using SSD (Solid State Disk/Drive) with fast input-output performance instead of hard disc has appeared as storage device. Studies on methods to overcome specific problems of SSD such as various processing data units, out-place-update and limited delete count have been actively conducted. However, declining performance and stability have not been resolved yet when storing case specific data with small scale that causes frequent random write in hard disc or SSD. This thesis suggests a system structure that stores index requesting frequent random write in NVRAM capable of byte access by using characteristics such as byte unit fast read / write of NVRAM, non-volatile and smaller size of actual changed data size in index page than block size.

Fast Mask Operators for the edge Detection in Vision System (시각시스템의 Edge 검출용 고속 마스크 Operator)

  • 최태영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.11 no.4
    • /
    • pp.280-286
    • /
    • 1986
  • A newmethod of fast mask operators for edge detection is proposed, which is based on the matrix factorization. The output of each component in the multi-directional mask operator is obtained adding every image pixels in the mask area weighting by corresponding mask element. Therefore, it is same as the result of matrix-vector multiplication like one dimensional transform, i, e, , trasnform of an image vector surrounded by mask with a transform matrix consisted of all the elements of eack mask row by row. In this paper, for the Sobel and Prewitt operators, we find the transform matrices, add up the number of operations factoring these matrices and compare the performances of the proposed method and the standard method. As a result, the number of operations with the proposed method, for Sobel and prewitt operators, without any extra storage element, are reduced by 42.85% and 50% of the standard operations, respectively and in case of an image having 100x100 pixels, the proposed Sobel operator with 301 extra storage locations can be computed by 35.93% of the standard method.

  • PDF

Efficient Indexing for Large DNA Sequence Databases (대용량 DNA 시퀀스 데이타베이스를 위한 효율적인 인덱싱)

  • Won Jung-Im;Yoon Jee-Hee;Park Sang-Hyun;Kim Sang-Wook
    • Journal of KIISE:Databases
    • /
    • v.31 no.6
    • /
    • pp.650-663
    • /
    • 2004
  • In molecular biology, DNA sequence searching is one of the most crucial operations. Since DNA databases contain a huge volume of sequences, a fast indexing mechanism is essential for efficient processing of DNA sequence searches. In this paper, we first identify the problems of the suffix tree in aspects of the storage overhead, search performance, and integration with DBMSs. Then, we propose a new index structure that solves those problems. The proposed index consists of two parts: the primary part represents the trie as bit strings without any pointers, and the secondary part helps fast accesses of the leaf nodes of the trio that need to be accessed for post processing. We also suggest an efficient algorithm based on that index for DNA sequence searching. To verify the superiority of the proposed approach, we conducted a performance evaluation via a series of experiments. The results revealed that the proposed approach, which requires smaller storage space, achieves 13 to 29 times performance improvement over the suffix tree.

Isotopic Fissile Assay of Spent Fuel in a Lead Slowing-Down Spectrometer System

  • Lee, Yongdeok;Jeon, Juyoung;Park, Changje
    • Nuclear Engineering and Technology
    • /
    • v.49 no.3
    • /
    • pp.549-555
    • /
    • 2017
  • A lead slowing-down spectrometer (LSDS) system is under development to analyze isotopic fissile content that is applicable to spent fuel and recycled material. The source neutron mechanism for efficient and effective generation was also determined. The source neutron interacts with a lead medium and produces continuous neutron energy, and this energy generates dominant fission at each fissile, below the unresolved resonance region. From the relationship between the induced fissile fission and the fast fission neutron detection, a mathematical assay model for an isotopic fissile material was set up. The assay model can be expanded for all fissile materials. The correction factor for self-shielding was defined in the fuel assay area. The corrected fission signature provides well-defined fission properties with an increase in the fissile content. The assay procedure was also established. The assay energy range is very important to take into account the prominent fission structure of each fissile material. Fission detection occurred according to the change of the Pu239 weight percent (wt%), but the content of U235 and Pu241 was fixed at 1 wt%. The assay result was obtained with 2~3% uncertainty for Pu239, depending on the amount of Pu239 in the fuel. The results show that LSDS is a very powerful technique to assay the isotopic fissile content in spent fuel and recycled materials for the reuse of fissile materials. Additionally, a LSDS is applicable during the optimum design of spent fuel storage facilities and their management. The isotopic fissile content assay will increase the transparency and credibility of spent fuel storage.

Design of Interactive Operations using Prefetching in VoD System (VoD 시스템에서 선반입 기법을 이용한 대화식 동작의 설계)

  • Kim, Soon-Cheol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.15 no.2
    • /
    • pp.31-39
    • /
    • 2010
  • VoD(Video-on-Demand) servers have to provide timely processing guarantees for continuous media and reduce the storage and bandwidth requirements for continuous media. The compression techniques make the bit rates of compressed video data significantly variable from frame to frame. A VoD system should be able to provide the client with interactive operations such as fast forward and fast rewind in addition to normal playback of movie. However, interactive operations require additional resources such as storage space, disk bandwidth, memory and network bandwidth. In a stored video application such as VoD system, it is possible that a priori disk access patterns can be used to reserve the system resources in advance. In addition, clients of VoD server spend most of their time in playback mode and the period of time spent in interactive mode is relatively small. In this paper, I present the new buffer management scheme that provides efficient support for interactive operations in a VoD server using variable bit rate continuous media. Simulation results show that our strategy achieves 34% increase of the number of accepted clients over the LRU strategy.

Optimization of Yonsei Single-Photon Emission Computed Tomography (YSECT) Detector for Fast Inspection of Spent Nuclear Fuel in Water Storage

  • Hyung-Joo Choi;Hyojun Park;Bo-Wi Cheon;Kyunghoon Cho;Hakjae Lee;Yong Hyun Chung;Yeon Soo Yeom;Sei Hwan You;Hyun Joon Choi;Chul Hee Min
    • Journal of Radiation Protection and Research
    • /
    • v.49 no.1
    • /
    • pp.29-39
    • /
    • 2024
  • Background: The gamma emission tomography (GET) device has been reported a reliable technique to inspect partial defects within spent nuclear fuel (SNF) of pin-by-pin level. However, the existing GET devices have low accuracy owing to the high attenuation and scatter probability for SNF inspection condition. The purpose of this study is to design and optimize a Yonsei single-photon emission computed tomography version 2 (YSECT.v.2) for fast inspection of SNF in water storage by acquisition of high-quality tomographic images. Materials and Methods: Using Geant4 (Geant4 Collaboration) and DETECT-2000 (Glenn F. Knoll et al.) Monte Carlo simulation, the geometrical structure of the proposed device was determined and its performance was evaluated for the 137Cs source in water. In a Geant4-based assessment, proposed device was compared with the International Atomic Energy Agency (IAEA)-authenticated device for the quality of tomographic images obtained for 12 fuel sources in a 14 × 14 Westinghouse-type fuel assembly. Results and Discussion: According to the results, the length, slit width, and septal width of the collimator were determined to be 65, 2.1, and 1.5 mm, respectively, and the material and length of the trapezoidal-shaped scintillator were determined to be gadolinium aluminum gallium garnet and 45 mm, respectively. Based on the results of performance comparison between the YSECT.v.2 and IAEA's device, the proposed device showed 200 times higher performance in gamma-detection sensitivity and similar source discrimination probability. Conclusion: In this study, we optimally designed the GET device for improving the SNF inspection accuracy and evaluated its performance. Our results show that the YSECT.v.2 device could be employed for SNF inspection.

Data Stream Storing Techniques for Supporting Hybrid Query (하이브리드 질의를 위한 데이터 스트림 저장 기술)

  • Shin, Jae-Jyn;You, Byeong-Seob;Eo, Sang-Hun;Lee, Dong-Wook;Bae, Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.11
    • /
    • pp.1384-1397
    • /
    • 2007
  • This paper proposes fast storage techniques for hybrid query of data streams. DSMS(Data Stream Management System) have been researched for processing data streams that have busting income. To process hybrid query that retrieve both current incoming data streams and past data streams data streams have to be stored into disk. But due to fast input speed of data stream and memory and disk space limitation, the main research is not about querying to stored data streams but about querying to current incoming data streams. Proposed techniques of this paper use circular buffer for maximizing memory utility and for make non blocking insertion possible. Data in a disk is compressed to maximize the number of data in the disk. Through experiences, proposed technique show that bursting insertion is stored fast.

  • PDF

An Efficient Log Buffer Management Scheme of Flash Memory Through Delay of Merging Hot Data Blocks (HOT 데이터 블록 병합 지연을 이용한 효율적인 플래시 메모리 로그 버퍼 관리 기법)

  • Kim, Hak-Chul;Park, Yong-Hun;Yun, Jong-Hyeong;Seo, Dong-Min;Song, Suk-Il;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.1
    • /
    • pp.68-77
    • /
    • 2010
  • In this paper, we propose a new log buffer management scheme considering the accessibility of the data. Our proposed scheme evaluates the worth of the merge of log blocks. It conducts the merge operations between infrequently updated data and the data blocks and postpones as much as possible the merge operations between frequently updated data and the data blocks. As a result, the proposed method prevents the unnecessary merge operations, reduces the number of the erase operations, and improves the utilization of the flash memory storage. In order to show the superiority of the proposed scheme, we compare it with BAST and FAST. It is shown through performance evaluation that the proposed method achieves about 25% and 65% performance improvements over BAST and FAST on average in terms of the number of the erase operations.