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

검색결과 841건 처리시간 0.029초

고속 데이터 처리를 위한 과학기술위성 3호 대용량 메모리 유닛의 개념 설계 (The Conceptual Design of Mass Memory Unit for High Speed Data Processing in the STSAT-3)

  • 서인호;오대수;명로훈
    • 한국항공우주학회지
    • /
    • 제38권4호
    • /
    • pp.389-394
    • /
    • 2010
  • 본 연구에서는 과학기술위성 2호와 비교 했을 때 고속의 데이터를 처리하고 대용량의 메모리를 관리해야하는 요구사항을 만족하기 위한 과학기술위성 3호 대용량 메모리 유닛의 설계 내용에 대해서 나타내었다. 이러한 요구사항을 만족하기 위해서, 두 개의 탑재체에서 각각 최대 100Mbps로 수신되는 데이터와 32Gb의 대용량 메모리를 처리하고 관리하는 역할을 FPGA가 직접 담당 하도록 설계하였다. 사용된 FPGA는 동작 속도가 빠르고 게이트 수가 많은 SRAM 기반의 Xilinx FPGA로써 우주 환경에서의 SEU를 극복하기 위해서 TMR 기법과 스크러빙 기법을 적용하고자 한다.

다중 플래시 메모리 기반 파일시스템의 성능개선을 위한 파일시스템 (File System for Performance Improvement in Multiple Flash Memory Chips)

  • 박제호
    • 반도체디스플레이기술학회지
    • /
    • 제7권3호
    • /
    • pp.17-21
    • /
    • 2008
  • Application of flash memory in mobile and ubiquitous related devices is rapidly being increased due to its low price and high performance. In addition, some notebook computers currently come out into market with a SSD(Solid State Disk) instead of hard-drive based storage system. Regarding this trend, applications need to increase the storage capacity using multiple flash memory chips for larger capacity sooner or later. Flash memory based storage subsystem should resolve the performance bottleneck for writing in perspective of speed and lifetime according to its physical property. In order to make flash memory storage work with tangible performance, reclaiming of invalid regions needs to be controlled in a particular manner to decrease the number of erasures and to distribute the erasures uniformly over the whole memory space as much as possible. In this paper, we study the performance of flash memory recycling algorithms and demonstrate that the proposed algorithm shows acceptable performance for flash memory storage with multiple chips. The proposed cleaning method partitions the memory space into candidate memory regions, to be reclaimed as free, by utilizing threshold values. The proposed algorithm handles the storage system in multi-layered style. The impact of the proposed policies is evaluated through a number of experiments.

  • PDF

Algorithmic GPGPU Memory Optimization

  • Jang, Byunghyun;Choi, Minsu;Kim, Kyung Ki
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제14권4호
    • /
    • pp.391-406
    • /
    • 2014
  • The performance of General-Purpose computation on Graphics Processing Units (GPGPU) is heavily dependent on the memory access behavior. This sensitivity is due to a combination of the underlying Massively Parallel Processing (MPP) execution model present on GPUs and the lack of architectural support to handle irregular memory access patterns. Application performance can be significantly improved by applying memory-access-pattern-aware optimizations that can exploit knowledge of the characteristics of each access pattern. In this paper, we present an algorithmic methodology to semi-automatically find the best mapping of memory accesses present in serial loop nest to underlying data-parallel architectures based on a comprehensive static memory access pattern analysis. To that end we present a simple, yet powerful, mathematical model that captures all memory access pattern information present in serial data-parallel loop nests. We then show how this model is used in practice to select the most appropriate memory space for data and to search for an appropriate thread mapping and work group size from a large design space. To evaluate the effectiveness of our methodology, we report on execution speedup using selected benchmark kernels that cover a wide range of memory access patterns commonly found in GPGPU workloads. Our experimental results are reported using the industry standard heterogeneous programming language, OpenCL, targeting the NVIDIA GT200 architecture.

DDR2 SDRAM을 이용한 비메모리 검사장비에서 정시성을 보장하기 위한 메모리 컨트롤러 개발 (Development of Memory Controller for Punctuality Guarantee from Memory-Free Inspection Equipment using DDR2 SDRAM)

  • 전민호;신현준;강철규;오창헌
    • 한국항행학회논문지
    • /
    • 제15권6호
    • /
    • pp.1104-1110
    • /
    • 2011
  • 현재의 반도체 검사장비는 테스트 패턴 프로그램을 위한 메모리로 시스템 설계가 간단하고 리프레시가 필요 없는 SRAM(static random access memory) 모듈을 채용하고 있다. 그러나 SRAM 모듈을 이용한 시스템 구성은 용량이 커질수록 장비의 부피가 증가하기 때문에 메모리 대용량화 및 장비의 소형화에 걸림돌이 되고 있다. DRAM(dynamic random access memory)을 이용하여 반도체 검사 장비를 제작할 경우 SRAM 보다 비용과 장비의 면적이 줄어드는 장점이 있지만 DRAM의 특성 상 메모리 셀 리프레시가 필요하여 정시성을 보장해야 하는 문제가 있다. 따라서 본 논문에서는 이러한 문제를 해결하기 위해 DDR2 SDRAM(double data rate synchronous dynamic random access memory)을 이용한 비메모리 검사장비에서 정시성을 보장해 주는 알고리즘을 제안하고 알고리즘을 이용한 메모리 컨트롤러를 개발하였다. 그 결과, DDR2 SDRAM을 이용할 경우 SRAM을 이용할 때 보다 가격과 면적이 줄어들어 가격측면에서는 13.5배 그리고 면적측면에서는 5.3배 이득이 있음을 확인하였다.

100 MeV 양성자가속기를 활용한 SRAM SEE(Static Random Access Memory Single Event Effect) 시험 연구 (A Study of Static Random Access Memory Single Event Effect (SRAM SEE) Test using 100 MeV Proton Accelerator )

  • 한우제;최은혜;김경희;정성근
    • 우주기술과 응용
    • /
    • 제3권4호
    • /
    • pp.333-341
    • /
    • 2023
  • 본 연구는 국내 100 MeV 양성자가속기와 우주부품시험센터 우주전문시험시설기반을 활용하여 우주부품의 우주 방사선환경 시험검증 기술을 개발하고자 한다. 우주개발의 진전에 따라 고도화된 위성의 임무는 위성의 핵심부품인 메모리 등에 고집적 회로를 필수적으로 사용하고, 태양전지, 광학센서 및 opto-electronics 등 부수 장치에 반도체 소자의 활용이 증가하고 있다. 특히, 전자부품을 우주에 적용하기 위해서는 우주환경 시험을 반드시 거쳐야 하며, 그 중 가장 중요한 것이 고 에너지 방사선환경에서의 우주부품시험이다. 따라서 이에 필요한 우주 방사선 환경 구현 시설을 갖추어 체계적인 시험절차를 수립할 필요가 있다. 한국산업기술시험원 우주부품시험센터는 메모리 부품에 대한 방사선 시험 장치를 제작하고 이를 이용한 메모리 방사선 영향 평가 시험을 수행하였다. 경주양성자가속기에서 100 MeV 양성자를 활용하여 한국에서 활용가능한 수준의 방사선 시험을 진행하였다. 이러한 시험을 통해 메모리 반도체에서 나타나는 single event upset을 관찰할 수 있었다. 향후 해당 시험을 체계화하여 우주산업화에 기반을 마련하고자 한다.

Page Replacement for Write References in NAND Flash Based Virtual Memory Systems

  • Lee, Hyejeong;Bahn, Hyokyung;Shin, Kang G.
    • Journal of Computing Science and Engineering
    • /
    • 제8권3호
    • /
    • pp.157-172
    • /
    • 2014
  • Contemporary embedded systems often use NAND flash memory instead of hard disks as their swap space of virtual memory. Since the read/write characteristics of NAND flash memory are very different from those of hard disks, an efficient page replacement algorithm is needed for this environment. Our analysis shows that temporal locality is dominant in virtual memory references but that is not the case for write references, when the read and write references are monitored separately. Based on this observation, we present a new page replacement algorithm that uses different strategies for read and write operations in predicting the re-reference likelihood of pages. For read operations, only temporal locality is used; but for write operations, both write frequency and temporal locality are used. The algorithm logically partitions the memory space into read and write areas to keep track of their reference patterns precisely, and then dynamically adjusts their size based on their reference patterns and I/O costs. Without requiring any external parameter to tune, the proposed algorithm outperforms CLOCK, CAR, and CFLRU by 20%-66%. It also supports optimized implementations for virtual memory systems.

Ethernet-Based Avionic Databus and Time-Space Partition Switch Design

  • Li, Jian;Yao, Jianguo;Huang, Dongshan
    • Journal of Communications and Networks
    • /
    • 제17권3호
    • /
    • pp.286-295
    • /
    • 2015
  • Avionic databuses fulfill a critical function in the connection and communication of aircraft components and functions such as flight-control, navigation, and monitoring. Ethernet-based avionic databuses have become the mainstream for large aircraft owning to their advantages of full-duplex communication with high bandwidth, low latency, low packet-loss, and low cost. As a new generation aviation network communication standard, avionics full-duplex switched ethernet (AFDX) adopted concepts from the telecom standard, asynchronous transfer mode (ATM). In this technology, the switches are the key devices influencing the overall performance. This paper reviews the avionic databus with emphasis on the switch architecture classifications. Based on a comparison, analysis, and discussion of the different switch architectures, we propose a new avionic switch design based on a time-division switch fabric for high flexibility and scalability. This also merges the design concept of space-partition switch fabric to achieve reliability and predictability. The new switch architecture, called space partitioned shared memory switch (SPSMS), isolates the memory space for each output port. This can reduce the competition for resources and avoid conflicts, decrease the packet forwarding latency through the switch, and reduce the packet loss rate. A simulation of the architecture with optimized network engineering tools (OPNET) confirms the efficiency and significant performance improvement over a classic shared memory switch, in terms of overall packet latency, queuing delay, and queue size.

SSD를 위한 최적화 파일시스템 (An Optimized File System for SSD)

  • 박제호
    • 반도체디스플레이기술학회지
    • /
    • 제9권2호
    • /
    • pp.67-72
    • /
    • 2010
  • Recently increasing application of flash memory in mobile and ubiquitous related devices is due to its non-volatility, fast response time, shock resistance and low power consumption. Following this trend, SSD(Solid State Disk) using multiple flash chips, instead of hard-drive based storage system, started to widely used for its advantageous features. However, flash memory based storage subsystem should resolve the performance bottleneck for writing in perspective of speed and lifetime according to its disadvantageous physical property. In order to provide tangible performance, solutions are studied in aspect of reclaiming of invalid regions by decreasing the number of erasures and distributing the erasures uniformly over the whole memory space as much as possible. In this paper, we study flash memory recycling algorithms with multiple management units and demonstrate that the proposed algorithm provides feasible performance. The proposed method utilizes the partitions of the memory space by utilizing threshold values and reconfigures the management units if necessary. The performance of the proposed policies is evaluated through a number of simulation based experiments.

Memory Allocation in Mobile Multitasking Environments with Real-time Constraints

  • Hyokyung, Bahn
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제15권1호
    • /
    • pp.79-84
    • /
    • 2023
  • Due to the rapid performance improvement of smartphones, multitasking on mobile platforms has become an essential feature. Unlike traditional desktop or server environments, mobile applications are mostly interactive jobs where response time is important, and some applications are classified as real-time jobs with deadlines. When interactive and real-time jobs run concurrently, memory allocation between multitasking applications is a challenging issue as they have different time requirements. In this paper, we study how to allocate memory space when real-time and interactive jobs are simultaneously executed in a smartphone to meet the multitasking requirements between heterogeneous jobs. Specifically, we analyze the memory size required to satisfy the constraints of real-time jobs and present a new model for allocating memory space between heterogeneous multitasking jobs. Trace-driven simulations show that the proposed model provides reasonable performance for interactive jobs while guaranteeing the requirement of real-time jobs.

Transient memory response of a thermoelectric half-space with temperature-dependent thermal conductivity and exponentially graded modulii

  • Ezzat, Magdy A.
    • Steel and Composite Structures
    • /
    • 제38권4호
    • /
    • pp.447-462
    • /
    • 2021
  • In this work, we consider a problem in the context of thermoelectric materials with memory-dependent derivative for a half space which is assumed to have variable thermal conductivity depending on the temperature. The Lamé's modulii of the half space material is taken as a function of the vertical distance from the surface of the medium. The surface is traction free and subjected to a time dependent thermal shock. The problem was solved by using the Laplace transform method together with the perturbation technique. The obtained results are discussed and compared with the solution when Lamé's modulii are constants. Numerical results are computed and represented graphically for the temperature, displacement and stress distributions. Affectability investigation is performed to explore the thermal impacts of a kernel function and a time-delay parameter that are characteristic of memory dependent derivative heat transfer in the behavior of tissue temperature. The correlations are made with the results obtained in the case of the absence of memory-dependent derivative parameters.