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.
Recursive dual-net (RDN) is a newly proposed interconnection network for massive parallel computers. The RDN is based on recursive dual-construction of a symmetric base-network. A k-level dual-construction for k >; 0 creates a network containing (2n0)2k /2 nodes with node-degree d0 + k, where n0 and d0 are the number of nodes and the node-degree of the base network, respectively. The RDN is node...
In this paper, we propose efficient routing algorithms for collective communication in a newly proposed, versatile network, called a recursive dual-net (RDN). The RDN can be used as a candidate for the interconnection of supercomputers of the next generation. The RDN is generated by recursively applying dual-construction on a base network. Given a regular and symmetric graph of size n and node-degree...
The paper introduces a class of hierarchical interconnection networks, which is suitable for multicomputer systems. These networks, to which we give the name HFCube, employ the folded hypercube as a basic cluster, connect many such clusters using a complete graph, and maintain node connectivity to be the same for all nodes of the graph. We present all optimal routing algorithms for the HFCube. In...
Clustered computing systems are emerging as a cost-effective alternative to custom parallel computers in recent years. The interconnection networks of clustered computing systems often consist of generic switches connected in an irregular topology. This irregularity makes traditional all-to-all broadcast algorithms for regular networks ineffective. We adopt another approach to improve all-to-all broadcast...
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.