Log-structured cache: trading hit-rate for storage performance (and winning) in mobile devices

INFLOW '13 Pub Date : 2013-11-03 DOI:10.1145/2527792.2527797
Abutalib Aghayev, Peter Desnoyers
{"title":"Log-structured cache: trading hit-rate for storage performance (and winning) in mobile devices","authors":"Abutalib Aghayev, Peter Desnoyers","doi":"10.1145/2527792.2527797","DOIUrl":null,"url":null,"abstract":"Browser caches are typically designed to maximize hit rates---if all other factors are held equal, then the highest hit rate will result in the highest performance. However, if the performance of the underlying cache storage (i.e. the file system) varies with differing workloads, then these other factors may in fact not be equal when comparing different cache strategies.\n Mobile systems such as smart phones are typically equipped with low-speed flash storage, and suffer severe degradation in file system performance under sufficiently random write workloads. A cache implementation which performs random writes will thus spend more time reading and writing its cache, possibly resulting in lower overall system performance than a lower-hit-rate implementation which achieves higher storage performance.\n We present a log-structured browser cache, generating almost purely sequential writes, and in which cleaning is efficiently performed by cache eviction. An implementation of this cache for the Chromium browser on Android was developed; using captured user browsing traces we test the log-structured cache and compare its performance to the existing Chromium implementation.\n We achieve a ten-fold performance improvement in basic cache operations (as measured on a Nexus 7 tablet), while in the worst case increasing miss rate by less than 3% (from 65% to 68%). For network bandwidths of 1Mb/s or higher the increased cache performance more than makes up for the decrease in hit rate; the effect is more pronounced when examining 95th percentile delays.","PeriodicalId":404573,"journal":{"name":"INFLOW '13","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"INFLOW '13","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2527792.2527797","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Browser caches are typically designed to maximize hit rates---if all other factors are held equal, then the highest hit rate will result in the highest performance. However, if the performance of the underlying cache storage (i.e. the file system) varies with differing workloads, then these other factors may in fact not be equal when comparing different cache strategies. Mobile systems such as smart phones are typically equipped with low-speed flash storage, and suffer severe degradation in file system performance under sufficiently random write workloads. A cache implementation which performs random writes will thus spend more time reading and writing its cache, possibly resulting in lower overall system performance than a lower-hit-rate implementation which achieves higher storage performance. We present a log-structured browser cache, generating almost purely sequential writes, and in which cleaning is efficiently performed by cache eviction. An implementation of this cache for the Chromium browser on Android was developed; using captured user browsing traces we test the log-structured cache and compare its performance to the existing Chromium implementation. We achieve a ten-fold performance improvement in basic cache operations (as measured on a Nexus 7 tablet), while in the worst case increasing miss rate by less than 3% (from 65% to 68%). For network bandwidths of 1Mb/s or higher the increased cache performance more than makes up for the decrease in hit rate; the effect is more pronounced when examining 95th percentile delays.
日志结构缓存:在移动设备中以命中率换取存储性能(和胜利)
浏览器缓存通常设计为最大化命中率——如果所有其他因素保持不变,那么最高的命中率将导致最高的性能。但是,如果底层缓存存储(即文件系统)的性能随不同的工作负载而变化,那么在比较不同的缓存策略时,这些其他因素实际上可能不相等。智能手机等移动系统通常配备低速闪存,在足够随机的写工作负载下,文件系统性能会严重下降。因此,执行随机写入的缓存实现将花费更多的时间读写其缓存,可能导致整体系统性能低于低命中率实现,而实现更高的存储性能。我们提供了一个日志结构的浏览器缓存,生成几乎纯粹的顺序写入,并且通过缓存清除有效地执行清理。开发了Android上Chromium浏览器的此缓存实现;使用捕获的用户浏览记录,我们测试了日志结构的缓存,并将其性能与现有的Chromium实现进行了比较。我们在基本缓存操作方面实现了十倍的性能提升(在Nexus 7平板电脑上进行了测试),而在最坏的情况下,丢失率只增加了不到3%(从65%增加到68%)。对于1Mb/s或更高的网络带宽,增加的缓存性能可以弥补命中率的下降;在检查第95个百分位数的延迟时,这种影响更为明显。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信