XPS: FULL:CCA: Extracting Scalable Parallelism by Relaxing the Contracts across the System Stack

XPS：FULL：CCA：通过放松整个系统堆栈的契约来提取可扩展的并行性

• 批准号: 1439021
• 负责人: Mahmut Kandemir
• 金额: $ 85万
• 依托单位: Pennsylvania State Univ University Park
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2014
• 资助国家: 美国
• 起止时间: 2014-08-01 至 2019-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1439021&HistoricalAwards=false
• 关键词: XPS; FULL; CCA; Extracting; Scalable

Technology scaling trends have made parallelism the de-facto standard for enhancing performance across a spectrum of computing environments spanning from high-end computing to embedded platforms. Yet, the software is woefully lagging in its ability to extract usable parallelism offered by the underlying hardware platforms primarily because of the compartmentalized contracts between the different layers of the system stack. Rigid contracts restrict the ability to leverage a rich design space of performance/power/correctness trade-offs within and across layers, that could be achievable by straying slightly from the contract. Although such a relaxed contract, referred to as approximate computing, has received attention recently, much of the work in this area is still compartmentalized and lacks a holistic cross-layer strategy to maximize parallelism, while adhering to power and correctness mandates. Thus, the motivation of this project is to explore a holistic cross-layer approach to approximate computing spanning application, runtime system, compiler and hardware, thereby breaking the rigidity of the contracts between the layers, while still allowing them to cooperate for extracting the achievable parallelism across a diverse set of applications in both the high-end and mobile computing environments. Specifically, it involves application-level analysis of the scope of approximation for computation, data access and synchronization, designing efficient hardware mechanisms that could facilitate and benefit from approximation, and developing compiler and runtime support for expressing, exploiting and evaluating/validating the approximations in an architecture-aware fashion. This cross-layer approach to approximate computing is expected to play a crucial role towards achieving scalable parallelism for the next decade and beyond, with a potentially high impact to the computing industry. In addition, the tools and models developed from this project are disseminated in the public domain to a broader research community, and the PIs engage in a variety of outreach activities such as recruiting women and minority and involvement of local high school students through Penn State Eberly College's Exploration-U initiatives.

技术扩展趋势使并行性成为跨越跨度环境的性能的事实上的标准，这些计算环境从高端计算到嵌入式平台。然而，该软件却滞后于提取基础硬件平台提供的可用并行性的能力，这主要是因为系统堆栈的不同层之间的隔间合同。严格的合同限制了利用层次和跨层的富绩效/正确性权衡的丰富设计空间的能力，这可以通过略微偏离合同来实现。尽管这种轻松的合同最近被称为近似计算，最近引起了人们的关注，但该领域的许多工作仍被划分，并且缺乏整体的跨层策略，以最大程度地提高并行性，同时遵守权力和正确性要求。 因此，该项目的动机是探索一种整体跨层方法，用于近似计算应用程序，运行时系统，编译器和硬件，从而破坏了层之间的合同的刚性，同时仍可以合作地提取可实现的并行性在高端和移动计算环境中的多样化应用程序集合。具体而言，它涉及对计算，数据访问和同步近似范围的应用级分析，设计有效的硬件机制，这些机制可以促进和受益于近似值，并开发编译器和运行时支持以表达，利用和评估和评估和验证建筑时尚的近似值。预计这种跨层计算方法将在未来十年及以后的可扩展并行性方面发挥至关重要的作用，并可能对计算行业产生高影响。此外，该项目开发的工具和模型将在公共领域传播到更广泛的研究社区，PIS从事各种外展活动，例如招募妇女和少数群体以及通过宾夕法尼亚州立大学Eberly College的探索活动对当地高中生的参与。

项目成果

Getting more performance with polymorphism from emerging memory technologies

• DOI: 10.1145/3319647.3325826
• 发表时间: 2019-05
• 期刊: Proceedings of the 12th ACM International Conference on Systems and Storage
• 作者: Iyswarya Narayanan;Aishwarya Ganesan;Anirudh Badam;Sriram Govindan;Bikash Sharma;A. Sivasubramaniam