优化混合缓存系统：随机建模与大数据分析挑战
32 浏览量
更新于2024-08-27
收藏 468KB PDF 举报
随着大数据分析需求的日益增长，对大规模内存系统的需求也在增加。然而，由于动态随机存取内存(DRAM)的成本较高，一些研究者开始探索非易失性存储器(NVM)技术作为构建大型内存计算系统的一种可能选择。混合缓存系统（Hybrid Cache Systems）在这种背景下成为一个关键的研究领域，它旨在结合两种或多种类型的存储介质，以实现性能优化、成本效益和存储效率。
本文"Stochastic Modeling of Hybrid Cache Systems"由Gaoying Ju、Yongkun Li、Yinlong Xu、Jiqiang Chen和John C. S. Lui等人合作撰写，他们分别来自中国科学技术大学、国防科技大学和香港中文大学。该研究发表于arXiv上，版本为1607.00714v2，并在2016年9月30日进行了更新。文章的核心目标是系统性地分析和设计混合缓存系统，从一个整体系统的角度来评估NVM技术在经济和技术上的可行性。
混合缓存系统的设计必须考虑多个关键因素，包括但不限于：
1. **性能优化**：通过合理配置不同类型的缓存（如DRAM、NVM或SSD），如何提高数据访问速度，减少延迟，同时保证系统的并发性和响应时间。
2. **成本效益分析**：比较DRAM与NVM等不同存储介质的成本效益，考虑长期运行和维护成本，以及可能的升级路径。
3. **能耗管理**：NVM通常具有更低的能耗，但其写入操作可能不如DRAM快。研究者需要建立模型来平衡能耗与性能之间的关系。
4. **寿命和可靠性**：NVM的记忆保持时间和数据持久性是重要因素，模型需要考虑这些特性对系统可靠性的潜在影响。
5. **缓存一致性策略**：如何设计缓存一致性算法，确保在不同存储类型之间进行数据交换时，系统的一致性和数据完整性得到保障。
6. **随机性建模**：针对混合缓存系统的不确定性和随机性，研究者可能使用概率论和统计方法来建模数据访问行为，以便预测系统性能并进行优化。
7. **硬件和软件协同**：设计中还需考虑硬件和软件的协同工作，比如缓存替换策略、内存调度算法等，以充分利用各种存储资源。
这篇论文深入探讨了混合缓存系统中的随机建模问题，为理解NVM技术在大规模内存系统中的应用提供了重要的理论基础。通过系统级的分析，作者试图回答关于NVM是否能成为DRAM的可行替代品这一核心问题，为未来的内存系统设计提供有价值的指导。
+
...
...
... ...
Victim Page Cache Miss
-
(a) Flat Architecture
...
...
+
...
...
(b) Layered Architecture
Fig. 1. Architecture of hybrid cache.
probability 1−α. Note that α is a tunable parameter, and
increasing it implies that D-Cache is more preferred to
be used. In the flat architecture, pages are never migrated
between the two types of caches.
Note that both D-Cache and N-Cache contain multiple
lists. To exploit workload locality, we let pages be
first buffered in the list with the smallest label in the
corresponding cache, and then upgrade to the larger-
numbered lists when they become hot (e.g., when cache
hit happens). That is, lists in the same cache device are
organized in a layered structure.
• Layered architecture: In this design, we use D-Cache as a
caching layer for N-Cache as shown in Figure 1(b). Par-
ticularly, new data page is directly buffered in N-Cache
first, and when page in the list of the largest label in N-
Cache is accessed, it is upgraded to D-Cache. Similarly,
we also organize lists in both D-Cache and N-Cache in
a layered structure. Note that data migration between D-
Cache and N-Cache happens here, and usually, data in
D-Cache is considered to be hotter than data in N-Cache.
B. Cache Replacement Algorithm
For cache replacement, we follow the list-based algorithm
introduced in [6], and extend it to hybrid cache with different
architectures. Roughly speaking, a new data page enters into
a cache through the first list and moves to the upper list by
exchanging with a randomly selected data page whenever a
cache hit occurs. Specifically, when a data page k is requested
at time t, one of the three events below happens:
• Cache miss: Page k is not in D-Cache nor N-Cache. In
this case, page k enters into the first list in D-Cache
(i.e., list l
h
N
+1
) with probability α or into the first list
in N-Cache (i.e., list l
1
) with probability (1 − α) under
the flat architecture. For the layered architecture, page k
enters into the first list of N-Cache (i.e., list l
1
). For both
architectures, the position in the list for writing page k is
chosen uniformly at random. Meanwhile, the victim page
in the position moves back to list 0.
• Cache hit in list l
i
where l
i
6= l
h
N
and l
i
6= l
h
: In this
case, page k moves to a randomly selected position v of
list l
i+1
, meanwhile, the victim page in position v of list
l
i+1
takes the former position of page k.
• Cache hit in list l
i
where l
i
= l
h
N
or l
i
= l
h
: In this
case, page k remains at the same position under the flat
architecture. However, for the layered architecture with
l
i
= l
h
N
, page k moves to a random position in list l
i+1
as in the second case.
Figure 1 shows the data flow under flat and layered archi-
tectures. Note that data migration happens between lists of the
same type of cache, while the migration between D-Cache and
N-Cache happens only in the case of layered architecture.
C. Design Issues
Note that the overall performance of a hybrid cache system
may depend on various factors, such as system architecture,
capacity allocation between DRAM and NVM, as well as
the configuration parameters like the number of lists in each
cache device. Thus, it poses a wide range of design choices
for hybrid cache, which makes it very difficult to explore
the full design space and optimize the cache performance.
To understand the impact of hybrid cache design on system
performance, in this work, we aim to address the following
issues by developing mathematical models.
• For each architecture (flat or layered), what is the impact
of the list-based hierarchical design, and how to set the
best parameters so as to optimize the overall performance,
including the numbers of lists h
D
and h
N
, as well as the
preference parameter α for the flat architecture?
• Which architecture should be used when considering both
DRAM and NVM into a hybrid design?
• Under a fixed budget C, what is the best capacity
allocation of each cache type for better performance?
III. SYSTEM MODEL
In this section, we first describe the workload model, then
characterize the dynamics of data pages in hybrid cache, and
finally derive the cache content distribution in steady state.
After that, we define a latency-based performance metric based
on the cache content distribution so as to quantify the overall
cache performance.
A. Workload Model
In this work, we focus on cache-effective applications like
web search and database query [22], [11], in which memory
and I/O latency are critical to system performance. Thus,
caching files in main memory becomes necessary to provide
sufficient throughput for these applications. To provide high
data reliability, we assume to use the write-through policy, in
which data is also written to the storage tier once it is buffered
in the page cache. With this policy, all data pages in cache
should have a copy in the secondary storage.
In this paper, we focus on the independent reference model
[6] in which requests in a workload are independent of each
other. Since cache mainly benefits the read performance, we
focus on read requests only, while we can also extend our
model to write requests. Suppose that we have n total data
pages in the system. In each time slot, one read request arrives,
and it accesses data pages according to a particular distribution
where page k (k = 1, 2, ..., n) is accessed with probability p
k
.
Clearly, we have
P
n
k=1
p
k
= 1. Without loss of generality,
we assume that pages are sorted in the decreasing order of
剩余13页未读，继续阅读
2021-07-16 上传
2024-10-26 上传
2024-10-26 上传
2024-10-26 上传
点击了解资源详情
点击了解资源详情
点击了解资源详情
点击了解资源详情
weixin_38581777
- 粉丝: 4
- 资源: 917
我的内容管理
展开
