RUI: Chaos in Computer Memories

最近发表的结果表明，分形几何可以 有效地用于模拟自我的偏度和程度， 所产生的存储器访问模式所表现出的相似性 处理器。 分形模型可以用来 预测程序在内存的多个级别上的行为 层次结构，这些级别的性能可以在 转向预测，意味着存储器访问模式是高度 结构化。 不幸的是，这种结构也是高度不规则的， 绝大多数已提出的模型 模拟程序行为必须依赖于过度简化， 不切实际的假设， 访问的独立性。 一些初步结果表明， 在某些情况下，特别是当一个过程 分配了太少的缓存存储，其内存访问模式 会导致该高速缓存混乱，从而产生较差的缓存 性能 本研究探讨了混沌产生的条件 缓存设计参数如何影响它， 行为影响缓存性能，并应用这些 结果线程和缓存分区，两种方法 为混沌提供了潜在的有利条件， 出现

Recent published results show that fractal geometry can be effectively used to model the skewness and degree of self- similarity exhibited by the memory-access patterns generated by processors. The fact that the fractal model can be used to predict the behavior of programs at many levels of the memory hierarchy, and that the performance of those levels can be in turn predicted, implies that memory access patterns are highly structured. Unfortunately, this structure is also highly irregular, and the vast majority of models that have been proposed to simulate program behavior must rely on over-simplifying and unrealistic assumptions of uniformity of access and/or of independence of access. Some preliminary results show that under some conditions, in particular when a process is allocated too little cache storage, its memory access pattern results in chaos in the cache, yielding poor cache performance. This research investigates the conditions under which chaos occurs, how cache design parameters influence it, how chaotic behavior influences cache performance, and applies these results to threading and cache partitioning, two methodologies that present potentially favorable conditions for chaos to appear.