On a Class of Scalable Networks: Design, Performance and VLSI Layout

一类可扩展网络：设计、性能和 VLSI 布局

• 批准号: 9403191
• 负责人: Dharma Agrawal
• 金额: $ 4.04万
• 依托单位: North Carolina State University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1994
• 资助国家: 美国
• 起止时间: 1994-06-15 至 1996-05-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9403191&HistoricalAwards=false
• 关键词: Class; Scalable; Networks; Design; Performance

This project is a study of a two level interconnection networks, called dBcubes, in which hypercube subgraphs are interconnected by a de Bruijn graph. The purported advantage of this scheme is scalability. The hypercubes provide high local connectivity, while the de Bruijn graph allows a combination of fixed degree and low diameter. The goal of this project is to determine whether the study of interconnection networks of this type is relevant to practical computer architectures. Topics to be investigated include replacement of either the hypercubes or the de Bruijn graph with simpler graphs, a study of wormhole routing, algorithm embedding, and several implementation issues.

这个项目是一个两级互连网络的研究，称为dBcubes，其中超立方体子图通过de Bruijn图互连。 该方案的优势在于可扩展性。 超立方体提供高的局部连通性，而de Bruijn图允许固定度和低直径的组合。 这个项目的目标是确定这种类型的互连网络的研究是否与实际的计算机体系结构有关。 要调查的主题包括更换超立方体或de Bruijn图与简单的图形，研究虫洞路由，算法嵌入，和几个实现问题。