用于原子系统的无锁缓存失效协议

Hugo Rito, João P. Cachopo
{"title":"用于原子系统的无锁缓存失效协议","authors":"Hugo Rito, João P. Cachopo","doi":"10.1145/2095050.2095070","DOIUrl":null,"url":null,"abstract":"The Automatic Transaction-Oriented Memoization (ATOM) system is a thread-safe memoization tool specifically designed for multi-threaded object-oriented programs.\n Currently, searching the ATOM's memo cache for a hit is still an expensive operation with linear time complexity.\n We present a new lock-free cache invalidation protocol for the ATOM that allows multiple threads to concurrently search and invalidate cache entries, resorting to helping from threads to decrease the time spent with cache operations.\n Results with the STMBench7 benchmark show that for a read-only workload the new algorithm increases the throughput of the benchmark up to 14-fold and that it scales well up to 48 cores, the maximum number of physical cores available on the machine used for the tests.","PeriodicalId":143880,"journal":{"name":"SPLASH Workshops","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A lock-free cache invalidation protocol for the atom system\",\"authors\":\"Hugo Rito, João P. Cachopo\",\"doi\":\"10.1145/2095050.2095070\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Automatic Transaction-Oriented Memoization (ATOM) system is a thread-safe memoization tool specifically designed for multi-threaded object-oriented programs.\\n Currently, searching the ATOM's memo cache for a hit is still an expensive operation with linear time complexity.\\n We present a new lock-free cache invalidation protocol for the ATOM that allows multiple threads to concurrently search and invalidate cache entries, resorting to helping from threads to decrease the time spent with cache operations.\\n Results with the STMBench7 benchmark show that for a read-only workload the new algorithm increases the throughput of the benchmark up to 14-fold and that it scales well up to 48 cores, the maximum number of physical cores available on the machine used for the tests.\",\"PeriodicalId\":143880,\"journal\":{\"name\":\"SPLASH Workshops\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SPLASH Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2095050.2095070\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SPLASH Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2095050.2095070","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

自动面向事务的记忆(ATOM)系统是一个线程安全的记忆工具,专门为多线程面向对象的程序设计。目前,在ATOM的备查缓存中搜索命中记录仍然是一项代价高昂的操作,并且具有线性的时间复杂度。我们为ATOM提出了一种新的无锁缓存失效协议,它允许多个线程并发地搜索和失效缓存条目,通过线程的帮助来减少缓存操作所花费的时间。STMBench7基准测试的结果表明,对于只读工作负载,新算法将基准测试的吞吐量提高了14倍,并且可以很好地扩展到48个核,这是用于测试的机器上可用的最大物理核数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A lock-free cache invalidation protocol for the atom system
The Automatic Transaction-Oriented Memoization (ATOM) system is a thread-safe memoization tool specifically designed for multi-threaded object-oriented programs. Currently, searching the ATOM's memo cache for a hit is still an expensive operation with linear time complexity. We present a new lock-free cache invalidation protocol for the ATOM that allows multiple threads to concurrently search and invalidate cache entries, resorting to helping from threads to decrease the time spent with cache operations. Results with the STMBench7 benchmark show that for a read-only workload the new algorithm increases the throughput of the benchmark up to 14-fold and that it scales well up to 48 cores, the maximum number of physical cores available on the machine used for the tests.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A DSML for reversible transformations Et (smart) phone home! SharpLudus revisited: from ad hoc and monolithic digital game DSLs to effectively customized DSM approaches Designing a general-purpose programming language based on agent-oriented abstractions: the simpAL project Constrained data acquisition for mobile citizen science applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1