• 사물인터넷융복합논문지
• /
• 제9권1호
• /
• pp.71-76
• /
• 2023

최근 빅데이터를 저장 및 관리하기 위해 대용량 데이터를 안정적으로 접근할 수 있는 고성능의 저장시스템 개발과 연구가 활발하게 진행되고 있다. 특히 데이터센터 및 엔터프라이즈 환경의 저장시스템에서는 대용량의 데이터를 관리하기 위해 대용량의 SSD(solid state disk)가 대량으로 사용되고 있다. 일반적으로 SSD는 미디어인 NAND 플래시 메모리의 특성을 감추고 데이터를 관리를 효율적으로 하기 위해 FTL(flash transfer layer)을 사용한다. 그러나 FTL의 알고리즘은 SSD의 용량이 커질수록 데이터가 저장된 NAND의 위치 정보를 관리하기 위해 DRAM을 많이 사용하는 한계가 있다. 따라서 본 논문에서는 FTL에서 사용하는 DRAM 자원을 줄이기 위한 가상 메모리 (virtual memory)를 적용한 FTL 정책을 소개한다. 본 논문에서 제안하는 가상 메모리 기반 FTL 정책은 LRU(least recently used) 정책을 사용하여 최근 사용된 데이터의 멥핑 정보를 DRAM 공간에 적재하고 이전에 사용된 정보는 NAND에 저장하는 방식으로 멥 데이터를 관리한다. 마지막으로 실험을 통해 가상 메모리 기반의 FTL과 일반 FTL의 데이터 쓰기 처리를 하는 동안 소모되는 성능과 자원의 사용량을 측정하고 분석한다.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제15권1호
• /
• pp.14-20
• /
• 2009

플래시 메모리는 현재 휴대용 기기 뿐 아니라 개인용 컴퓨터와 서버용 컴퓨터에서 널리 사용되고 있다 하드디스크를 위한 버퍼 캐시 교체 정책인 LRU(Least Recently Used)와 LFU(Least Frequently Used)는 플래시 메모리의 특성을 전혀 고려하지 않아 플래시 메모리에 적합하지 않다. 기존에 연구되었던 CFLRU(Clean-First LRU)와 그 변형인 CFLRU/C, CFLRU/E, DL-CPLRU/E는 플래시 메모리의 특성을 고려하였지만 hit ratio가 LRU와 LFU에 비하여 좋지 않다. 본 논문에서는 기존의 버퍼 캐시 교체 정책들을 보완하는 새로운 버퍼 캐시 교체 정책을 제안한다. 이 버퍼 캐시 교체 정책은 LFU를 기반으로 하고 플래시 메모리의 특성을 고려하였다. 그리고 이 새로운 버퍼 캐시 교체 정책을 기존 플래시 메모리 버퍼 캐시 교체 정책과 hit ratio와 flush 횟수를 비교하여 성능을 평가한다.

• 한국정보처리학회논문지
• /
• 제5권9호
• /
• pp.2345-2352
• /
• 1998

최근에 개발되어 성공적으로 적용되고 있는 초기하분포 소프트웨어 신뢰성 성장 모델의 모수는 최우추정법으로 추정하기가 쉽지 않으므로주로 최소자승법으로 추정하고 있다. 본 논문에서는 먼저 기존의 최소자승법에서 사용된 최소화 기준을 비교한 다음, 새로 발견되는 결함수의 분산이 일정하지 않음을 고려한 가중최소자승법을 제안한다. 그리고 두 개의 실제 자료를 분석하여 가중최소자승법이 적합함을 보인다. 마지막으로 임의의 테스팅 시점에서 추가 시험에 의해 발견된 새로운 결함수를 예측하는 방법을 제안한다. 이 예측 방법은 테스팅을 중단하는 시점을 결정할 때 이용될 수 있을 것이다.

• Journal of Electrical Engineering and Technology
• /
• 제8권6호
• /
• pp.1269-1275
• /
• 2013

Recently, many studies have suggested that an electric vehicle (EV) is one of the means for increasing the reliability of power systems in new energy environments. EVs can make a contribution to improving reliability by providing frequency regulation in power systems in which the Vehicle-to-Grid (V2G) technology has been implemented and, if economically viable, can be helpful in increasing power system reliability. This paper presents a stochastic method for optimal coordination of charging and frequency regulation decisions for an EV aggregator using the Least Square Monte-Carlo (LSMC) with modeling of electricity price uncertainty. The LSMC can be used to assess the value of options based on electricity price uncertainty in order to simultaneously optimize the scheduling of EV charging and regulation service for the EV aggregator. The results of a numerical example show that the proposed method can significantly improve the expected profits of an EV aggregator.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권12호
• /
• pp.4912-4933
• /
• 2015

Information Centric Networking (ICN) has recently attracted great attention. It names the content decoupling from the location and introduces network caching, making the content to be cached anywhere within the network. The benefits of such design are obvious, however, many challenges still need to be solved. Among them, the local caching policy is widely discussed and it can be further divided into two parts, namely the cache permission policy and the cache replacement policy. The former is used to decide whether an incoming content should be cached while the latter is used to evict a cached content if required. The Internet is a user-oriented network and popular contents always have much more requests than unpopular ones. Caching such popular contents closer to the user's location can improve the network performance, and consequently, the local caching policy is required to identify popular contents. However, considering the line speed requirement of ICN routers, the local caching policy whose complexity is larger than O(1) cannot be applied. In terms of the replacement policy, Least Recently Used (LRU) is selected as the default one for ICN because of its low complexity, although its ability to identify the popular content is poor. Hence, the identification of popular contents should be completed by the cache permission policy. In this paper, a cache permission policy called Cache-Filter, whose complexity is O(1), is proposed, aiming to store popular contents closer to users. Cache-Filter takes the content popularity into account and achieves the goal through the collaboration of on-path nodes. Extensive simulations are conducted to evaluate the performance of Cache-Filter. Leave Copy Down (LCD), Move Copy Down (MCD), Betw, ProbCache, ProbCache⁺, Prob(p) and Probabilistic Caching with Secondary List (PCSL) are also implemented for comparison. The results show that Cache-Filter performs well. For example, in terms of the distance to access to contents, compared with Leave Copy Everywhere (LCE) used by Named Data Networking (NDN) as the permission policy, Cache-Filter saves over 17% number of hops.

• 한국통신학회논문지
• /
• 제21권1호
• /
• pp.224-240
• /
• 1996

It is common sense for at least one or more levels of cache memory to be used in these day's computer systems. In this paper, the impact of the internal cache memory organization on the performance of the computer is investigated by using a simulator program, which is wirtten by authors and run on SUN SPARC workstation, with several real execution, with several real execution trace files. 280 cache organizations have been simulated using n-way set associative mapping and LRU(Least Recently Used) replacement algorithm with write allocation policy. As a result, 16-way setassociative cache is the best configuration, and when we select 256KB cache memory and 64 byte line size, the bus traffic ratio was decreased compared to that of the noncache system so that a single bus could support almost 7 processors without any delay and degradationof high ratio(hit ratio was 99.21%). The smaller the line size we choose, the little lower hit ratio we can get, but the more processors can be supported by a single bus(maximum 18 processors). Therefore, using a proper cache memory organization can make a single bus structure be able to support multiple processors without any performance degradation.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제15권1호
• /
• pp.68-76
• /
• 2015

Phase-change memory (PCM) is a promising technology that is anticipated to be used in the memory hierarchy of future computer systems. However, its access time is relatively slower than DRAM and it has limited endurance cycle. Due to this reason, PCM is being considered as a high-speed storage medium (like swap device) or long-latency memory. In this paper, we adopt PCM 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 replacement policy tracks the dirtiness of a page at the granularity of a sub-page and replaces the least dirty page among pages not recently used. Experimental results with various workloads 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.

• Journal of Microbiology and Biotechnology
• /
• 제12권3호
• /
• pp.377-381
• /
• 2002

Recently, interests to remove nitrogen in the nitritation process have increased because of its economical advantages, since it could be a short-cut process to save both oxygen for nitrification and carbon for denitrification compared to a typical nitrification. However, the kinetics related with the nitritation process has not yet been fully understood. Furthermore, many useful models which have been successfully used for wastewater treatment processes cannot be used to estimate effluent nitrite concentration for evaluating performance of the nitritation process, since the process rate equations and population of microorganisms for nitrogen removal in these models have been set up only for the condition of full nitrification. Therefore, the present study was conducted to estimate an effluent nitrite concentration in the nitritation process with a concept of enzymatic inhibition kinetics based on long-term laboratory experiments. Using a nonlinear least squares regression method, kinetic parameters were accurately determined. By setting up a process rate equation along with a mass balance equation of the nitrite-oxidizing step, an effluent nitrite concentration in the nitritation process was then successfully estimated.

• 한국정보과학회논문지:데이타베이스
• /
• 제29권2호
• /
• pp.148-157
• /
• 2002

메타 검색 엔진에서 캐쉬의 사용은 사용자의 응답시간을 향상시킬 수 있다. 본 논문에서는 메타 검색 엔진의 구조와 동작을 보이고, 메타 검색 엔진을 위한 인기도 기반의 새로운 캐쉬 대체 방법을 제안한다. 인기도는 사용자들이 검색 엔진에 요청한 단어들의 출현 빈도수를 정규화한 값으로, 캐쉬 대체를 위한 기준치로 이용된다. 본 논문에서는 인기 검색어 수집 방법, 인기도 산출방법을 기술하고, 인기도를 기반으로 하는 새로운 알고리즘을 제안한다. 또한 실제 사용자가 검색 엔진에 입력한 자료를 바탕으로, 전통적인 캐쉬 대체 기법인 LRU, LFU 알고리즘과 제안된 알고리즘을 성능 평가하였다. 본 성능 평가에서는 제안된 알고리즘이 대다수의 경우 우수한 성능을 나타내었다.

• International Journal of Industrial Entomology and Biomaterials
• /
• 제10권2호
• /
• pp.79-86
• /
• 2005

Molecular markers have increasingly been used in plant genetic analysis, due to their obvious advantages over conventional phenotypic markers, as they are highly polymorphic, more in number, stable across different developmental stages, neutral to selection and least influenced by environmental factors. Among the PCR based marker techniques, ISSR is one of the simplest and widely used techniques, which involves amplification of DNA segment present at an amplifiable distance in between two identical microsatellite repeat regions oriented in opposite direction. Though ISSR markers are dominant like RAPD, they are more stable and reproducible. Because of these properties ISSR markers have recently been found using extensively for finger printing, pohylogenetic analysis, population structure analysis, varietal/line identification, genetic mapping, marker-assisted selection, etc. In mulberry (Morus spp.), ISSR markers were used for analyzing phylogenetic relationship among cultivated varieties, between tropical and temperate mulberry, for solving the vexed problem of identifying taxonomic positions of genotypes, for identifying markers associated with leaf yield attributing characters. As ISSR markers are one of the cheapest and easiest marker systems with high efficiency in generating polymorphism among closely related varieties, they would play a major role in mulberry genome analysis in the future.