- 1、本文档共79页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
分布式存储及应用系统架构分析
目 录
Memcached
Memcached架构
memcached是高性能的分布式内存缓存服务器。 一般的使用目的是,通过缓存数据库查询结果,减少数据库访问次数,以提高动态Web应用的速度、 提高可扩展性。
Memcache实现分析理解
实现结构
Speed
Of course, the primary motivation for caching is speed, so Memcached is designed to be as fast as possible. The initial prototype of Memcached was written in Perl. Although I love Perl, the prototype was laughably slow and bloated. Perl trades off memory usage for everything, so a lot of precious memory was wasted, and Perl can't handle tons of network connections at once.
The current version is written in C as a single-process, single-threaded, asynchronous I/O, event-based d?mon. For portability and speed, we use libevent (see the on-line Resources section) for event notification. The advantage of libevent is that it picks the best available strategy for dealing with file descriptors at runtime. For example, it chooses kqueue on BSD and epoll on Linux 2.6, which are efficient when dealing with thousands of concurrent connections. On other systems, libevent falls back to the traditional poll and select methods.
Inside Memcached, all algorithms are O(1). That is, the runtime of the algorithms and CPU used never varies with the number of concurrent clients, at least when using kqueue or epoll, or with the size of the data or any other factor.
Of note, Memcached uses a slab allocator for memory allocation. Early versions of Memcached used the malloc from glibc and ended up falling on their faces after about a week, eating up a lot of CPU space due to address space fragmentation. A slab allocator allocates only large chunks of memory, slicing them up into little chunks for particular classes of items, then maintaining freelists for each class whenever an object is freed. See the Bonwick paper in Resources for more details. Memcached currently generates slab classes for all power-of-two sizes from 64 bytes to 1MB, and it allocates an object of the smallest size that can hold a submitted item. As a result of using a slab allo
您可能关注的文档
- 粉煤灰制砖项目可行性实施计划书(修改版).doc
- 风荷苑塔吊料台方案钢平台方案.doc
- 服装媒介计划书.doc
- 服装设计专业毕业设计.doc
- 服装生产线单件流实施计划方案分析报告.doc
- 辅助教学楼设计与计算土木工程系.doc
- 富阳市杭新景高速富阳互通(新增)工程项目环境影响报告书简本WORD.doc
- 改革开放以来我国大学生文化消费和转型研究_.doc
- 钢管旋切机设计控制部分.doc
- 高速服务区框架坡屋面结构工程施工设计方案.doc
- 人教版(2019) 必修第三册 Unit 3 Diverse Cultures Listening and Speaking(共10张PPT).pptx
- Unit2Bridging+Cultures+Per课件-高中英语人教版选择性必修二单元整体教学设计-PPTX}.pptx
- 高中语文课程思政课件.pptx
- 人教版高中生物必修二第三章第3节《DNA分子的复制》 课件 (共40张PPT).pptx
- 中学物理课堂教学方法设计与案例分析 ppt课件.pptx
- 部编版七年级《道德与法治》下册 第三单元《在集体中成长》教材习题答案.pptx
- 第8课for循环-浙教版(2020)八年级信息技术上册课件.pptx
- 塔克的郊外PPT课件.pptx
- 人教课标版高中英语必修3【核心单词精讲课件】remind的用法.pptx
- 2022届高三语文一轮复习优生优培课件:3古代诗歌鉴赏客观题.pptx
文档评论(0)