• Journal of the Korea Society of Computer and Information
• /
• v.18 no.11
• /
• pp.1-12
• /
• 2013

In multi-core processors, Last Level Cache(LLC) can reduce the speed gap between the memory and the core. For this reason, LLC has big impact on the performance of processors. LLC is composed of shared cache and private cache. In computer architecture community, most researchers have mainly focused on the management techniques for shared cache, while management techniques for private cache have not been widely researched. In conventional private LLC, memory is statically assigned to each core, resulting in serious performance degradation when the workloads are not fairly distributed. To overcome this problem, this paper proposes the replacement policy for managing private cache of LLC efficiently. As proposed core-aware cache replacement policy can reconfigure LLC dynamically, hit rate of LLC is increases drastically. Moreover, proposed policy uses 2-bit saturating counters to improve the performance. According to our simulation results, the proposed method can improve hit rates by 9.23% and reduce the access time by 12.85% compared to the conventional method.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.4
• /
• pp.343-352
• /
• 2012

In order to precisely determine the vertical displacements of CORS antenna phase centers caused by their replacement, intensive research has been carried out in this paper throughout processing GPS measurements made before and after the events. After applying the estimated displacement in the data processing, results show that coordinate repeatability of the vertical component is able to be 7.9mm on average. Comparing with results (e.g., 23.5mm) without applying the displacement, it was possible to conclude that these accuracies are significantly improved, which is equivalent to those before the event of the replacement.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.1_2
• /
• pp.33-44
• /
• 2001

최근 버퍼 캐쉬의 성능을 향상시키기 위한 많은 블록 교체 기법들이 제안되었으며 이 중에서 작업 집합 (working set) 변화에 잘 적응하고 구현이 용이한 Least Recently Used (LRU) 블록 교체 기법이 널리 사용되고 있다. 그러나 LRU 블록 교체 기법은 블록들이 규칙적인 참조 패턴을 보이면서 순차 참조되거나 순환 참조될 때 이 규칙성을 적절히 이용하지 못해 성능이 저하되는 문제점을 가진다. 본 논문에서는 다중 응용 트레이스를 이용하여 LRU 블록 교체 기법의 문제점을 관찰하고, 이 문제점을 해결하는 통합된 형태의 효율적인 버퍼 관리 (Unified Buffer Management, 이하 UBM) 기법을 제안한다. UBM 기법은 순차 참조 및 순환 참조를 자동 검출하여 분리된 공간에 저장하고 이들 참조에 적합한 블록 교체 기법으로 이 공간을 관리한다. 또한 순차 참조와 순환 참조를 위한 공간과 나머지 참조를 위한 공간의 비율을 최적으로 할당하기 위해 온라인에서 수집된 정보를 이용하여 계산된 단위 공간 증가당 예상 버퍼 적중 증가율을 이용한다. 다중 응용 트레이스 기반 시뮬레이션 실험에서 UBM 기법의 버퍼 적중률은 LRU 블록 교체 기법에 비해 평균 12%, 최대 28%까지 향상된 결과를 보였다.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2849-2860
• /
• 1997

In this paper, we present efficient cache replacement policies for the software RAID file system. The performance of this policies is compared to two other policies previously proposed for conventional file systems and adapted for the software RAID file system. As in hardware RAID systems, we found small-writes to be the performance bottleneck in software RAID file systems. To tackle this small-write problem, we propose cache replacement policies. Using trace driven simulations we show that the proposed policies improve performance in the aspect of the average response time and the average system busy time.

• Proceedings of the KAIS Fall Conference
• /
• 2008.05a
• /
• pp.309-312
• /
• 2008

We have prepared the silicone sealant using non silicone oil without silicone oil for solvent and using adhesion promotor against various substrate. We are replaced the silicone oil by the mineral oil and the normal adhesion promotor by mixed adhesion promotor at the multi purpose silicone sealant.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.1083-1086
• /
• 1999

중수로(CANDU) 형 월성 원자력발전소의 칼란드리아 압력관 전면부를 감시점검하기 위한 열영상 관측시스템을 설계/제작하였다. 중수로는 가동중에 핵연료를 교체한다. 칼란드리아 전면부에는 380 개의 압력관 채널이 위치하고 있다. 핵연료를 교체할 시에 핵연료 교체장비가 칼란드리아 압력관 채널의 ENDCAP을 열고 핵연료를 장전하는 과정에서 발생할 지도 모르는 중수누출, 핵연료교체장비의 이상상태를 점검하는데 목적이 있다. 열영상카메라는 상용 CCD 카메라에 비해 영상의 해상도가 떨어진다. CCD 카메라는 수증기 누출과 같은 육안검사에 활용하고, 열영상카메라는 압력관 채널의 온도변화 등을 점검하기 위해 CCD/열영상카메라의 융합구조로 설계/제작하였다.

• Journal of KIISE:Databases
• /
• v.27 no.1
• /
• pp.1-12
• /
• 2000

Many object oriented database systems manage object buffers to provide fast access to objects. Traditional buffer replacement algorithms based on fixed length pages simply assume that the cost incurred by operating a buffer is propertional to the number of buffer faults. However, this assumption no longer holds in an objects buffer where objects are of variable length and the cost of replacing an object varies for each object. In this paper, we propose a cost based replacement algorithm for object buffers. The proposed algorithm replaces the have minimum costs per unit time and unit space. The cost model extends the previous page based one to include the replacement costs and the sizes of objects. The performance tests show that proposed algorithm is almost always superior to the LRU-2 algorithm and in some cases is more than twice as fast. The idea of cost based replacement can be applied to any buffer management architectures that adopt earlier algorithms. It is especially useful in object oriented database systems where there is significant variation in replacement costs.

• Land and Housing Review
• /
• v.5 no.4
• /
• pp.297-303
• /
• 2014

Recently, block and permeable pavements have been placed in apartment complex. However. it is hard to decide the cycle of maintenance and repair due to lack of performance evaluation criteria for these pavements. This study carried out life cycle cost analysis(LCCA) to present resonable alternatives of the pavements by considering initial construction cost, maintenance and repair cost along with the cycle of repair. According to results of LCCA, the interlocking concrete block pavement is the best alternative when the repair cycle of 20years is assumed, while asphalt concrete pavement is the best alterative when the repair cycle of 10years is assumed. Therefore, the repair cycle is most important factor to select alternative. Also, it is necessary to develop resonable performance evaluation index to quantify the cycle of maintenance and repair in the future.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.8
• /
• pp.473-486
• /
• 2004

NUMA systems have remote access caches(RAC) in each local node to reduce the overhead for repeated remote memory accesses. By this RAC, memory latency and network traffic can be reduced and the performance of the multiprocessor system can be improved. Until now, several cache replacement policies have been proposed in recent years, and there also is cache replacement policy for multiprocessor systems. In this paper, we propose a cache replacement policy which is based on cache line coherence information. In this policy, the cache line that does not have an ownership is replaced first with respect to cache line that has an ownership. Like this way, the overhead to transfer ownership is avoided and the memory latency can be decreased. We also propose “Keeping-Ownership replacement policy with MRU (KOM)” and “Keeping-Ownership replacement policy with Reference Bit(KORB)” to reduce the frequent replacement penalty of the ownership-lacking cache line. We compare and analyze these with LRU and Pseudo LRU(PLRU). The simulation shows that KOM outperforms the PLRU by 25%, and KORB outperforms the PLRU by 13%. Although the hardware cost of KOM is very small, the performance of KOM is nearly equal to that of the LRU.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.1091-1101
• /
• 2015

Cache mechanism, which has been a research subject for a significant period of time in computer science, has become realized in the form of web caching in network practice. Web caching has various advantages, such as saving of network resources and response time reduction, depends its performance on cache replacement policy, therefore, analysis and consideration of the environment in which a web cache operates is essential for designing better replacement policies. Thus, in the current web environment where is rapidly changing relative to the past, a new cache replacement policy is necessary to reflect those changes. In this paper we stipulate some characteristics of the web at present, propose a new cache replacement policy, and evaluate it.