• Journal of the Korea Convergence Society
• /
• v.9 no.3
• /
• pp.31-37
• /
• 2018

Energy Storage System(ESS) is a system that maximizes energy efficiency by selectively storing and using the generated power when needed. Therefore, energy must be able to be charged or supplied at any time, and non-operating time should be minimized even in the case of failure or maintenance. However, current large-capacity energy storage systems must be shut down during maintenance due to structural problems. In this paper, we propose a PCS for 1MW ESS by configuring modular for large capacity ESS in parallel and verified of the hot swap technology that can replace, change, and repair the components that make up the system while keeping the system operating.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.61 no.1
• /
• pp.1-8
• /
• 2019

Developing reliable soil moisture prediction techniques at agricultural regions is a pivotal issue for sustaining stable crop productions. In this study, a physically-based SWAP(Soil-Water-Atmosphere-Plant) model was suggested to estimate soil moisture dynamics at the study sites. ROSETTA was also integrated to derive the soil hydraulic properties(${\alpha}$, n, ${\Theta}_r$, ${\Theta}_s$, $K_s$) as the input variables to SWAP based on the soil information(Sand, Silt and Clay-SSC, %). In order to predict the soil moisture dynamics in future, the mid-term TIGGIE(THORPEX Interactive Grand Global Ensemble) and long-term S2S(Subseasonal to Seasonal) weather forecasts were used, respectively. Our proposed approach was tested at the six study sites of RDA(Rural Development Administration). The estimated soil moisture values based on the SWAP model matched the measured data with the statistics of Root Mean Square Error(RMSE: 0.034~0.069) and Temporal Correlation Coefficient(TCC: 0.735~0.869) for validation. When we predicted the mid-/long-term soil moisture values using the TIGGE(0~15 days)/S2S(16~46 days) weather forecasts, the soil moisture estimates showed less variations during the TIGGE period while uncertainties were increased for the S2S period. Although uncertainties were relatively increased based on the increased leading time of S2S compared to those of TIGGE, these results supported the potential use of TIGGE/S2S forecasts in evaluating agricultural drought. Our proposed approach can be useful for efficient water resources management plans in hydrology, agriculture, etc.

• Journal of KIISE
• /
• v.42 no.9
• /
• pp.1071-1077
• /
• 2015

In this paper, we adopt PCM (phase-change memory) as a virtual memory swap device and present a new page replacement policy that considers the characteristics of PCM. Specifically, we aim to reduce the write traffic to PCM by considering the dirtiness of pages when making a replacement decision. The proposed policy tracks the dirtiness of a page at the granularity of a sub-page and replaces the least dirty page among the pages not recently used. Experimental results show that the proposed policy reduces the amount of data written to PCM by 22.9% on average and up to 73.7% compared to CLOCK. It also extends the lifespan of PCM by 49.0% and reduces the energy consumption of PCM by 3.0% on average.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.4
• /
• pp.53-58
• /
• 2023

As smartphones increasingly support the execution of various applications, the function of virtual memory swapping is becoming important. However, unlike traditional computer systems, mobile platforms do not basically support swapping. This is because swapping results in frequent writes to flash memory, which may degrade the performance of smartphone's storage significantly. To cope with this situation, this paper suggests two multi-swap architectures, hierarchical swapping and hybrid swapping, and compares their performance quantitatively. Specifically, this paper shows that hybrid swapping with the consideration of single-access data can reduce swapping traffic to flash memory, and improve the performance compared to traditional swapping.

• Vending industry
• /
• v.11 no.1
• /
• pp.66-66
• /
• 2012

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.346-348
• /
• 2012

리눅스 기반의 운영체제인 안드로이드는 스마트 디바이스를 위해 만들어진 운영체제로 기존의 리눅스에서 제공하던 메모리 관리 기법인 스왑(Swap)기능을 기본적으로 제공하지 않고 있다. 하지만, 스마트 디바이스의 활용도가 높아짐에 따라 디바이스 상에서 여러 가지 기능을 제공하게 되었고 그로인해 기존의 메모리 공간보다 더 큰 메모리 공간을 요구하게 되었다. 따라서 메모리 관리에 있어 스왑기법과 같은 소프트웨어적 접근에 대한 관심이 높아지고 있다. 본 논문에서는 안드로이드 운영체제에 대한 스왑기법의 적용에 초점을 맞추어 스왑기법의 적용 시 성능 저하 문제를 기존의 LMK 기법과 비교하여 제시하고 있다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.3
• /
• pp.15-34
• /
• 1994

This paper considers the genetic algorithms(GAs) for the mixed model assembly line sequencing(MMALS) in which the objective is to minimize the overall line length. To apply the GAs to the MMALS, the representation, selection, genetic sequencing operators, and genetic parameters are studied. Especially, the existing sequencing binary operators such as partially map crossover(PMX), cycle crossover(CX), and order crossover (OX) are modified to be suitable for the MMALS, and a new sequencing binary operator called immediate successor relationship crossover (ISR) is introduced. These binary operators mentioned above and/or unary operators such as swap, insertion, inversion, displacement, and splice are compared to find operators which work well in the MMALS. Experimental results indicate that 1) among the binary operators ISR operator is the best, followed by the modified OX, and the modified PMX, with the modified CX being the worst, 2) among the unary operators inversion operator is the best, followed by displacement, swap, and insertion, with splice being the worst, and 3) in general, the unary operators perform better than the binary operators for the MMALS.

• Proceedings of the KIPE Conference
• /
• 2011.07a
• /
• pp.502-503
• /
• 2011

최근 환경 문제 및 화석 에너지의 고갈과 맞물려 신재생 에너지를 사용하는 DC 출력형 분산전원 시스템이 증가 일로에 있으며, 이에 따라 교류 급전시스템보다 에너지 변환 효율이 높은 직류 급전 시스템에 대한 연구개발이 활발히 이뤄지고 있다. 본 논문에서는 유지 보수의 용이성을 확보한 Hot Swap 구조형식의 DC 급전용 100[kW]급 분산 제어기반 모듈형 ESS[Energy Storage System의 개발에 관한 것이다. 실제 33[kW]급 모듈 3대로 구성된 100[kW]급 시스템을 제작하여 전압제어 실험, 병렬운전실험 및 Hot Swap 안정성 실험 등을 수행하였다.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.17 no.1
• /
• pp.7-14
• /
• 2017

Due to the recent advances in Phage-Change Memory (PCM) technologies, a new memory hierarchy of computer systems with PCM is expected to appear. In this paper, we present a new page replacement policy that adopts PCM as a high speed swap device. As PCM has limited write endurance, our goal is to minimize the amount of data written to PCM. To do so, we defer the eviction of dirty pages in proportion to their dirtiness. However, excessive preservation of dirty pages in memory may deteriorate the page fault rate, especially when the memory capacity is not enough to accommodate full working-set pages. Thus, our policy monitors the current working-set size of the system, and controls the deferring level of dirty pages not to degrade the system performances. Simulation experiments show that the proposed policy reduces the write traffic to PCM by 160% without performance degradations.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.2
• /
• pp.97-103
• /
• 2016

This paper deals with the cycle time minimization problem that determines the productivity in printed circuit board (PCB) with n components using the m placement machines. This is known as production cycle time determination problem (PCTDP). The polynomial time algorithm to be obtain the optimal solution has been unknown yet, therefore this hard problem classified by NP-complete. This paper gets the initial assignment result with the machine has minimum unit placement time per each component firstly. Then, the balancing process with reallocation from overhead machine to underhead machine. Finally, we perform the swap optimization and get the optimal solution of cycle time $T^*$ within O(mn) computational complexity. For experimental data, the proposed algorithm can be obtain the same result as integer programming+branch-and-bound (IP+B&B) and B&B.