International Travel Support for Research in Resilient Parallel Computation: University of Paris, France: Oct- Dec 1992

弹性并行计算研究国际旅行支持：法国巴黎大学：1992 年 10 月至 12 月

• 批准号: 9103953
• 负责人: Zvi Kedem
• 金额: $ 21.07万
• 依托单位: New York University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1991
• 资助国家: 美国
• 起止时间: 1991-09-01 至 1994-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9103953&HistoricalAwards=false
• 关键词: International; Travel; Support; Research; Resilient

The investigators propose to develop theoretical foundations for automatic and efficient methods to translate programs written for ideal abstract shared-memory parallel machines to programs for more realistic (but still abstract) parallel machines. "Realistic" in this context means that components of the machines may suffer failures or that different components may execute at different speeds. The first step in the translation is to divide the parallel program written for the ideal abstract machine into fragments whose different portions do not interfere with one another. Each such program fragment will be transformed to a program on the more realistic machine, which executes the fragment fast but only "tentatively"; that is, the result is correct only with high probability. Then the realistic machine checks whether the tentative computation was correct. If so, the fragment has completed its execution, otherwise its effects will be undone and it will be re-executed. Algorithmic ideas are drawn from the literature on randomization and transaction processing. The significance of the proposed work is that many algorithms have been developed for ideal shared-memory parallel machines, since they are easy to program and understand. The success of the research will contribute to the theoretical foundation of the automatic translation of such algorithms to programs executing efficiently on more realistic machines.

研究人员建议发展理论基础， 自动和有效的方法来翻译程序编写的 理想的抽象共享内存并行机程序， 现实的（但仍然是抽象的）并行机。 “现实”在这 上下文意味着机器的组件可能会发生故障， 不同的组件可以以不同的速度执行。 翻译的第一步是划分并行程序 为理想的抽象机器编写的片段， 各部分不会相互干扰。 每个这样的程序 将片段转化为程序就更逼真了 机器，它快速执行片段，但只是“暂时”; 结果只有在高概率下才是正确的。 则 真实的机器会检查试验性的计算是否 正确. 如果是，则片段已完成执行，否则 它的效果将被撤销并重新执行。 算法 思想来自于随机化和交易的文献， 处理. 所提出的工作的意义是，许多算法具有 是为理想的共享内存并行机开发的，因为它们 易于编程和理解。 这项研究的成功将 为自动翻译奠定了理论基础 这样的算法，以程序执行效率更现实 机械.