Topological Methods in Distributed and Concurrent Computatioin

分布式并发计算中的拓扑方法

• 批准号: 9912401
• 负责人: Maurice Herlihy
• 金额: $ 29.6万
• 依托单位: Brown University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2000
• 资助国家: 美国
• 起止时间: 2000-07-15 至 2003-06-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9912401&HistoricalAwards=false
• 关键词: Topological; Methods; Distributed; Concurrent; Computatioin

PI: Maurice HerlihyInstitution: Brown UniversityProposal NumberL 9912401Abstract:Concepts and techniques borrowed from combinatorial and algebraic topology have proved to be effective tools of for analyzing distributed and concurrent computation. This approach has yielded a variety of accomplishments, including new results and better formulations of earlier results. The research program described here is extending this work in tow directions. First, it focuses on reformulation classical notions from algebraic and combinatorial topology into a more combinatorial form better-suited to modeling computation. These notions can simplify and unify the analysis of a variety of computational modes. A second, complementary focus is on exploiting algebraic invariants uncovered by topological methods to classify the computational power of various synchronization primitives.

摘要：从组合拓扑和代数拓扑中借鉴的概念和技术已被证明是分析分布式计算和并发计算的有效工具。这种方法取得了各种成就，包括新的成果和较好地阐述了以前的成果。这里所描述的研究计划是在两个方向上扩展这项工作。首先，它侧重于将经典概念从代数和组合拓扑重新表述为更适合建模计算的更组合的形式。这些概念可以简化和统一各种计算模式的分析。第二个互补的重点是利用拓扑方法揭示的代数不变量对各种同步原语的计算能力进行分类。