灵活的计算缓存使用FATE

James Mathewson, J. Garcia-Luna-Aceves
{"title":"灵活的计算缓存使用FATE","authors":"James Mathewson, J. Garcia-Luna-Aceves","doi":"10.1109/ICCNC.2019.8685590","DOIUrl":null,"url":null,"abstract":"Many algorithms have been presented to enhance caching in the Internet, and LRU (Least Recently Used) is the defacto standard used to evict data due to its ease of implementation and good performance. A limitation in creating a new caching algorithm is the cost associated with its development, testing, analysis, and efficiency in specific scenarios. The Functional Algebraic aTomic Evaluators (FATE) is introduced to address this problem. FATE is an information processing engine that evaluates information (such as the value of cached content) and acts upon said results. FATE is designed to be highly configurable and flexible, and to enable rapid development, accuracy in duplicate functionality on different platforms, and ease of use. It uses XML configuration files to setup the evaluation of the content. Each algorithm in FATE can be used as-is or optimized.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"288 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Flexible Evaluation Caching Using FATE\",\"authors\":\"James Mathewson, J. Garcia-Luna-Aceves\",\"doi\":\"10.1109/ICCNC.2019.8685590\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many algorithms have been presented to enhance caching in the Internet, and LRU (Least Recently Used) is the defacto standard used to evict data due to its ease of implementation and good performance. A limitation in creating a new caching algorithm is the cost associated with its development, testing, analysis, and efficiency in specific scenarios. The Functional Algebraic aTomic Evaluators (FATE) is introduced to address this problem. FATE is an information processing engine that evaluates information (such as the value of cached content) and acts upon said results. FATE is designed to be highly configurable and flexible, and to enable rapid development, accuracy in duplicate functionality on different platforms, and ease of use. It uses XML configuration files to setup the evaluation of the content. Each algorithm in FATE can be used as-is or optimized.\",\"PeriodicalId\":161815,\"journal\":{\"name\":\"2019 International Conference on Computing, Networking and Communications (ICNC)\",\"volume\":\"288 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on Computing, Networking and Communications (ICNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCNC.2019.8685590\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Computing, Networking and Communications (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNC.2019.8685590","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

已经提出了许多算法来增强Internet中的缓存,LRU (Least Recently Used)是用于提取数据的事实上的标准,因为它易于实现和良好的性能。创建新缓存算法的一个限制是与特定场景下的开发、测试、分析和效率相关的成本。为了解决这个问题,引入了功能代数原子求值器(FATE)。FATE是一种信息处理引擎,用于评估信息(例如缓存内容的值)并根据所述结果采取行动。FATE被设计成高度可配置和灵活的,并且能够在不同平台上实现快速开发,重复功能的准确性和易用性。它使用XML配置文件来设置对内容的评估。FATE中的每个算法都可以按原样使用或进行优化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Flexible Evaluation Caching Using FATE
Many algorithms have been presented to enhance caching in the Internet, and LRU (Least Recently Used) is the defacto standard used to evict data due to its ease of implementation and good performance. A limitation in creating a new caching algorithm is the cost associated with its development, testing, analysis, and efficiency in specific scenarios. The Functional Algebraic aTomic Evaluators (FATE) is introduced to address this problem. FATE is an information processing engine that evaluates information (such as the value of cached content) and acts upon said results. FATE is designed to be highly configurable and flexible, and to enable rapid development, accuracy in duplicate functionality on different platforms, and ease of use. It uses XML configuration files to setup the evaluation of the content. Each algorithm in FATE can be used as-is or optimized.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信