DXRAM: A Persistent In-Memory Storage for Billions of Small Objects

F. Klein, M. Schöttner
{"title":"DXRAM: A Persistent In-Memory Storage for Billions of Small Objects","authors":"F. Klein, M. Schöttner","doi":"10.1109/PDCAT.2013.23","DOIUrl":null,"url":null,"abstract":"Large-scale interactive applications and real time data-processing are facing problems with traditional disk-based storage solutions. Because of the often irregular access patterns they must keep almost all data in RAM caches, which need to be manually synchronized with secondary storage and need a lot of time to be re-loaded in case of power outages. In this paper we propose a novel key-value storage keeping all data always in RAM by aggregating resources of potentially many nodes in a data center. We aim at supporting management of billions of small data objects (16-64 byte) like for example needed for storing graphs. A scalable low-overhead meta-data management is realized using a novel range-based ID approach combined with a super-overlay network. Furthermore, we provide persistence by a novel SSD-aware logging approach allowing to recover failed nodes very fast.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2013.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Large-scale interactive applications and real time data-processing are facing problems with traditional disk-based storage solutions. Because of the often irregular access patterns they must keep almost all data in RAM caches, which need to be manually synchronized with secondary storage and need a lot of time to be re-loaded in case of power outages. In this paper we propose a novel key-value storage keeping all data always in RAM by aggregating resources of potentially many nodes in a data center. We aim at supporting management of billions of small data objects (16-64 byte) like for example needed for storing graphs. A scalable low-overhead meta-data management is realized using a novel range-based ID approach combined with a super-overlay network. Furthermore, we provide persistence by a novel SSD-aware logging approach allowing to recover failed nodes very fast.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
DXRAM:用于数十亿小对象的持久内存存储
大规模交互应用和实时数据处理是传统的基于磁盘的存储解决方案所面临的问题。由于通常的不规则访问模式,它们必须将几乎所有数据保存在RAM缓存中,这需要手动与辅助存储同步,并且在停电时需要大量时间重新加载。本文提出了一种新的键值存储方法,通过聚合数据中心中潜在的多个节点的资源,将所有数据始终保存在RAM中。我们的目标是支持管理数十亿个小数据对象(16-64字节),例如存储图形所需的数据。采用一种新颖的基于距离的ID方法结合超覆盖网络,实现了可扩展的低开销元数据管理。此外,我们通过一种新颖的ssd感知日志方法提供持久性,允许非常快速地恢复故障节点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Simulated-Annealing Load Balancing for Resource Allocation in Cloud Environments A Parallel Algorithm for 2D Square Packing Ten Years of Research on Fault Management in Grid Computing: A Systematic Mapping Study cHPP controller: A High Performance Hyper-node Hardware Accelerator Service Availability for Various Forwarded Descriptions with Dynamic Buffering on Peer-to-Peer Streaming Networks
×
引用
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