首页> 外文会议>International Colloquium on Automata, Languages and Programming >Performance Aspects of Distributed Caches Using TTL-Based Consistency
【24h】

Performance Aspects of Distributed Caches Using TTL-Based Consistency

机译:使用基于TTL的一致性分布式缓存的性能方面

获取原文

摘要

Web objects are stored and can be requested from numerous servers, including authoritative “origin” servers and caches. Objects can be modified only by their origin servers and weak consistency with cached copies is maintained by limiting their lifetime durations. Copies fetched from origin servers are received with maximum time-to-live (TTL) that equals their lifetime duration whereas copies obtained through a cache have shorter TTLs since their age (elapsed time since fetched from the origin) is deducted from their lifetime duration. A request served by a cache constitutes a hit if the cache has a fresh copy of the object. Otherwise, the request is considered a miss and is propagated to another server. Performance is measured by the number of requests constituting cache misses. It is evident that the number of cache misses depends on the age of the copies the cache receives. Thus, a cache that sends requests to another cache would suffer more misses than a cache that sends requests directly to an authoritative server. More subtly, the number of misses depends on the particular configuration of higher-level caches, e.g., whether one or more higher-level caches are used. Guided by practices for Web caching, we model and compare different configurations. We also analyze the effect of pre-term refreshes at high-level caches and extended lifetimes at low-level caches and reveal patterns that may seem counter-intuitive at first. Even though TTL-based consistency is very widely used, our work seems to be the first to formally analyze it. Our analysis yields insights and guidelines for improving the performance of Web caches.
机译:存储Web对象,可以从众多服务器请求,包括权威“源”服务器和缓存。可以通过它们的原始服务器来修改对象,并且通过限制其寿命持续时间来维护与缓存副本的弱一致性。从原点服务器获取的副本接收到具有最大时间到实时(TTL),其等于其寿命持续时间,而通过缓存获得的副本以来,自从其年龄(由于从原点获取的经过时间)中扣除了较短的TTL,从它们的寿命持续时间中扣除。如果高速缓存具有对象的新副本,则缓存服务的请求构成命名。否则,请求被视为未命中且传播到另一台服务器。性能由构成缓存未命中的请求数量来衡量。很明显,缓存未命中的数量取决于缓存收到的副本的年龄。因此,向另一个高速缓存向另一个缓存发送请求的缓存会比将请求直接发送到权威服务器的高速缓存都会受到更多的错过。更巧妙地,未命中的次数取决于更高级别高速缓存的特定配置,例如,是否使用了一个或多个更高级别的高级缓存。由Web缓存的实践指导,我们模型并比较不同的配置。我们还分析了预先刷新在高级高速缓存的效果,并在低级高速缓存中延伸了寿命,并揭示了最初可能看起来反向直观的模式。尽管基于TTL的一致性非常广泛使用,我们的作品似乎是第一个正式分析它的工作。我们的分析产生了提高网络缓存性能的见解和准则。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号