Abstract. This paper studies the effect that HOL (Head-of-Line) blocking in the packet injection queue has on the performance of bidirectional k-ary ncubes, for values of k over a certain threshold (around 20). The HOL blocking causes an unbalanced use of the channels corresponding to the two

The performance of an interconnection network is measured by two metrics: average latency and peak network throughput. Network throughput is the total number of packets delivered per unit of time.

In this paper we compare the k-ary n-cube network with its dual. The dual is obtained by interchanging the role of nodes and channels. The resulting nodes in the dual network are connected to two channels only and the resulting channels are multi-way. One of the major topological advantages

This work presents Immucube, a scalable and efficient mechanism to improve dependability of interconnection networks for parallel and distributed computers. Immucube achieves better flexibility and scalability than any other previous fault-tolerant mechanism in k-ary n-cubes. The proposal inherits

In this paper a parallel algorithm for solving systems of linear equation on the k- ary n-cube is presented and evaluated for the first time. The proposed algorithm is of O(N 3 /k n ) computation complexity and uses O(Nn) communication time to factorize a matrix of order N on the k-ary n-cube

, for routing real-time data to potentially many thousands of subscribers with their own quality-of-service (QoS) requirements. In past work, we have analyzed the use of k-ary n-cube topologies for routing QoS-sensitive data. The basis for our work stems from the interconnection networks found in parallel

, for routing real-time data to potentially many thousands of subscribers with their own quality-of-service (QoS) requirements. In past work, we have analyzed the use of k-ary n-cube topologies for routing QoS-sensitive data. The basis for our work stems from the interconnection networks found in parallel

A challenge to improve performance in parallel computers comes by reducing the delays a message experiments when traveling across the router nodes of the interconnection network. Also, routers must be carefully designed to avoid anomalies such as deadlock and starvation.

Abstract not found

This paper proposes a novel concept of multidestination message passing mechanism for wormhole k-ary n-cube networks. Similar to the familiar car-pool concept, this mechanism allows data to be delivered to or picked-up from multiple nodes with a single message-passing step. Such messages can