SHF: Medium: Algorithmic lambda-Calculus for the Design, Analysis, and Implementation of Parallel Algorithms

SHF：Medium：用于并行算法设计、分析和实现的算法 lambda 演算

基本信息

批准号：
1901381
负责人：
Guy Blelloch
金额：
$ 119.98万
依托单位：
Carnegie-Mellon University
依托单位国家：
美国
项目类别：
Continuing Grant
财政年份：
2019
资助国家：
美国
起止时间：
2019-07-01 至 2024-06-30
项目状态：
已结题

来源：
https://www.nsf.gov/awardsearch/showAward?AWD_ID=1901381&HistoricalAwards=false
关键词：
SHF Medium Algorithmic lambda Calculus

项目摘要

The hardware advances of recent years have brought multicore chips and parallel computing to the mainstream. While there have been many advances in parallel software for such multicore chips over the past decade, there is still no satisfactory model for analyzing the performance of parallel algorithms. In particular, and unlike the case for sequential algorithms, there is a gap between cost models for estimating performance of algorithms and easy to use programming models for implementing the algorithms. This project is developing a practical approach to parallel algorithms by bringing together two fundamental but distinct theories of computing---one based on machine models and following the work that dates back to Dr. Alan Turing, and the other based on language models and following the work that dates back to Dr. Alonzo Church. The novelty of the project is in combining these two theories, for which there is currently a large rift. The impact of the project is in making significant steps in simplifying the design and analysis of parallel algorithms, and better understanding of the relationship between the two theories of computing. The educational component of this project involves teaching undergraduates parallel algorithms and creates ample opportunities to test the practical effectiveness of the proposed approach, along with concrete efforts to broaden participation in computing through programs at Carnegie-Mellon University.The work is following an end-to-end methodology bridging Church and Turing's theories along with practice. On the theory side, the project is developing a calculus called the ``algorithmic lambda-calculus,'' that equips Church's lambda-calculus with a cost semantics, making it possible to reason about the total work and parallel span (time) of programs, which in turn can be used to understand the performance of algorithms, at least asymptotically. To show that this calculus is realizable, the project is theoretically establishing that the calculus is faithful to a transition semantics, which can then be efficiently realized on an abstract machine such as the Parallel-RAM. On the practical side, the project is developing a programming language and a compiler that faithfully implements this theory. The project is also extending the algorithmic lambda-calculus, the realizability theorems, and the implementation to support important features such as aggregate parallel data structures, interaction, and different forms of parallelism.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

近年来硬件的进步使多核芯片和并行计算成为主流。尽管在过去十年中，用于此类多核芯片的并行软件取得了许多进步，但仍然没有令人满意的模型来分析并行算法的性能。特别是，与顺序算法的情况不同，用于估计算法性能的成本模型与用于实现算法的易于使用的编程模型之间存在差距。该项目正在开发一种实用的并行算法方法，将两种基本但不同的计算理论结合在一起——一种基于机器模型并遵循艾伦·图灵博士的工作，另一种基于语言模型并遵循这项工作的历史可以追溯到阿隆佐·丘奇博士。该项目的新颖之处在于将这两种理论结合起来，目前这两种理论存在很大分歧。该项目的影响在于在简化并行算法的设计和分析方面迈出了重要的一步，并更好地理解两种计算理论之间的关系。该项目的教育部分包括向本科生讲授并行算法，并创造充足的机会来测试所提出方法的实际有效性，以及通过卡内基梅隆大学的项目扩大对计算的参与的具体努力。这项工作遵循最终目标-最终将丘奇和图灵的理论与实践联系起来的方法论。在理论方面，该项目正在开发一种名为“算法 lambda 演算”的演算，它为 Church 的 lambda 演算配备了成本语义，使得推理程序的总工作量和并行跨度（时间）成为可能，这又可以用来理解算法的性能，至少是渐近的。为了证明这种演算是可实现的，该项目从理论上证明该演算忠实于转换语义，然后可以在并行 RAM 等抽象机上有效地实现。在实践方面，该项目正在开发一种忠实实现这一理论的编程语言和编译器。该项目还扩展了算法 lambda 演算、可实现性定理和实现，以支持聚合并行数据结构、交互和不同形式的并行性等重要功能。该奖项反映了 NSF 的法定使命，并被认为值得支持通过使用基金会的智力优点和更广泛的影响审查标准进行评估。

项目成果

期刊论文数量（27）

专著数量（0）

科研奖励数量（0）

会议论文数量（0）

专利数量（0）

Program equivalence for assisted grading of functional programs

功能程序辅助评分的程序等效性

DOI：
10.1145/3428239
发表时间：
2020
期刊：
Proceedings of the ACM on Programming Languages
影响因子：
0
作者：
Clune, Joshua;Ramamurthy, Vijay;Martins, Ruben;Acar, Umut A.
通讯作者：
Acar, Umut A.

Provably space-efficient parallel functional programming

经证明节省空间的并行函数式编程

DOI：
10.1145/3434299
发表时间：
2021
期刊：
Proceedings of the ACM on Programming Languages
影响因子：
0
作者：
Arora, Jatin;Westrick, Sam;Acar, Umut A.
通讯作者：
Acar, Umut A.

WARDen: Specializing Cache Coherence for High-Level Parallel Languages

WARDen：专门针对高级并行语言的缓存一致性

DOI：
10.1145/3579990.3580013
发表时间：
2023
期刊：
Proceedings of the 21st ACM/IEEE International Symposium on Code Generation and Optimization
影响因子：
0
作者：
Wilkins, Michael;Westrick, Sam;Kandiah, Vijay;Bernat, Alex;Suchy, Brian;Deiana, Enrico Armenio;Campanoni, Simone;Acar, Umut A.;Dinda, Peter;Hardavellas, Nikos
通讯作者：
Hardavellas, Nikos

Parallelism in Randomized Incremental Algorithms