互连网络拓扑等价的图分析法

提出了描述互连网络拓扑等价的图分析法。获得了全交叉网络与基准，逆基准，Ｏｍｅｇａ，ｆｌｉｐ，Ｓ＝Ｆ＝２ＳＷ榕树，简化数据变换等多级互连网络拓扑等价的逻辑名结构。阐明了用光学全交叉网络模拟实现上述网络的互连函数的原理及其多处理机，电信交换等领域的潜在应用。     

On-Chip Interconnection Architecture of the Tile Processor

IMesh, the tile processor architecture's on-chip interconnection network, connects the multicore processor's tiles with five 2D mesh networks, each specialized for a different use. taking advantage of the five networks, the C-based ILIB interconnection library efficiently maps program communication across the on-chip interconnect. the tile processor's first implementation, the tile64, contains 64 cores and can execute 192 billion 32-bit operations per second at 1 Ghz.     

The deflection self-routing Delta network: a dynamically fault-tolerant high-radix multistage interconnection network

High-radix multistage interconnection networks are popular interconnection technologies for parallel supercomputers and cluster computers. In this paper, we presented a new dynamically fault-tolerant high-radix multistage interconnection network using a fully-adaptive self-routing. To devise the fully-adaptive self-routing for recovering the misrouting around link faults in such network, we introduce an abstract algebraic analysis of the topological structure of the high-radix Delta network. The presented interconnection network provides multiple paths by using all the links of all the stages of the network. We also present a mathematical analysis of the reliability of the interconnection network for quantitative comparison against other networks. The MTTF of 64×64 network proposed is 2.2 times greater than that of the cyclic Banyan network. The hardware cost of the proposed network is half that of the cyclic Banyan network and the 2D ring-Banyan network.     

几种超立方体互连结构性能研究

随着并行处理系统规模的不断扩大,人们开始广泛使用超级互连结构,本文通过研究网络结构的性能价格比,对几种常用的超级立方体互连结构做了分析,得出了一些有用的结论。     

Coset networks as connectors in parallel processors

An active area of research regarding parallel computer systems deals with the design of interconnection networks. Among all interconnection networks, permutation networks play a special role as all other networks can be constructed using such networks. It was recently shown that many permutation networks reported in the literature are manifestations of coset decompositions of symmetric groups. This result is generalized here to obtain several other previously unknown permutation networks which satisfy such decompositions. In addition, analyses of the edge-count, propagation delay, fan-out, and setup time of such networks are provided. The results lead to some anomolous behavior as well as several trade-offs among these parameters. For example, it is shown that a complete bipartite graph is the fastest and most economical direct realization of a permutation network. Furthermore, it is shown that the fan-out of a network is inversely proportional to the propagation delay whereas the setup time may or may not relate to the propagation delay at all depending on the network in question. Finally, two constant fan-out implementations of these networks using O (n ^1.59) 2 × 1 multiplexers and 2 × 2 switches are presented.This work is supported in part by the National Science Foundation under Grant No: CCR-8708864.     

可重构密码处理器内部连接网络的设计与分析

提出了可重构密码处理器内部连接网络的连通性、网络宽度、网络规模等概念和设计过程中应该遵循的一些设计原则,给出了全互联、单总线、多总线3种典型的内部连接网络,并对它们的特性进行了分析。     

SuperStar:一种可扩展高阶互连拓扑结构

随着高速信号传输技术和VLSI技术的发展,使用高阶路由器来应对因高性能计算机峰值性能不断攀升给高性能互连网络带来的新挑战已是发展需求;同时,如何利用高阶特性减少互连网络延迟和成本开销,以支持更大的网络规模是设计高性能互连网络拓扑结构的关键和突破点。针对目前基于高阶路由器的典型拓扑结构进行了分析,并在此基础上提出一个新的高阶拓扑架构SuperStar,其不仅具有较短的网络直径而且具有良好的可扩展性;通过在一个基于OMNeT++平台自主开发的高阶互连网络性能测评模拟器上设定不同的通信负载,测评各种拓扑结构在通信系统下实际的网络延迟和吞吐率的走势,以分析SuperStar的通信开销。     

基于星形互连网络的并行快速傅立叶变换算法

星形互连网络是一种易于实现大规模并行计算的互连网络拓扑结构。利用星形互连网络的递归可分解性的多样性，提出了一种基于星形互连网络的并行快速傅立叶变换算法的实现方法。该方法能够有效地减少计算过程中处理器结点之间的通信开销。提出的星图结点和数据的映射应运 及实现并行FFT的思想可推广到线性方程组求解、矩阵乘法等其它并行算法在星形互连网络上的实现。     

A Survey of Interconnection Networks

Concurrent processing depends on interconnection networks for communication among processors and memory modules. Various network topologies and switching strategies are covered here.     

Buffer and Delay Bounds in High Radix Interconnection Networks

We apply recent results in queueing theory to propose a methodology for bounding the buffer depth and packet delay in high radix interconnection networks. While most work in interconnection networks has been focused on the throughput and average latency in such systems, few studies have been done providing statistical guarantees for buffer depth and packet delays. These parameters are key in the design and performance of a network. We present a methodology for calculating such bounds for a practical high radix network and through extensive simulations show its effectiveness for both bursty and non-bursty injection traffic. Our results suggest that modest speedups and buffer depths enable reliable networks without flow control to be constructed.     

片上光网络:一种新型片上互连网络

随着单个芯片上集成的处理器的个数越来越多,传统的电互连网络已经无法满足对互连网络性能的需求,需要一种新的互连方式,因此光互连网络技术应运而生.目前,电互连的片上网络在功耗、性能、带宽、延迟等方面遇到了瓶颈,而光互连作为一种新的互连方式引用到片上网络具有低损耗、高吞吐率、低延迟等无可比拟的优势.本文主要探讨了片上光网络的...     

Torus连接Petersen图互连网络及路由算法

可扩展性和短直径是设计大规模并行计算机系统互连网络的两个重要因素.基于Petersen图的短直径和正规性和Torus拓扑结构的可扩展性,提出了一种新的互连网络拓扑结构,称为Torus连接Petersen图互连网络.该互连网络拓扑结构具有短直径、正规性、对称性和良好的扩展性.网络节点采用混合编码方法,使得路由算法设计简单.分别设计了基于混合编码的单播、广播路由算法.分析表明提出的互连网络具有较好的拓扑性质.     

Nonflat surface level pyramid: a high connectivity multidimensional interconnection network

Parallel machines are extensively used to increase computational speed in solving different scientific problems. Various topologies with different properties have been proposed so far and each one is suitable for specific applications. Pyramid interconnection networks have potentially powerful architecture for many applications such as image processing, visualization, and data mining. The major advantage of pyramids which is important for image processing systems is hierarchical abstracting and transferring the data toward the apex node, just like the human being vision system, which reach to an object from an image. There are rapidly growing applications in which the multidimensional datasets should be processed simultaneously. For such a system, we need a symmetric and expandable interconnection network to process data from different directions and forward them toward the apex. In this paper, a new type of pyramid interconnection network called Non-Flat Surface Level (NFSL) pyramid is proposed. NFSL pyramid interconnection networks constructed by L-level A-lateral-base pyramids that are named basic-pyramids. So, the apex node is surrounded by the level-one surfaces of NFSL that are the first nearest level of nodes to apex in the basic pyramids. Two topologies which are called NFSL-T and NFSL-Q originated from Trilateral-base and Quadrilateral-base basic-pyramids are studied to exemplify the proposed structure. To evaluate the proposed architecture, the most important properties of the networks are determined and compared with those of the standard pyramid networks and its variants.     

子网互连的实现技术

同一单位内数个局域网的互连将提高资源共享的程度和网络功能的发挥。介绍了子网互连需要满足的基本要求和目前常用的几种互连设备 ,着重阐述了不同应用环境下通过不同互连设备实现的网络互连     

广义细胞自动机的结构及其硬件实现

该文作者曾提出了广义细胞自动机(GCA)的原理和并行算法．并且应用于网络快速包交换等动态优化问题．该文进一步讨论了这种新的广义细胞自动机的体系结构、算法的硬件实现及其电路设计。它们对于GCA的实际应用有重要意义．GCA结构不同于Hopfield神经网络(HNN)和细胞神经网络(CNN)，GCA由多层次多粒度宏细胞组成塔形结构．它具有多粒度的宏细胞动力学特征．相同粒度宏细胞之间没有交互，但不同粒度宏细胞之间存在一定程度的交互或反馈．分析和实验表明．在问题求解的优化性、实时性、硬件实现复杂性等方面．该文给出的GCA结构和硬件实现．与HNN和CNN相比有诸多优点．     

A computer method of constructing geological histories from field surveys and maps

A computer method has been designed to analyze binary relations between geological events. It interprets the relations in a form which allows construction of a multinodal network of relationships (of which tree-form networks are a special situation).The method is a form of data management which does not require the names to be ranked or the relations between names to be specified in advance, as do other geological systems. The data within the file may be added to as new information is collected, and the relationships determined from the data on file at any time. The method therefore is suited particularly to studies in which data accumulate progressively. Data structures which are more complex than a multinodal network are detected as “contradictions” or “contradictory rings”.The method has been used successfully in constructing explanations for geological maps from the field evidence recorded on the face of the map. It provides a means of assembling historical data from many maps as well as from supplementary information, such as radiometric or paleontological dates, and synthesizing a history for a region. The method therefore may be useful in tectonic analysis.     

基于矢量图的城市路网快速建模

为了从数字地图中快速提取出适合GIS应用的路网数据，需要有一种高效的存储 与管理路网地理实体属性数据的方法。该文讨论了在AutoCAD中存储与管理属性数据的各种 方法，选取自定义实体方法来建立路网数据模型，并利用OPM技术实现对地理实体属性数据 的直观显示和编辑，同时提出了一种自动建立网络拓扑关系的算法。     

面向HPC和DC的可重构光互连网络体系结构综述

互连网络是高性能计算系统和数据中心的核心组件之一,也是决定其系统整体性能的全局性基础设施。随着高性能计算、云计算和大数据技术的迅速发展,传统的电互连网络在性能、能耗和成本等方面无法满足高性能计算应用和数据中心业务的大规模可扩展通信需求,面临着严峻的挑战。为此,近年来相关研究者提出了多种面向高性能计算和数据中心的可重构的光互连网络结构。首先阐明了光互连网络相对于电互连网络的优势;然后介绍了几种典型的可重构光互连网络体系结构,并对其特点进行了分析比较;最后探讨了可重构光互连网络的发展趋势。     

The Optical Chained-Cubic Tree interconnection network: Topological structure and properties

Interconnection networks with optical communication links outperform others using electronic communication links when the distance is long in terms of speed and power consumption. However, for short distances, electronic network topologies are preferred due to lower material cost requirements. As a result, hybrid network topologies were constructed to combine the benefits of both types of network topologies, such as Optical Transpose Interconnection System (OTIS). This paper presents a new hybrid interconnection network topology, which is constructed using both optical and electronic links, called the Optical Chained-Cubic Tree (OCCT). This new OCCT topology is based on the Chained-Cubic Tree (CCT) interconnection network and is designed to cope with both types of binary trees; full and complete. Also, the topological properties of OCCT in terms of diameter, connectivity, degree, bisection width, and cost are presented and compared with OTIS-Mesh and CCT interconnection networks.