首页> 外文会议>International symposium on applied reconfigurable computing >A Dynamic Cache Architecture for Efficient Memory Resource Allocation in Many-Core Systems
【24h】

A Dynamic Cache Architecture for Efficient Memory Resource Allocation in Many-Core Systems

机译:用于多核系统中有效内存资源分配的动态缓存体系结构

获取原文

摘要

Today's computing systems still mostly consist of homogeneous multi-core processing systems with statically allocated computing resources. Looking into the future, these computing systems will evolve to heterogeneous processing systems with more diverse processing units and new requirements. With multiple applications running concurrently on these many-core platforms, these applications compete for computational resources and thus processing power. However, not all applications are able to efficiently make use of all available resources at all times, which leads to the challenge to efficiently allocate tasks to computational resources during run-time. This issue is especially crucial when looking at cache resources, where the bandwidth and the available resources strongly bound computation times. For example, streaming based algorithms will run concurrently with block-based computations, which leads to an inefficient allocation of cache resources. In this paper, we propose a dynamic cache architecture that enables the parameterization and the resource allocation of cache memory resources between cores during run-time. The reallocation is done with only little overhead such that each algorithm class can be more efficiently executed on the many-core platform. We contribute with a cache architecture that is for the first time prototyped on programmable hardware to demonstrate the feasibility of the proposed approach. At last we evaluate the overhead introduced by the increased flexibility of the hardware architecture.
机译:当今的计算系统仍主要由具有静态分配的计算资源的同类多核处理系统组成。展望未来,这些计算系统将演变为具有更多不同处理单元和新要求的异构处理系统。在这些多核平台上同时运行多个应用程序时,这些应用程序将争夺计算资源,从而争夺处理能力。但是,并不是所有的应用程序都能够始终有效地利用所有可用资源,这带来了在运行时向计算资源有效分配任务的挑战。在查看缓存资源时,此问题尤为重要,因为在缓存资源中,带宽和可用资源强烈限制了计算时间。例如,基于流的算法将与基于块的计算同时运行,这导致缓存资源的分配效率低下。在本文中,我们提出了一种动态高速缓存体系结构,该体系结构可在运行时实现内核之间高速缓存内存资源的参数化和资源分配。重新分配只需很少的开销即可完成,因此每个算法类都可以在多核平台上更有效地执行。我们提供了一种缓存架构,该架构首次在可编程硬件上进行了原型设计,以证明所提出方法的可行性。最后,我们评估了硬件体系结构灵活性增加带来的开销。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号