repository
ERF 알고리즘을 이용한 참조테이블 기반 캐시 방출 전략
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 정태선 | - |
| dc.contributor.author | 이중화 | - |
| dc.date.accessioned | 2018-11-08T08:23:58Z | - |
| dc.date.available | 2018-11-08T08:23:58Z | - |
| dc.date.issued | 2017-08 | - |
| dc.identifier.other | 25540 | - |
| dc.identifier.uri | https://dspace.ajou.ac.kr/handle/2018.oak/13596 | - |
| dc.description | 학위논문(석사)--아주대학교 일반대학원 :소프트웨어특성화학과,2017. 8 | - |
| dc.description.tableofcontents | 1. Introduction 1 2. Motivation 5 3. Related Work 9 3.1 Recency-based Strategy 11 3.1.1 LRU [11] 12 3.1.2 LRU-Thold [1, 12] 13 3.1.3 SIZE [1, 13] 13 3.1.4 Score gated LRU(SG-LRU) web caching strategy [14] 13 3.1.5 Implementation of LRU algorithms 14 3.2 Frequency-based Strategy 15 3.2.1 LFU [1, 11] 16 3.2.2 PLFU (Perfect LFU) [1, 11] 16 3.2.3 In-Memory LFU [1, 11] 16 3.2.4 Implementation of LFU algorithms 16 4. Our Approach 18 4.1 Structure 18 4.2 Algorithm 23 5. Experiments 27 5.1 Reference Table based Architecture 27 5.2 Exponential function on time with frequency 29 6. Conclusion and future work 39 References 40 | - |
| dc.language.iso | eng | - |
| dc.publisher | The Graduate School, Ajou University | - |
| dc.rights | 아주대학교 논문은 저작권에 의해 보호받습니다. | - |
| dc.title | ERF 알고리즘을 이용한 참조테이블 기반 캐시 방출 전략 | - |
| dc.title.alternative | RERF : Reference table based cache eviction policy using ERF | - |
| dc.type | Thesis | - |
| dc.contributor.affiliation | 아주대학교 일반대학원 | - |
| dc.contributor.alternativeName | JoongHwa Lee | - |
| dc.contributor.department | 일반대학원 소프트웨어특성화학과 | - |
| dc.date.awarded | 2017. 8 | - |
| dc.description.degree | Master | - |
| dc.identifier.localId | 788504 | - |
| dc.identifier.url | http://dcoll.ajou.ac.kr:9080/dcollection/jsp/common/DcLoOrgPer.jsp?sItemId=000000025540 | - |
| dc.subject.keyword | cache replacement algorithm | - |
| dc.subject.keyword | cache hit ratio | - |
| dc.subject.keyword | thumbnail cache | - |
| dc.description.alternativeAbstract | Most vendors of e-commerce applications deploy the cache memory to deliver the web objects to clients faster. However, they face many problems in dealing with the cache memory due to limited resources and dynamic access patterns. Especially, the frequently changed demands of customers and insufficient memory for thumbnails of products in online shopping mall make the performance low. As a result, we need to efficiently manage the cache memory by evicting the unused data. The performance of cache manager depends upon the efficiency of delete determination. In this paper, we propose reference table based cache eviction strategy using ERF, which is an extension to the conventional LRU and LFU algorithms by considering the time when the Web objects are referenced and the frequency of references while the items present in cache as main factors for the cache replacement. ERF uses natural exponential function on time to cope with dynamic nature of e-commerce business with limited memory. It sorts the caches in the order of score value which come from coordination between frequency and recency and evicts the caches according to it. According to a predefined score function, we can keep the most important contents in the cache. We evaluate the performance of reference table based approach in terms of CPU consumption. We also evaluate the performance of RERF by using the workload which reflects the real-world applications and compare it with conventional algorithms. By increasing the cache hit ratio with RERF, we can expect the decrease of copy and delete operations of cache with improving the overall system performance. | - |
- Appears in Collections:
- Graduate School of Ajou University > Department of Software Characterized Chemistry > 3. Theses(Master)
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
-
- License
- STATISTICS
- Total Visit :3,730,584
- Total Download :1,818
- Today View :8,242
