Algorithmic Support for Parallel Architectures

并行架构的算法支持

• 批准号: 9221785
• 负责人: Arnold Rosenberg
• 金额: $ 25.5万
• 依托单位: University of Massachusetts Amherst
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1993
• 资助国家: 美国
• 起止时间: 1993-08-01 至 1997-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9221785&HistoricalAwards=false
• 关键词: Algorithmic; Support; Parallel; Architectures

This research is based on the theme of using algorithmic techniques to enhance the performance and flexibility of parallel architectures. Specific projects span a spectrum from traditional topics, such as task scheduling and load balancing, to less familiar ones, such as using emulations to achieve architectural flexibility (e.g., reconfigurability); from foundational questions concerning the potential and the limitations of various modalities of computation and communication (e.g., the limitations of bufferless communication), to more immediately applicable studies of algorithmic techniques that endow a parallel architecture with facilities that would be prohibitively expensive to provide in hardware (e.g., a multigauging capability). The program is motivated by three observations: (1) the speed of processors in parallel architectures increases faster than the speed of the communication subsystem; (2) the potential of parallel computation is realized only when programmers are liberated from having to manage the detailed physical resources (number of processors, interconnection topology, etc.) of their machines; (3) technological developments are continually creating new modalities of parallel computation. All three of these phenomena increase the importance of developing algorithms that enhance the computing power of parallel architectures. Observation (1) suggests that we can now relegate to software chores that previously demanded the speed and concomitant cost of hardware implementation. Observation (2) points out the increasing need for algorithms that enhance the portability of parallel programs. Observation (3) suggests the need to understand emerging modalities of parallel computation, in order to exploit them effectively.

本研究的主题是使用算法技术，以提高并行架构的性能和灵活性。 具体的项目涵盖了从传统主题（如任务调度和负载平衡）到不太熟悉的主题（如使用仿真来实现架构灵活性（例如， 可重构性）; 从关于计算和通信的各种模式的潜力和限制的基本问题（例如，无缓冲器通信的局限性），到对算法技术的更直接可应用的研究，该算法技术赋予并行体系结构以在硬件中提供将过于昂贵的设施（例如，多测量能力）。 该计划是出于三个观察：（1）在并行架构的处理器的速度 比通信子系统的速度增加得更快;（2）只有当程序员从必须管理详细的物理资源（处理器的数量、互连拓扑等）中解放出来时，才能实现并行计算的潜力。 （3）技术发展不断创造新的并行计算模式。 所有这三种现象都增加了开发增强并行架构计算能力的算法的重要性。 观察结果（1）表明，我们现在可以把以前需要硬件实现的速度和随之而来的成本的工作交给软件。 观察（2）指出了对增强并行程序可移植性的算法的日益增长的需求。 观察结果（3）表明，需要了解并行计算的新兴模式，以便有效地利用它们。