PYI: Complexity of Parallel Algorithms

PYI：并行算法的复杂性

• 批准号: 8657562
• 负责人: Richard Anderson
• 金额: $ 31.6万
• 依托单位: University of Washington
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1987
• 资助国家: 美国
• 起止时间: 1987-08-01 至 1993-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=8657562&HistoricalAwards=false
• 关键词: PYI; Complexity; Parallel; Algorithms

The PI is studying the complexity of parallel algorithms. One direction of the research is to develop fast parallel algorithms for simple combinatorial problems using an idealized model of parallel computation. The major issue is to identify techniques that yield algorithms that are both fast and make an efficient use of processors. A second direction of research is to study realistic models of parallel computation. There is currently a large gap between the theoretical models of parallel computation and feasible parallel machines. An attempt is being made to close this gap by studying models that incorporate features such as locality of reference, memory contention and varying degrees of synchronization. The PI has been judged to be an outstanding computer scientist by the Presidential Young Investigator panel.

PI正在研究并行算法的复杂性。 一 的研究方向是开发快速并行算法， 简单的组合问题，使用一个理想化的并行模型 计算 主要的问题是确定技术， 这些算法既快速又有效地利用了处理器。 第二个研究方向是研究并行的现实模型， 计算 目前理论上的差距很大， 并行计算模型和可行的并行机。 一个 正在试图通过研究模型来缩小这一差距， 结合了诸如引用局部性、存储器争用 和不同程度的同步。 PI被评为杰出的计算机科学家， 总统青年调查员小组