• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.399-410
• /
• 2002

Web cache, which is functionally another word of proxy server, is located between client and server. Web cache has a limited storage area although it has broad bandwidth between client and proxy server, which are usually connected through LAN. Because of limited storage capacity, existing objects in web cache can be deleted for new objects by some rules called replacement algorithm. Hit rate and byte-hit rate are general metrics to evaluate replacement algorithms. Most of the replacement algorithms do satisfy only one metric, or sometimes none of them. In this paper, we propose two replacement algorithms to achieve both high hit rate and byte-hit rate with great satisfaction. In the first algorithm, the cache is appropriately partitioned according to file types as a basic model. In the second algorithm, the cache is composed of two levels; the upper level cache is managed by the basic algorithm, but the lower level is collectively used for all types of files as a shared area. To show the performance of the proposed algorithms, we evaluate hit rate and byte-hit rate of the proposed replacement algorithms using the trace driven simulation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.643-645
• /
• 2001

인터넷이라는 환경이 우리의 생활의 일부로 자리잡으면서, 급속히 늘어난 사용자들의 요구는 그 만큼 네트워크의 현저한 부하증가를 일으키고 네트워크의 성능저하를 유발하며 속도 면에서도 빠른 응답을 원하는 사용자들의 욕구를 충족시키지 못하게 된다. 이에 대한 하나의 대응책이, 프락시 서버를 사용함으로써 네트워크 대역폭을 효과적으로 절약하고 서버 측의 부하를 감소시키며 사용자의 요청에 대한 빠른 응답이 가능하게 하는 것이다. 그러나 프락시 서버는 제한된 캐시용량 때문에 새 개체를 위한 공간확보를 위해 기존 개체를 제거해야 하는데, 캐시의 성능을 최대화하도록 하는 효율적인 캐시대체 정책이 필요하다. 기존의 대체정책이 캐시성능판단의 두 기준인 히트율(Hit Rate)과 바이트히트율(Byte Hit Rate)을 만족시키지 못하던지 흑은 불필요한 개체에 공간을 낭비하는 등 최대한치 공간활용을 못하는 단점을 가지고 있다. 본 논문에서는 캐시를 상위층과 하위충의 2단계로 나누어 운용하면서, 상위층은 분할된 여러개의 파티션으로 관리하여 히트율과 바이트율을 높게 유지하고 하위층은 상위의 각각의 파티션들에 추가적으로 필요한 캐시공간을 제공함으로서 동적인 파티션공간분할 효과를 제공하는 프락시 서버의 캐시구조와 캐시대체정책을 제안한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.11
• /
• pp.797-809
• /
• 2006

To support the QoS streams for large scale clients, the internal resources of VOD servers should be utilized based on the characteristics of the streaming media service. Among the various resources in the server, the main memory is used for the buffer space to the media data loaded from the disks and the buffer hit ratio has a great impact upon the server performance. However, if the buffer data with high hit ratio are replaced for the new media data as a result of the number of clients and the required movie titles are increased, the negative impact on the scalability of server performance is occurred. To address this problem, the buffer replacement policy considers the intrinsic characteristics of the streaming media such as the sequential access to large volume data and the highly disproportionate preference to specific movies. In this paper, the preference-based segment buffer replacement policy is proposed in the cluster-based VOD server to exploit the characteristics of the streaming media. Since the proposed method reflects both the temporal locality by the clients' preference and the spatial locality by the sequential access to media data, the buffer hit ratio would be improved as compared to the existing buffer replacement policy. The enhanced buffer hit ratio causes the fact that the performance scalability of the cluster-based VOD server is linearly improved as the number of cluster nodes is increased.

• Journal of Digital Convergence
• /
• v.17 no.9
• /
• pp.153-161
• /
• 2019

Discrimination of media object segments in wireless home proxies has a significant impact on caching delay, and caching delay degrades the performance of the proxy. In this paper, we propose a Single Fetching Smart Caching (SFSC) strategy and a Multi-Fetching Smart Caching (MFSC) strategy to improve the proxy performance of the home network and improve the caching performance for media object segments. The SFSC strategy is a technique that performs caching by sequential fetching of object segments requested by the home node one at a time, which guarantees a faster cache hit rate, and the MFSC strategy is a technique that caches the media object segments by blocking object segments requested by the home node one at a time, which improves the throughput of cache. Simulation results show that the cache hit rate and the caching delay are more efficient than the MFSC technique, and the throughput of the object segment is more efficient than that of the SFSC technique.

• Journal of Bio-Environment Control
• /
• v.32 no.3
• /
• pp.197-204
• /
• 2023

Heat stress causes a decrease in immunity and disease occurrence in livestock, increasing mortality and impairing productivity. In particular, chickens are very vulnerable to high temperatures compared to other livestock species because their entire body is covered with feathers and sweat glands are not developed. Currently, air conditioning systems are essential in broiler houses to prevent high-air temperature damage to broilers, but conventional cooling facilities are greatly affected by the external environment, so there are limits to their use. In this study, to propose a cooling method, thermal insulation paint and a heat pump were apply in the broiler houses to evaluate the temperature reduction effect. The heat pump experiment was to analyze the cooling effect according to the change in ventilation rate and propose an appropriate. As a result of the experiment, the heat-insulating paint reduced the temperature of the broiler houses by maximum 1-2℃, and in the broiler houses where the heat pump was operated, the temperature decrease was the largest when the ventilation rate was the lowest. When the air temperature in the house is similar to or lower than the outside air temperature, it is considered to be most effective to use a heat pump while maintaining only the minimum ventilation rate.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.37 no.10
• /
• pp.933-940
• /
• 2013

In this study, we evaluated the heat release performance of two extruded-type and two swaged-type heat sinks used in an inverter for solar power generation. The number of fins and heat transfer areas of the two swaged-type heat sinks, namely S-62 and S-98, are 62 and 98 and $2.8m^2$ and $5.3m^2$, respectively. Those for the two extruded-type heat sinks, namely, E-38 and E-47, are 38 and 47 and $1.8m^2$ and $1.9m^2$, respectively. The heat release fractions of S-62 and S-98 were measured as 82.7 % and 86.3 %, respectively. Those of E-38 and E47 were measured to be 79.6 % and 81.6 %, respectively. In this experiment, despite the mass flow rates of air entering the heat sinks being almost the same, the heat release fractions increased with heat transfer area. Furthermore, despite S-62's heat transfer area being 47.4 % higher than that of E-47, its heat release fraction was higher by only 1.3 %. We believe that this indicates the better heat transfer property of the extruded-type heat sink. S-98's heat release is only 4.4 % higher than that of S-62, but its heat transfer area is 89.3 % higher; this suggests that its heat transfer area need to be optimized.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04b
• /
• pp.643-646
• /
• 2001

현재의 인터넷 사용자들은 하루가 다르게 증가하고 있는 실정이다. 사용자들의 증가로 인하여 많은 네트워크의 부하가 걸리게 되는데 이는 결국 네트워크 속도 감소로 이어지고 있다. 따라서 네트워크의 속도 문제를 해결하기 위한 방법으로 많은 연구가 진행 되어 왔는데 그 중의 하나가 웹 캐쉬 방법중의 하나인 프락시(proxy) 서버를 이용하는 방법이다. 이러한 프락시 서버 관리를 위한 모니터링 도구들이 많이 상용화 되었고 기존의 프락시 서버를 관리하는 모니터링 연구에서는 프락시 서버의 캐쉬 히트율(hit ratio)이나 바이트 히트율을 높이는 방안을 제시하고자 했다. 그러나 이러한 모니터링으로는 프락시 서버의 부하(load)가 얼마나 걸리는지를 파악 할 수가 없다. 따라서 본 논문에서는 기존의 프락시 서버 모니터링 방식과 더불어 부하의 정보를 제공함으로서 부하 균등 정책이나 사용자의 성향을 파악하여 프락시 서버를 좀 더 효율적으로 관리하고자 하는 방안을 제시하고자 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.33-35
• /
• 1999

이 논문에서는 폭넓게 사용되지만 컴퓨터의 메모리 계층 구조상에서 병목지점으로 알려진 하드디스크의 획기적인 성능향상을 위해서 메모리 시스템이 내장된 새로운 형태의 디스크 구조를 제안한다. 제안하는 디스크 구조에서는 디스크에 메모리를 혼용하여 사용함으로써 디스크 응답시간을 크게 줄이고, 입출력을 빠르게 처리할 수 있다. 64MB까지의 디스크 메모리를 탑재한 경우 두 가지 실제 트레이스에 의한 시뮬레이션 결과 20여명이 사용하는 공유 시스템의 작업부하에서는 최대 80% 정도의 히트율을 통하여 최대 1/2, 그리고 개인용 시스템의 경우 초대 85% 가량의 히트율을 통해 1/5 수준으로 응답시간을 단축할 수 있었다. 앞으로 디스크에 단순히 메모리를 추가하는데 그치지않고 데이터 블록의 배치 방법, 데이터 분산 배분 방법, 보관정책, 선인출 방법 등을 이용하면 추가된 디스크 메모리의 효용을 극대화할 수 있다.

• Journal of Energy Engineering
• /
• v.9 no.4
• /
• pp.334-341
• /
• 2000

회전 히트파이프의 열 전달 특성은 내부 관벽에 형성되는 응축 액막 두께와 증발부로 귀한되는 응축액의 유동율에 의해 결정된다. 본 연구는 축 방향으로 그루브(groove)를 갖는 회전 히트파이프의 열 전달 성능에 대한 실험 연구로써, 그루브에 의한 효과를 파악하기 위해 2종류의 히트파이프를 제작하고 작동성은 시험을 수행하였다. 회전 히트파이프가 작동시, 원심력에 의해 그루브로 응축액의 유동을 촉진시키며, 따라서 응축부 벽면에 형성되는 액막 두께가 얇게 된다. 응축부에 그루브를 갖는 히트파이프의 열전달 계수는 풀 유동에서 2000~4000W/$m^2$$^{0}$ C, 환상 유동 영역에서 1500~2500W/$m^2$$^{0}$ C로써, 전체 원형단면을 갖는 히트파이프와 비교하여 약 1.5배 정도의 열저달 향상을 볼 수 있었으며, 열전달 한계는 약 40% 정도 향상되는 것으로 나타났다.

• The Journal of the Korea Contents Association
• /
• v.4 no.3
• /
• pp.71-80
• /
• 2004

In distributed file-systems, cooperative caching algorithm which owns the data cached at each node jointly is used to reduce an expense of disk access. Cooperative caching algorithm is the method that increases a cache hit-ratio and decrease a disk access as it holds the cache information of distributed systems in common and makes cache larger virtually. Recently, several cooperative caching algorithms decrease the message costs by using approximate information of the cache and increase the cache hit-ratio by using local and global cache fields dynamically. And they have an advantage that increases the whole field hit-ratio by sending a replaced buffer to the idle node on buffers replacement in order to maintain the replaced cache in the cache field. However the wrong approximate information deteriorates the performance, the consistency maintenance goes to great expense to exchange messages and the cost that manages Age-information of each node to choose the idle node increases. In this thesis, we propose a cooperative cache algorithm that maintains correct cache information, minimizes the maintenance cost for consistency and the management cost for buffer Age-information. Also, we show the superiority of our algorithm through the performance evaluation.