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.

最近的技术进步使得具有数千个处理器的并行计算机的设计变得更加可行。 因此，研究用于链接处理器的不同网络是高性能计算机设计的一个组成部分。 本项目将从网络效率的角度研究三个重要网络系列的互连拓扑。 要考虑的问题类型的示例包括：处理器之间有效通信的算法；有效配置稀缺或有限的资源；以及出现节点/链路故障时的容错通信算法。除了促进研究生培训之外，该项目还将提供详细的见解，帮助理解大型多处理器架构设计互连网络时的各种权衡。