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

AitF：EXPL：用于高性能移动设备的基于域墙内存的便签本中的数据管理

• 批准号: 1535755
• 负责人: Kirk Pruhs
• 金额: $ 39.99万
• 依托单位: University of Pittsburgh
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2015
• 资助国家: 美国
• 起止时间: 2015-09-01 至 2021-09-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1535755&HistoricalAwards=false
• 关键词: AitF; EXPL; Data; Management; Domain

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.

为了在诸如智能电话的移动的设备中实现可扩展的性能改进，重要的是集成更大且更快的存储器。使用传统存储器技术扩大片上存储器的主要限制是尺寸和能量效率。尺寸是一个问题，因为设备必须固有地小才能移动的。能量效率是一个问题，因为电池寿命通常是移动的设备的有用性的限制因素，并且诸如智能电话的移动的设备中的存储器子系统可以消耗总能量的大约三分之一。由于这些限制，诸如智能电话的移动的设备中的每个处理器的存储器量在过去几代技术中保持相对稳定。在移动的设备中结合域壁存储器的新兴技术是有吸引力的，因为它可以以比任何竞争技术更小的体积存储更多的信息，同时使用很少的能量，并且几乎与传统存储器技术一样快。特别地，畴壁存储器被划分为轨道，其像磁带一样，只能被顺序地访问。因此，访问存储在同一磁道内相距很远的两个数据项将是昂贵、耗时的操作。因此，获得域墙存储器的最佳可能性能将需要将智能地管理数据项到存储器中的放置的算法/解决方案，使得域墙存储器的顺序访问属性不会显著降低性能。该项目的目标是设计，分析，测试和部署算法/解决方案的数据分配问题，将出现与采用域墙内存在移动的设备。由于这些数据管理问题具有独特的功能，这些问题的算法的开发可能需要开发新的算法设计和分析技术。开发这些算法的一个很好的实际实现，或者受这些算法启发的实现，将需要对实现问题和常见实例属性有很好的理解。该项目将在计算机体系结构和算法领域对学生进行交叉培训。我们将透过合作及参观，向业界转移技术。我们希望将Domain Wall Memory作为一种软件控制的暂存存储器，广泛应用于嵌入式系统，以实现高性能和能源效益。对于分配在同一域墙内存轨道中的数据项，访问开始于将目标域移动到头部以下，这类似于对顺序访问内存（如磁带和硬盘驱动器）的访问。访问数据项的开销包括读/写开销和移位开销。虽然前者是恒定的，但后者在很大程度上取决于数据项在磁道内的分配方式。因此，在DWM-SPM中优化聚合访问时间主要涉及最小化移位。DWM-SPM的性能将受到用于以下各项的策略的显著影响：（a）轨道管理：数据项如何在轨道内组织/排序，（B）数据布局：数据项如何分配给轨道，以及（c）数据选择：如何选择将存储在DWM-SPM中的数据项。该项目将设计并正式分析用于轨道管理，数据布局，以及畴壁存储器理想模型中的数据选择。形式化算法的优点在于形式化目标可以驱动非直观算法的发现。与此理论研究同时，将创建一个模拟环境来测试管理域墙内存的建议解决方案。这包括硬件建模工具、软件模拟器和基准程序的集合。该项目将开发和实施一些简单的政策，作为比较的基准，并获得代表实践中出现的测试实例，并将理论见解转化为实际实施。然后将这些实现与基线和贪婪启发式解决方案进行比较。