一个高效完全自适应路由器的设计

路由器在大规模并行处理机（MPP）系统中对互连网络通信性能和系统性能的发挥起着关键作用。根据全自适应路由算法BNP设计框架,给出Mesh上一类基于BNP的全自适应路由算法BBFAM（thBNR-based fully adaptive algorithms on mesh);同时提出并采用动态优先级流控,“自由度”通道选择策略,设计了一个基于BNR,简洁,低代价的高效完全自适应路由器BFR（the BNR-based fully adaptive router),并采用Aletera CPLD器件构造了原型系统。     

Optimal Routing Based on Super Topology in Optical Parallel Interconnect

Traditionally the routing in optical parallel interconnect is based on an embedded virtual topology. However, one important fact that has been neglected in the past is that the wavelength assignment to transceivers actually creates additional (logical) links not present in the virtual topology. Such a side-effect can be utilized to significantly reduce the number of hops between a pair of processors. This observation leads to the concept of super topology. This paper considers the hypercube as the embedded virtual topology. The ideas contained here are easily applicable to optical parallel interconnects employing other virtual topologies as well. We present a general framework for embedding a regular topology, the structure of the super topology, the optimal routing algorithm, the distance between any pair of processors and the diameter in the super topology.     

Fully Convolutional Graph Neural Networks for Parametric Virtual Try-On

We present a learning-based approach for virtual try-on applications based on a fully convolutional graph neural network. In contrast to existing data-driven models, which are trained for a specific garment or mesh topology, our fully convolutional model can cope with a large family of garments, represented as parametric predefined 2D panels with arbitrary mesh topology, including long dresses, shirts, and tight tops. Under the hood, our novel geometric deep learning approach learns to drape 3D garments by decoupling the three different sources of deformations that condition the fit of clothing: garment type, target body shape, and material. Specifically, we first learn a regressor that predicts the 3D drape of the input parametric garment when worn by a mean body shape. Then, after a mesh topology optimization step where we generate a sufficient level of detail for the input garment type, we further deform the mesh to reproduce deformations caused by the target body shape. Finally, we predict fine-scale details such as wrinkles that depend mostly on the garment material. We qualitatively and quantitatively demonstrate that our fully convolutional approach outperforms existing methods in terms of generalization capabilities and memory requirements, and therefore it opens the door to more general learning-based models for virtual try-on applications.     

A class of highly scalable optical crossbar-connectedinterconnection networks (SOCNs) for parallel computing systems

A class of highly scalable interconnect topologies called the Scalable Optical Crossbar-Connected Interconnection Networks (SOCNs) is proposed. This proposed class of networks combines the use of tunable Vertical Cavity Surface Emitting Lasers (VCSEL's), Wavelength Division Multiplexing (WDM) and a scalable, hierarchical network architecture to implement large-scale optical crossbar based networks. A free-space and optical waveguide-based crossbar interconnect utilizing tunable VCSEL arrays is proposed for interconnecting processor elements within a local cluster. A similar WDM optical crossbar using optical fibers is proposed for implementing intercluster crossbar links. The combination of the two technologies produces large-scale optical fan-out switches that could be used to implement relatively low cost, large scale, high bandwidth, low latency, fully connected crossbar clusters supporting up to hundreds of processors. An extension of the crossbar network architecture is also proposed that implements a hybrid network architecture that is much more scalable. This could be used to connect thousands of processors in a multiprocessor configuration while maintaining a low latency and high bandwidth. Such an architecture could be very suitable for constructing relatively inexpensive, highly scalable, high bandwidth, and fault-tolerant interconnects for large-scale, massively parallel computer systems. This paper presents a thorough analysis of two example topologies, including a comparison of the two topologies to other popular networks. In addition, an overview of a proposed optical implementation and power budget is presented, along with analysis of proposed media access control protocols and corresponding optical implementation     

Distributed computing with high-speed optical networks

An environment that uses wavelength division multiplexing techniques and optical switching and processing to provide large bandwidths, short delays, and multiple data streams for distributed processing is described. The focus is on the interrelationship between application needs and network services. The system level, a conceptual layer designed to bridge the gap between application requirements and underlying high-speed network services, is proposed. The system level is a logical view of the physical network represented by a virtual topology projected onto the physical network. Embedding this virtual topology introduces many new problems and performance tradeoffs into the design of the network. A few of these problems are outlined, and some initial research efforts in this area are discussed. The physical network level, the collection of optical fiber links interconnecting the nodes in the network, and the application level, a logical view of an application's computational topology and representation of the application's communication and computing requirements, are also described     

基于逆 Loop 细分的半正则网格简化算法

摘 要：三维网格简化是在保留目标物体几何形状信息的前提下尽量减小精细化三维模型 中的点数和面数的一种操作,对提高三维网格数据的存取和网络传输速度、编辑和渲染效率具 有十分重要的作用。针对大多网格简化算法在简化过程中未考虑网格拓扑结构与视觉质量的问 题,提出了一种基于逆 Loop 细分的半正则网格简化算法。首先根据邻域质心偏移量进行特征 点检测,随后随机选取种子三角形,以边扩展方式获取正则区域并执行逆 Loop 细分进行简化。 最后,以向内分割方式进行边缘拼接,获取最终的简化模型。与经典算法在公开数据集上进行 实验对比,结果表明,该算法能够在简化的同时有效地保持网格特征,尽可能保留与原始网格 一致的规则的拓扑结构,并且在视觉质量上优于边折叠以及聚类简化算法。     

Gemini: an optical interconnection network for parallel processing

The Gemini interconnect is a dual technology (optical and electrical) interconnection network designed for use in tightly-coupled multicomputer systems. It consists of a circuit-switched optical data path in parallel with a packet-switched electrical control/data path. The optical path is used for transmission of long data messages and the electrical path is used for switch control and transmission of short data messages. The paper describes the architecture of the interconnection network and related communications protocols. Fairness issues associated with network operation are addressed and a discrete-event simulation model of the entire system is described. Network performance characteristics derived from the simulation model are presented. The results show significant performance benefits when using virtual output queuing and quantify the tradeoffs between throughput and fairness in the system     

PFR:一个基于平面的完全自适应路由器

互连网络路由器是ＭＰＰ系统的关键部件，其性能优劣直接影响系统性能。路由器根据其所采用的路由算法可分为确定性和自适应路由器两种，其中自适应路由器有灵活性好，网络的通道利用率高和网络容错能力强等优点，正逐步为新一代的ＭＰＰ系统所采用，但其工程实现难度较大。本文在ｍｅｓｈ结构上，采用虫孔路由切换技术，给出了一个可扩展性好，自适应性强的基于平面的完全自适应路由算法ＰＢＦＡＡ，并采用基于虚通道的综合流控策略     

基于InfiniBand的多链路mesh/torus大规模并行系统互连网络

在大规模并行系统中,系统级互连网络的设计至关重要.InfiniBand作为一种高性能交换式网络被广泛应用于大规模并行处理系统中.mesh/torus拓扑结构相较于目前普遍应用于InfiniBand网络的胖树拓扑结构拥有更好的性能与可扩展性.尽管如此,研究发现,用传统的mesh/torus拓扑结构构建InfiniBand互连网络存在诸多问题.分析了传统网络拓扑结构的缺陷,并提出了一种基于InfiniBand的多链路mesh/torus互连网络.这种改进型的拓扑结构通过充分利用交换机间的多链路可以获得比传统mesh/torus网络更高的带宽.另外,同时给出了与该网络拓扑结构相配套的高效路由算法.最后,通过网络仿真技术对提出的算法进行了评估,实验结果显示提出的路由算法相较于其他路由算法拥有更好的性能与可扩展性.     

An optimised 3D topology for on-chip communications

Increasing system complexity, energy and device reliability, requirement of modular approach, structured layout, effective spatial reuse of resources, scalability and re-programmability have made network-on-chip (NoC) an obvious interconnection design alternative to the ubiquitous bus based on chip communication architecture in system-on-chip. Designing of a topology and its routing scheme plays a vital role in determining performance of any NoC architecture. In recent years, 3D stacked NoC architecture attracts added interest in NoC design as it offers improved performance and shorter global interconnect. In this paper, we have developed a partially, vertically interconnected 3D topology, namely 3D Recursive Network Topology (3D RNT) and prove that the topology has a Hamiltonian connectedness. We have developed deadlock-free routing algorithm for the 3D RNT topology. Also, we compare the performance of the 3D RNT with partially and fully connected 3D mesh topologies (3D PMT and 3D FMT) by conducting suitable experiments. The experiment results show that there is not much deviation in respect of the performance of the 3D RNT on comparing with 3D PMT and 3D FMT even though a number of vertical links are trimmed down to 75%, which is an encouraging outcome as far as design space is concerned.     

对角网格中的无死锁自适应路由算法

网格是多计算机中应用广泛的互连结构,提出了一种新的互连结构－对角网格。并在这种结构上提出了一类自适应无死锁的路由算法－负优先算法,证明了此算法的无死锁性。对角网格是可平面图,其结构简单,可扩充性非常好。负优先自适应路由算法的突出优点是对硬件逻辑要求简单,无须增加虚拟通道即可达 死锁和自适应。     

LCFAA:一个低代价的完全自适应路由算法

大规模并行处理机系统（ＭＰＰ）中路由算法对互联网络通信性能和系统性能起着重要作用。自适应路由算法具有灵活性好、网络的通道利用率高和网络容错能力强等优点,但其实现难度较大,因而目前仅在少数ＭＰＰ系统中得以实现。文中在ｍｅｓｈ结构上提出了一个低代价无死锁的安全自适应最短虫孔路由算法ＬＣＦＡＡ,该算法所需虚通道数少,具有代价低、自适应性强的特点。文中证明了算法的无死锁、无活锁性和完全自适应性,并模拟验证     

蒙太奇网格融合

三维物体融合是一种新的几何造型方法,它利用三维模型之间的剪贴操作从两个或多个现有的几何模型中光滑融合出新的几何模型.提出了一种基于局部调和映射的三维网格蒙太奇融合新方法.首先利用网格上的近似等距线算法来抽取出待融合区域,然后对两个待融合区域进行带内孔的调和映射参数化,最后通过拓扑合并和融合控制来实现网格的光滑融合.与原有的基于全局调和映射的融合方法相比,新方法的算法效率大幅度提升,求解时间不再随融合模型顶点数的增加而呈指数增长;减少了二维网格拓扑合并中奇异情况出现的概率,提高了算法的稳定性;被剪切网格的细节得到完整保留;消除了原算法对融合区域拓扑的限制.实验结果表明,此方法可以用来生成许多三维动画中的特殊夸张造型效果,在影视动画中具有应用价值.     

SRLG fault localization using nested m-trails

This paper presents a novel technique called nested m-trail method in all-optical mesh networks for failure localization of any shared risk link group (SRLG) with up to d undirected links. The proposed method decomposes the network topology into virtual cycles and trails, in which sets of m-trails that traverse through a common monitoring node (MN) can be obtained. The nested m-trails are used in the monitoring burst (m-burst) framework, in which the MN can localize any SRLG failure by inspecting the optical bursts traversing through it. An integer linear program (ILP) and a heuristic are proposed for the network decomposition, which are further verified by numerical experiments. We show that the proposed method significantly reduces the required fault localization latency compared to the existing methods.     

龙芯3号互联系统的设计与实现

龙芯3号的互联结构设计采用了一种基于二维Mesh的可伸缩分布式多核结构,可为芯片级、主板级和系统级的互联提供统一的拓扑结构和逻辑设计.龙芯3号的对外接口采用扩展的HyperTransport协议,既可以用于连接IO,又可以实现多芯片的互联.在龙芯3号的互联结构中还设置了软件路由配置机制,可以在板级直接构筑中等规模的CC-NUMA系统和更大规模的NCC-NUMA系统,提供高效的通信机制.介绍了基于龙芯3号的多处理器系统互联架构.采用了双层可伸缩互联结构:片内由二维Mesh连接多个结点.结点内由交叉开关连接多个处理器核和二级缓存模块.片间无需额外硬件支持即可通过支持缓存一致性的HyperTransport接口实现16核的多处理器系统.利用层次化目录技术,龙芯3号还可以支持更大规模的多处理器系统.龙芯3号的互联架构为搭建简洁、高效、灵活、高度可扩展的共享存储多处理器系统提供了有力支持.     

The 2D digraph-based NoCs: attractive alternatives to?the 2D mesh NoCs

This paper proposes two-dimensional directed graphs (or digraphs for short) as a promising alternative to the popular 2D mesh topology for networks-on-chip (NoCs). Mesh is the most popular topology for the NoCs, mainly due to its suitability for on-chip implementation and low cost. However, the fact that a digraph offers a lower diameter than its equivalent linear array of equal cost motivated us to evaluate digraphs as the underlying topology of NoCs. This paper introduces a family of NoC topologies based on three well-known digraphs, namely de Bruijn, shuffle-exchange, and Kautz. We study topological properties of the proposed topologies. We show that the proposed digraph-based topologies have several attractive features including constant node degree, low diameter and cost, and low zero load latency which result in superior performance over the mesh. We introduce a deadlock-free routing algorithm for the proposed NoC topologies and compare NoCs employing the proposed topologies and the mesh topology in terms of power consumption and performance. Simulation results also reveal that the proposed NoC topologies offer higher performance and consume lower power than the mesh NoC.     

BNR：最短路径无死锁全自适应路由算法的分析与设计工具

1 引言大规模并行计算机(MPP)系统性能的发挥极大程度上依赖于互连网络的通信性能,互连网络采用的路由算法决定了消息在网络中如何选取路径,其性能对网络效率的发挥起着重要作用,根据允许选择路径的不同,路由算法有最短路径和非最短路径以及确定性和自适应性之分,自适应又有部分自适应和完全     

Combinatorial manifold mesh reconstruction and optimization from unorganized points with arbitrary topology

In this paper, a novel approach is proposed to reliably reconstruct the geometric shape of a physically existing object based on unorganized point cloud sampled from its boundary surface. The proposed approach is composed of two steps. In the first step, triangle mesh structure is reconstructed as a continuous manifold surface by imposing explicit relationship among the discrete data points. For efficient reconstruction, a growing procedure is employed to build the 2-manifold directly without intermediate 3D representation. Local and global topological operations with ensured completeness and soundness are defined to incrementally construct the 2-manifold with arbitrary topology. In addition, a novel criterion is proposed to control the growing process for ensured geometric integrity and automatic boundary detection with a non-metric threshold. The reconstructed manifold surface captures the object topology with the built-in combinatorial structure and approximates the object geometry to the first order. In the second step, new methods are proposed to efficiently obtain reliable curvature estimation for both the object surface and the reconstructed mesh surface. The combinatorial structure of the triangle mesh is then optimized by changing its local topology to minimize the curvature difference between the two surfaces. The optimized triangle mesh achieves second order approximation to the object geometry and can serve as a basis for many applications including virtual reality, computer vision, and reverse engineering.     

Sketching freeform meshes using graph rotation functions

We present a new approach for sketching free form meshes with topology consistency. Firstly, we interpret the given 2D curve to be the projection of the 3D curve with the minimum curvature. Then we adopt a topology-consistent strategy based on the graph rotation system, to trace the simple faces on the interconnecting 3D curves. With the face tracing algorithm, our system can identify the 3D surfaces automatically. After obtaining the boundary curves for the faces, we apply Delaunay triangulation on these faces. Finally, the shape of the triangle mesh that follows the 3D boundary curves is computed by using harmonic interpolation. Meanwhile our system provides real-time algorithms for both control curve generation and the subsequent surface optimization. With the incorporation of topological manipulation into geometrical modeling, we show that automatically generated models are both beneficial and feasible.     

多孔平面的快速边界元划分

在 3D VL SI互连寄生电容的边界元素法计算中 ,多孔平面的边界元划分是十分困难的问题 .文中提出一种快速划分多孔平面边界元的方法 ,它可高效处理非正交几何边界形状 ,形成规则的梯形元 .与全局扫描线法相比 ,有较高的划分速度、计算速度与精度