arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1708.07941cs.DC
收藏

LERC:数据并行系统的协调缓存管理

LERC: Coordinated Cache Management for Data-Parallel Systems

Yinghao Yu, Wei Wang, Jun Zhang, Khaled B. Letaief

摘要:

内存缓存在当今的数据并行框架(如Spark、Tez和Storm)中得到了积极的应用。通过在内存中缓存输入和中间数据,计算任务可以见证数量级的加速。为了最大限度地提高内存中数据访问的机会,现有的缓存算法,无论是基于新近度还是基于频率,都将缓存命中率作为优化目标。然而,与传统的信念,我们在本文中表明,简单地追求更高的缓存命中率的个别数据块并不一定转化为更快的任务完成在数据并行环境中。数据并行任务通常依赖于多个输入数据块。除非所有这些块都缓存在内存中,否则不会产生加速。为了捕捉这种全有或全无的属性,我们提出了一个更相关的指标,称为有效缓存命中率。具体地说,如果数据块的缓存命中可以加速计算任务,则该数据块的缓存命中被称为有效的。为了优化有效的缓存命中率,我们提出了最低有效引用计数(LERC)的政策,持久的依赖块的计算任务作为一个整体在内存中。我们在Spark中实现了LERC策略作为内存管理器,并通过Amazon EC2部署评估了其性能。评估结果表明,LERC有助于加快高达37%的数据并行作业相比,广泛采用的最近最少使用(LRU)的政策。

英文摘要:

Memory caches are being aggressively used in today's data-parallel frameworks such as Spark, Tez and Storm. By caching input and intermediate data in memory, compute tasks can witness speedup by orders of magnitude. To maximize the chance of in-memory data access, existing cache algorithms, be it recency- or frequency-based, settle on cache hit ratio as the optimization objective. However, unlike the conventional belief, we show in this paper that simply pursuing a higher cache hit ratio of individual data blocks does not necessarily translate into faster task completion in data-parallel environments. A data-parallel task typically depends on multiple input data blocks. Unless all of these blocks are cached in memory, no speedup will result. To capture this all-or-nothing property, we propose a more relevant metric, called effective cache hit ratio. Specifically, a cache hit of a data block is said to be effective if it can speed up a compute task. In order to optimize the effective cache hit ratio, we propose the Least Effective Reference Count (LERC) policy that persists the dependent blocks of a compute task as a whole in memory. We have implemented the LERC policy as a memory manager in Spark and evaluated its performance through Amazon EC2 deployment. Evaluation results demonstrate that LERC helps speed up data-parallel jobs by up to 37% compared with the widely employed least-recently-used (LRU) policy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑