XPS: FP: DeCoP: Deterministic Cooperative Parallelism

XPS：FP：DeCoP：确定性协作并行性

• 批准号: 1337278
• 负责人: Jose Renau
• 金额: $ 75万
• 依托单位: University of California-Santa Cruz
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2013
• 资助国家: 美国
• 起止时间: 2013-09-15 至 2018-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1337278&HistoricalAwards=false
• 关键词: XPS; FP; DeCoP; Deterministic; Cooperative

Most modern computer systems have multiple computational cores that require parallel applications. Unfortunately, developing reliable and efficient parallel applications is notoriously difficult, in part due to nondeterministic scheduling, which can context-switch between parallel threads at any arbitrary program point. The resulting unpredictability and nondeterminism makes it extremely difficult to develop reliable parallel software.This project proposes to investigate and develop a better model for parallel programming based on extending simple cooperative concurrency to deterministic cooperative parallelism. Cooperative concurrency is a simple non-preemptive model requires minimal synchronization, and under which even buggy or incorrect preemptive programs often execute correctly. This effectively reduces the design complexity. Cooperative concurrency is simple but it does not yield any speedup. This proposal leverages software transactional memory to extract parallelism. The proposal addresses three tightly coupled problems: provide simpler parallel semantics, novel techniques to provide efficient parallel execution, and integrate with existing complementary techniques like automatic parallelization and thread level speculation. Graduate and undergraduate researchers some from under-represented groups will be involved in the research. Overall, the project aims to make a fundamental advanced toward simpler to program parallel applications, with impacts not only in the computer science community but also in other fields like mobile systems.

大多数现代计算机系统具有需要并行应用的多个计算核心。不幸的是，开发可靠和高效的并行应用程序是非常困难的，部分原因是不确定性调度，它可以在任何任意程序点的并行线程之间进行上下文切换。由此产生的不可预测性和不确定性使得开发可靠的并行软件变得非常困难。本项目提出研究和开发一个更好的并行编程模型，该模型基于将简单的协作并行扩展到确定性的协作并行。协同并发是一种简单的非抢占式模型，它需要最少的同步，在这种模型下，即使有错误或不正确的抢占式程序也能正确地执行。这有效地降低了设计的复杂性。协作并发很简单，但它不会产生任何加速。该提议利用软件事务存储器来提取并行性。 该建议解决了三个紧密耦合的问题：提供更简单的并行语义，新的技术，提供高效的并行执行，并与现有的互补技术，如自动并行化和线程级投机。 研究生和本科生研究人员，其中一些来自代表性不足的群体，将参与这项研究。 总的来说，该项目旨在使并行应用程序的编程更简单，不仅在计算机科学界，而且在移动的系统等其他领域产生影响。