Paradigms for Parallel Algorithm Design

该项目旨在为一个严格的 研究计划的鲁棒性和有效的范例并行 算法设计 该项目涉及广泛的范例： - 一般范例，包括开发的创新方法 树结构计算，用于设计并行数据结构， 以及用于并行化递归规范 - 脉动架构的高级设计技术，包括 设计与拓扑无关的方案的通用方法 - 计算几何的并行设计方案，包括新颖的 利用输出敏感数量的处理器以及 并行遍历几何结构 - 人工智能技术，包括高效并行 符号约束满足网络的求解与并行 语义网络推理 - 并行计算的鲁棒性研究，包括高度 有效的测试/修改方案和快速的并行接受 测试 此外，PI打算通过实验验证固有开销 在算法中，通过在高级并行中实现它们， 编程语言.

This project aims to develop a theoretical foundation for a rigorous research program on robust and efficient paradigms for parallel algorithm design. The project addresses a broad spectrum of paradigms: - general paradigms, including innovative methods for exploiting treestructured computations, for designing parallel data structures, and for parallelizing recursive specifications - high-level design techniques for systolic architectures, including general methods for designing schemes that are topology independent - parallel design schemes for computational geometry, including novel methods for utilizing an output-sensitive number of processors and for traversing geometric structures in parallel - techniques for artificial intelligence, including efficient parallel solutions of symbolic constraint satisfaction networks and parallel inference in semantic networks - studies in robustness of parallel computations, including highly efficient testing/modifying schemes and fast parallel acceptance testing In addition, the PIs intend to verify experimentally overhead inherent in algorithms, by implementing them in a high-level parallel programming language.