Theory of Parallel and Distributed Computation

并行与分布式计算理论

• 批准号: 9504145
• 负责人: C. Greg Plaxton
• 金额: $ 19.2万
• 依托单位: University of Texas at Austin
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1995
• 资助国家: 美国
• 起止时间: 1995-09-01 至 1999-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9504145&HistoricalAwards=false
• 关键词: Theory; Parallel; Distributed; Computation

The goals of this continuing research project are to identify primitive operations in parallel and distributed computation, and to establish tight bounds on their complexity. Within this general framework, emphasis is placed on: (i) The design and analysis of algorithms for REALIZABLE models of parallel and distributed computation; (ii) the development of techniques that are applicable for a wide range of computational models and problem variations; (iii) the analysis of `simple` classes of algorithms which are easy to implement. This project concentrates on the following areas: (a) normal hypercube algorithms; (b) sorting networks; (c) list ranking; (d) algorithms for distributed networks, in particular, for the dynamic asynchronous network model; and (e) multiple-resource scheduling.

这个持续的研究项目的目标是确定并行和分布式计算中的原始操作，并建立严格的限制其复杂性。 在这个总体框架内，重点放在：（一）设计和分析的算法，可实现的模型的并行和分布式计算;（二）技术的发展，适用于广泛的计算模型和问题的变化;（三）分析的“简单”类的算法，易于实现。 该项目集中在以下领域：（a）正常超立方体算法;（B）排序网络;（c）列表排序;（d）分布式网络的算法，特别是， 动态异步网络模型; 以及（e）多资源调度。