课题基金 / 基金详情

AitF: EXPL: Data Management in Domain Wall Memory-based Scratchpad for High Performance Mobile Devices

AitF: EXPL: Data Management in Domain Wall Memory-based Scratchpad for High Performance Mobile Devices
AitF:EXPL:用于高性能移动设备的基于域墙内存的便签本中的数据管理
批准号:
1535755
负责人:
Kirk Pruhs
金额:
$39.99万
依托单位:
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2015
资助国家:
美国
项目状态:
已结题
起止时间:
2015-09-01 至 2021-09-30

项目摘要

项目成果

Kirk Pruhs的其他基金

相似基金

相关文献

中文摘要
翻译
为了在智能手机等移动设备中实现可扩展的性能改进,集成更大、更快的内存非常重要。使用传统存储技术扩展片上存储空间的主要限制因素是尺寸和能效。尺寸是个问题,因为设备本身就必须很小才能移动。能源效率是一个问题,因为电池寿命往往是移动设备有用性的限制因素,而智能手机等移动设备中的存储子系统可能会消耗大约三分之一的总能量。由于这些限制,智能手机等移动设备中的每个处理器的内存量在过去几代技术中保持相对稳定。将新兴的域墙存储技术引入移动设备是很有吸引力的,因为它可以比任何竞争技术以更小的容量存储更多的信息,同时使用更少的能量,并且几乎与传统存储技术一样快。然而,域墙存储具有不同于传统存储技术的物理特性,这可能会潜在地影响性能。具体地说,域墙存储器被划分为磁道,这些磁道像磁带一样只能被顺序访问。因此,访问存储在同一轨道内相隔很远的两个数据项将是昂贵且耗时的操作。因此,获得域墙存储器的最佳性能将需要算法/解决方案,这些算法/解决方案将智能地管理数据项到存储器中的放置,以便域墙存储器的顺序访问特性不会显著降低性能。该项目的目标是设计、分析、测试和部署算法/解决方案,以解决在移动设备中采用域墙内存将出现的数据分配问题。由于这些数据管理问题具有独特的特点,针对这些问题的算法的开发可能需要开发新的算法设计和分析技术。开发这些算法的良好实用实现,或受这些算法启发的实现,将需要对实现问题和常见实例属性有重要的理解。该项目将在计算机体系结构和算法领域对学生进行交叉培训。将通过合作和访问向行业转移技术。很有希望将域墙存储器整合为软件控制的便签式存储器,该存储器已被广泛采用在嵌入式系统中,以实现高性能和能源效率。对于分配在同一域墙存储磁道中的数据项,访问开始于将目标域移到磁头下方,这类似于对磁带和硬盘驱动器等顺序访问存储器的访问。访问数据项的开销包括读/写开销和移位开销。前者是恒定的,而后者在很大程度上取决于数据项在磁道内的分配方式。因此,在DWM-SPM中优化总访问时间在很大程度上涉及最小化移位。DWM-SPM的性能将受到以下策略的显著影响:(A)磁道管理:如何在磁道内组织/排序数据项;(B)数据布局:如何将数据项分配到磁道;以及(C)数据选择:如何选择将存储在DWM-SPM中的数据项。该项目将在理想化的域墙内存模型中设计和形式化分析磁道管理、数据布局和数据选择算法。形式化算法的优势在于形式化目标可以驱动非直观算法的发现。在进行这项理论研究的同时,还将创建一个模拟环境来测试提出的管理域名墙内存的解决方案。这包括组装硬件建模工具、软件模拟器和一组基准程序。该项目将开发和实施一些简单的政策,作为比较的基线,并获得代表那些将在实践中出现的测试实例,并将理论见解转化为实际实施。然后将这些实现与基线和贪婪的启发式解决方案进行比较。
英文摘要
To achieve scalable performance improvement in mobile devices such as smart phones, it is important to integrate a larger and faster memory. The major constraints on enlarging on-chip memory using traditional memory technologies are size and energy efficiency. Size is an issue because devices must inherently be small to be mobile. Energy efficiency is an issue because battery life is often the limiting factor in the usefulness of mobile devices, and the memory subsystem in mobile devices such as smart phones can consume about a third of the total energy. Because of these limitations, the amount of memory per processor in mobile devices such as smart phones has stayed relatively stable over the last few generations of technologies. The incorporation of the emerging technology of Domain Wall Memory in mobile devices is attractive as it can store more information in less volume than any competing technologies, while simultaneously using little energy, and being nearly as fast as traditional memory technologies.However, Domain Wall Memory has physical properties that are different than traditional memory technologies, and that can potentially impact performance. In particular, Domain Wall Memory is divided into tracks, which like a tape, may only be accessed sequentially. Thus accessing two data items stored far apart within the same track will be a costly, time-consuming operation. Thus obtaining the best possible performance of Domain Wall Memory will require algorithms/solutions that will smartly manage the placement of data items into memory so that the sequential access properties of Domain Wall Memory do not significantly degrade performance. The goal of the project is to design, analyze, test and deploy algorithms/solutions for data allocation problems that will arise with the adoption of Domain Wall Memory in mobile devices. As these data management problems have unique features, the development of algorithms for these problems will likely require the development of new algorithmic design and analysis techniques. Developing a good practical implementation of these algorithms, or implementations inspired by these algorithms, will require the development of a significant understanding of both implementation issues and common instance properties. The project will cross-train students in the area of computer architecture and algorithms. Transfer of technology to the industry will bepursued through collaborations and visits.It is promising to incorporate Domain Wall Memory as a software-controlled scratchpad memory, which has been widely adopted in embedded systems for achieving high performance and energy efficiency. For data items allocated in the same Domain Wall Memory track, accesses start with shifting the target domains below the head, which is similar to accesses to sequential access memory such as tape and hard drives. The overhead to access a data item includes both the read/write overhead and the shift overhead. While the former is constant, the latter depends heavily on how the data items are allocated within the track. Thus optimizing aggregate access time in DWM-SPM largely involves minimizing shifts. The performance of DWM-SPM will be significantly affected by the policies used for: (a) Track management: How the data items are organized/ordered within a track, (b) Data layout: How the data items are assigned to tracks, and (c) Data selection: How the data items that will be stored in DWM-SPM are selected.The project will design and formally analyze algorithms for track management, data layout, and data selection in idealized models of Domain Wall Memory. The advantage of formal algorithmics is that the formal objective can drive the discovery of non-intuitive algorithms. Concurrent with this theoretical investigation, a simulation environment will be created to test proposed solutions to managing Domain Wall Memory. This includes the assembly of hardware modeling tools, software simulators, and a collection of benchmark programs. The project will develop and implement some simple policies to serve as a baseline to compare against, and obtain test instances representative of those that would arise in practice, and will transfer the theoretical insights into actual implementations. These implementations would then be compared to the baseline and greedy heuristic solutions.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
AF: SMALL: Relational Algorithms
  • 批准号:
    2209654
  • 项目类别:
    Standard Grant
  • 资助金额:
    $25.08万
  • 财政年份:
    2022
  • 负责人:
    Kirk Pruhs
  • 依托单位:
EAGER: AF:Small: Algorithms for Relational Machine Learning
  • 批准号:
    2036077
  • 项目类别:
    Standard Grant
  • 资助金额:
    $14.88万
  • 财政年份:
    2020
  • 负责人:
    Kirk Pruhs
  • 依托单位:
AF:Small: Algorithmic Management of Heterogeneous Resources
  • 批准号:
    1907673
  • 项目类别:
    Standard Grant
  • 资助金额:
    $23.94万
  • 财政年份:
    2019
  • 负责人:
    Kirk Pruhs
  • 依托单位:
AF: Small: Algorithmic Energy Management in New Information Technologies
  • 批准号:
    1421508
  • 项目类别:
    Standard Grant
  • 资助金额:
    $39.96万
  • 财政年份:
    2014
  • 负责人:
    Kirk Pruhs
  • 依托单位:
海外基金