The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Interconnection network plays an important role in massively parallel systems. As a high performance switched network standard, Infiniband is widely used in MPP systems. Compared to fat-tree topology which is commonly used in Infiniband networks, mesh/torus topology can achieve better performance and scalability. This paper proposes an Infiniband-based multi-path mesh/torus interconnection network...
In this paper, we focus on the design of the fault-tolerant routing algorithm for the (n,k)-star graph. We apply the idea of collecting the limited global information used for routing on the n-star graph to the (n,k)-star graph. First, we build the probabilistic safety vector (PSV) with modified cycle patterns. Then, our routing algorithm decides the fault-free routing path with the help of PSV. The...
A massively parallel computer involves a large number of routers that are independent of each other. Adaptive routing methods offer high levels of flexibility in packet routing, but their performance is limited due to their locality nature. The Cross-Line method handles quasi-global information of congestion to improve performance. This paper introduces two new ideas of adaptation level and evaluation...
The (n, k)-arrangement graph An,k is a generalization of the well known star graph and the alternating group graph. We first present a constant time routing algorithm that allows two groups of An-1,k-1 's to exchange their data in a one-to-one fashion. We then use this routing algorithm to develop an optimal broadcasting algorithm, an optimal algorithm for computing the general prefix sums as well...
In this paper, we present a novel framework for the automated generation of Network-on-Chips (NoC) architectures, that enables architecture exploration and optimization. The automated generation of Network-on-Chip architectures covers beside the generation of the communication infrastructure, the automated integration of IP-components. The automated integration of IP-components is based on IP-XACT...
In the network of tori with faults, many fault-tolerant routing schemes have been proposed based on the fault models. Although these schemes enable the packets to bypass the fault regions without causing any deadlock in the network, they have the common shortcoming. Since all blocked packets would be misrouted on the fault ring, the fault ring would undertake heavier traffic load, which makes it be...
Chip Multi-processor (CMP) architectures have become mainstream for designing processors. With a large number of cores, Networks-on-Chip (NOCs) provide a scalable communication method for CMP architectures. NOCs must be carefully designed to meet constraints of power consumption and area, and provide ultra low latencies. Existing NOCs mostly use Dimension Order Routing (DOR) to determine the route...
In this paper, we proved that stable matching problems are the same problems about stable configurations of multi-stage interconnection networks (MINs). We solved the stability problem of existing regular chained multipath cross link network using the approaches and solutions provided by the stable matching problem. Specifically we have used stable marriage problem as an example of stable matching...
A kind of routing scheme with the ability to tolerate the faults is necessary in the massively parallel multiprocessors. In this paper, we have proposed a kind of fault-tolerant routing scheme in the tori networks. The new routing scheme is called the two-level-turn-model routing scheme, which is based on our investigation of the fault-tolerant properties of the turn-model. Through employing two specific...
In this paper, we investigate the properties of cycles for node representation in the star graph. Cycles can be in any order. The position for each symbol in the ordinary cycle is fixed and the ordinary cycle can not be nested into any other cycle. However, cyclic shift operations on symbols in a none-ordinary cycle are allowed and none-ordinary cycle can be nested into any other cycle. The number...
In this paper, we present a deadlock-free routing algorithm for the Tori connected mESH (TESH) network using 2 virtual channels - 2 being the minimum number for dimension-order routing - and evaluate the networks dynamic communication performance under the hot-spot traffic pattern, using the proposed routing algorithm. We evaluate the dynamic communication performance of TESH, mesh, and torus networks...
Interconnection networks play a crucial role in the performance of massively parallel computers. Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computer systems. The Tori-connected mESH (TESH) Network is a 2D-torus network of multiple basic modules, in which the basic modules are 2D-mesh...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.