SHF: Small: Interconnection Networks: Topological Properties and Communication Algorithms

SHF：小型：互连网络：拓扑属性和通信算法

• 批准号: 1015804
• 负责人: Bella Bose
• 金额: $ 20万
• 依托单位: Oregon State University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2010
• 资助国家: 美国
• 起止时间: 2010-09-15 至 2015-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1015804&HistoricalAwards=false
• 关键词: SHF; Small; Interconnection; Networks; Topological

Recent advances in technology have made the design of parallel computers with thousands of processors more feasible. Consequently, the study of different networks for linking processors is an integral part of the design of high-performance computers. This project will study the interconnection topologies of three important families of networks from the point of view of network efficiency. Examples of the type of problems to be considered include: algorithms for efficient communication among processors; effective placement of scarce or otherwise limited resources; and fault-tolerant communication algorithms in the presence of node/link failures. In addition to facilitating graduate training, the project would provide detailed insight for understanding various tradeoffs in designing interconnection networks for large multiprocessor architectures.

技术的最新进展使平行计算机的设计更可行。 因此，链接处理器的不同网络的研究是高性能计算机设计的组成部分。 该项目将从网络效率的角度研究三个重要网络家族的互连拓扑。 要考虑的问题类型的示例包括：处理器之间有效通信的算法；有效地放置稀缺或以其他方式有限的资源；在存在节点/链接失败的情况下，易耐故障的通信算法。除了促进研究生培训外，该项目还将提供详细的见解，以理解为大型多处理器架构设计互连网络的各种权衡。