咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >R-Memcached: A Reliable In-Mem... 收藏

R-Memcached: A Reliable In-Memory Cache for Big Key-Value Stores

R-Memcached: A Reliable In-Memory Cache for Big Key-Value Stores

作     者:Chengjian Liu Kai Ouyang Xiaowen Chu Hai Liu Yiu-Wing Leung 

作者机构:Department of Computer ScienceHong Kong Baptist University Institute of Research and Continuing EducationHong Kong Baptist University 

出 版 物:《Tsinghua Science and Technology》 (清华大学学报(自然科学版(英文版))

年 卷 期:2015年第20卷第6期

页      面:560-573页

核心收录:

学科分类:08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术(可授工学、理学学位)] 

基  金:supported in part by Hong Kong GRF grant HKBU 210412 and HKBU grant FRG2/14-15/059 

主  题:in-memory cache fault tolerance key-value store 

摘      要:Large-scale key-value stores are widely used in many Web-based systems to store huge amount of data as(key, value) pairs. In order to reduce the latency of accessing such(key, value) pairs, an in-memory cache system is usually deployed between the front-end Web system and the back-end database system. In practice, a cache system may consist of a number of server nodes, and fault tolerance is a critical feature to maintain the latency Service-Level Agreements(SLAs). In this paper, we present the design, implementation, analysis, and evaluation of R-Memcached, a reliable in-memory key-value cache system that is built on top of the popular Memcached software. R-Memcached exploits coding techniques to achieve reliability, and can tolerate up to two node *** experimental results show that R-Memcached can maintain very good latency and throughput performance even during the period of node failures.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分