Adaptive Routing Protocols in Massively Parallel Architectures

大规模并行架构中的自适应路由协议

• 批准号: 9214244
• 负责人: Sudhakar Yalamanchili
• 金额: $ 10.5万
• 依托单位: Georgia Tech Research Corporation
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1993
• 资助国家: 美国
• 起止时间: 1993-04-01 至 1995-09-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9214244&HistoricalAwards=false
• 关键词: Adaptive; Routing; Protocols; Massively; Parallel

The research is concerned with the discovery and development of adaptive routing protocols for massively parallel architectures using Hypercube Interconnection Networks (HINs). This class includes the well known binary n-cube, k-ary n- cube, and multidimensional arrays. A taxonomy of routing protocols is developed and used to focus attention on distinct classes. Two new concepts will be developed and explored in this study. First, the properties of conservatism and optimism of these protocols will be rigorously characterized. The effect of these properties on message latency, network bandwidth, and network topology will be studied. Second, the class of multi-phase protocols will be introduced and developed. These are protocols whose behavior is a function of the distance of a message from the destination. The proposed router architectures will be modeled and evaluated via simulation. Particular attention will be focused on the evaluation of performance in the presence of implementation constraints such as wiring complexity, pin count, and link layer protocols.

该研究关注的是使用超立方体互连网络（HINs）的大规模并行架构的自适应路由协议的发现和开发。这个类包括众所周知的二进制n立方、k元n立方和多维数组。开发了路由协议的分类法，并将其用于将注意力集中在不同的类上。本研究将发展和探讨两个新概念。首先，对这些协议的保守性和乐观性进行了严格的表征。这些属性对消息延迟、网络带宽和网络拓扑的影响将被研究。其次，将介绍和开发一类多阶段协议。这些协议的行为是消息到目的地距离的函数。提出的路由器架构将通过仿真建模和评估。我们将特别关注在布线复杂性、引脚数和链路层协议等实现约束条件下的性能评估。