• 제목/요약/키워드: mapping space

Search Result 1,041, Processing Time 0.031 seconds

A Mapping Table Caching Scheme for NAND Flash-based Mobile Storage Devices (NAND 플래시 기반 모바일 저장장치를 위한 사상 테이블 캐싱 기법)

  • Yang, Soo-Hyeon;Ryu, Yeon-Seung
    • The Journal of Society for e-Business Studies
    • /
    • v.15 no.4
    • /
    • pp.21-31
    • /
    • 2010
  • Recently e-business such as online financial trade and online shopping using mobile computes are widely spread. Most of mobile computers use NAND flash memory-based storage devices for storing data. Flash memory storage devices use a software called flash translation layer to translate logical address from a file system to physical address of flash memory by using mapping tables. The legacy FTLs have a problem that they must maintain very large mapping tables in the RAM. In order to address this issues, in this paper, we proposed a new caching scheme of mapping tables. We showed through the trace-driven simulations that the proposed caching scheme reduces the space overhead dramatically but does not increase the time overhead. In the case of online transaction workload in e-business environment, in particular, the proposed scheme manifests better performance in reducing the space overhead.

Hardware/Software Partitioning Methodology for Reconfigurable System (재구성형 시스템을 위한 하드웨어/소프트웨어 분할 기법)

  • Kim, Jun-Yong;Ahn, Seong-Yong;Lee, Jeong-A.
    • The KIPS Transactions:PartA
    • /
    • v.11A no.5
    • /
    • pp.303-312
    • /
    • 2004
  • In this paper, we propose a methodology solving the problem of the hardware-software partitioning in reconfigurable systems using a Y-chart design space exploration and implement a simulator according to the methodology. The methodology generates a mapping set between tasks and hardware elements using the hardware element model and the application model. We evaluate the throughput by simulating cases in each mapping set. With the throughput evaluation result, we can select the mapping case with the highest throughput. We also propose an heuristic improving the simulation time by reducing the mapping set on the basis of the relationship between workload and parallelism. Simulation results show that we can reduce the size of mapping set which poses difficulties on hardware-software partitioning by up to 80%.

Static Aeroelastic Analysis for Aircraft Wings using CFD/CST Coupling Methodology (전산유체/전산구조 연계 방법을 사용한 항공기날개의 정적 공탄성 해석)

  • Choi, Dong-Soo;Jun, Sang-Ook;Kim, Byung-Kon;Park, Soo-Hyun;Lee, Dong-Ho;Lee, Kyung-Tae;Jun, Seung-Moon;Cho, Maeng-Hyo
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.35 no.4
    • /
    • pp.287-294
    • /
    • 2007
  • A static aeroelastic analysis for supersonic aircraft wing equipped with external store under the wing lower surface is performed using computational fluid dynamics (CFD) and computational structural technology(CST) coupling methodology. Two mapping algorithms, which are the pressure mapping algorithm and the displacement mapping algorithm, are used for CFD/CST coupling. A three-dimensional unstructured Euler code and finite element analysis program are used to calculate the flow properties and the structural displacements, respectively. The coupling procedure is repeated in an iterative manner until a specified convergence criterion is satisfied. Static aeroelastic analysis for a typical supersonic flight wing is performed and final converged wing configuration is obtained after several iterations.