• Title/Summary/Keyword: runtime data placement

Search Result 3, Processing Time 0.015 seconds

A Data Placement Scheme for the Characteristics of Data Intensive Scientific Workflow Applications (데이터 집약 과학 워크플로우 응용의 특성을 고려한 데이터 배치 기법)

  • Ahn, Julim;Kim, Yoonhee
    • KNOM Review
    • /
    • v.21 no.2
    • /
    • pp.46-52
    • /
    • 2018
  • For data-intensive scientific workflow application experiments that leverage the cloud computing environment, large amounts of data can be distributed across multiple data centers in the cloud. The generated intermediate data can also be transmitted through access between different data centers. When the application is executed, the execution result is changed according to the location of the data since the intermediate data generated is used. However, existing data placement strategies do not consider the characteristics of scientific applications. In this paper, we define a data-intensive tasks and propose runtime data placement in that interval. Through the proposed data placement scheme, we analyze the scenarios considering the number of times in the data intensive tasks defined in this study and derive the results. In addition, performance was compared by analyzing runtime data placement times and runtime data placement overhead.

Memory Hierarchy Optimization in Embedded Systems using On-Chip SRAM (On-Chip SRAM을 이용한 임베디드 시스템 메모리 계층 최적화)

  • Kim, Jung-Won;Kim, Seung-Kyun;Lee, Jae-Jin;Jung, Chang-Hee;Woo, Duk-Kyun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.2
    • /
    • pp.102-110
    • /
    • 2009
  • The memory wall is the growing disparity of speed between CPU and memory outside the CPU chip. An economical solution is a memory hierarchy organized into several levels, such as processor registers, cache, main memory, disk storage. We introduce a novel memory hierarchy optimization technique in Linux based embedded systems using on-chip SRAM for the first time. The optimization technique allocates On-Chip SRAM to the code/data that selected by programmers by using virtual memory systems. Experiments performed with nine applications indicate that the runtime improvements can be achieved by up to 35%, with an average of 14%, and the energy consumption can be reduced by up to 40%, with an average of 15%.

Optimum Placement and Shape of UHF Monopole Antenna Mounted on UAV (무인항공기에 장착된 UHF 모노폴 안테나의 최적 위치 및 형상)

  • Choi, Jaewon;Kim, Jihoon;Chung, Eulho
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.9
    • /
    • pp.46-51
    • /
    • 2013
  • In this paper, the optimum placement and shape of UHF antenna on the unmanned aerial vehicle (UAV) are analyzed by using the electromagnetic (EM) simulation on the various locations. The FEKO was used for the EM-simulation. In order to reduce the complexity of simulation and minimize the runtime and memory usage, the composite aircraft structure is simplified as the PEC model excluding the radome structure. The simulation was performed on the wing and ventral fin of UAV, and the antenna shape used the monopole, dipole, and bent monopole antennas. When the monopole antenna is mounted under the wing, two antennas need to be mounted under the right and left wings, and those antennas have to be switched as the direction of UAV wing to the line of sight (LOS) data-link (DL) ground antenna. In the case of mounting under the ventral fin, one antenna can be used regardless of the direction of UAV wing to the LOS DL ground antenna. Also, the antenna gain is improved by the blockage reduction. The antenna gain is further improved by using the bent monopole antenna. The optimum solution of UHF antenna placement and shape on UAV is to mount the bent monopole antenna under the ventral fin.