A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Adaptive channel queue routing on k-ary n-cubes

2004
*
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '04
*

This paper introduces a new

doi:10.1145/1007912.1007915
dblp:conf/spaa/SinghDGT04
fatcat:jhkjqsxwffdkldpyxbxjseooam
*adaptive*method,*Channel**Queue**Routing*(CQR), for load-balanced*routing**on**k*-*ary**n*-*cube*interconnection networks. ... CQR estimates global congestion in the network from its*channel**queues*while relying*on*the implicit network backpressure to transfer congestion information to these*queues*. ... CONCLUSION In this paper we have introduced*channel**queue**routing*(CQR), a globally*adaptive**routing*algorithm for Torus,*k*-*ary**n*-*cube*topology, networks. ...##
###
An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes

1991
*
IEEE transactions on computers
*

Virtual interconnection networks allowing

doi:10.1109/12.67315
fatcat:xpfxamxmbjfptpgtqwr5woppt4
*adaptive*, deadlock-free*routing*arc examined for three*k*-*ary**n*-*cube*topologies: unidirectional, torus-connected bidirectional, and mesh-connected bidirectional ... The concept af virtual*channels*is extended to multiple, virtual communication systems that provide*adaptability*and fault tolerance in addition to being deadlock-free. ... Torus-Connected Bidirectional*k*-*ary**n*-*cubes*There are two*channels*between adjacent nodes in a bidirectional*k*-*ary**n*-*cube*-*one*for each direction. ...##
###
A simple mathematical model of adaptive routing in wormhole k-ary n-cubes

2002
*
Proceedings of the 2002 ACM symposium on Applied computing - SAC '02
*

This paper proposes a simple yet reasonably accurate analytical model to predict message latency in wormholerouted

doi:10.1145/508950.508954
fatcat:vqd6bio3d5gp5ldjv3633xoyia
*k*-*ary**n*-*cubes*with fully*adaptive**routing*. ... Many fully-*adaptive*algorithms have been proposed for*k*-*ary*ncubes over the past decade. ... muting in wormhole-*routed**k*-*ary**n*-*cubes*. ...##
###
A simple mathematical model of adaptive routing in wormhole k-ary n-cubes

2002
*
Proceedings of the 2002 ACM symposium on Applied computing - SAC '02
*

This paper proposes a simple yet reasonably accurate analytical model to predict message latency in wormholerouted

doi:10.1145/508791.508954
dblp:conf/sac/Sarbazi-AzadO02
fatcat:btjwnx5xvrgtbotofttvwx5svi
*k*-*ary**n*-*cubes*with fully*adaptive**routing*. ... Many fully-*adaptive*algorithms have been proposed for*k*-*ary*ncubes over the past decade. ... muting in wormhole-*routed**k*-*ary**n*-*cubes*. ...##
###
Application driven evaluation of network on chip architectures forcation parallel signal processing

2005
*
Advances in Radio Science
*

We focus

doi:10.5194/ars-2-181-2004
fatcat:tq5ustmoundzzaq666fu74njha
*on*the strictly orthogonal*n*-dimensional mesh, torus and*k*-*ary*-*n**cube*networks comparing deterministic dimension-order and partially*adaptive*negative-first and planar-*adaptive**routing*algorithms ... For each network topology and*routing*algorithm, input-and output-queued packet switching schemes are compared*on*the architectural level. ... The*k*-*ary**n*-*cube*represents a special case of the torus, where each dimension accommodates the same number of nodes making up to*k**n*nodes altogether. ...##
###
GOAL

2003
*
Proceedings of the 30th annual international symposium on Computer architecture - ISCA '03
*

We introduce a load-balanced

doi:10.1145/859618.859641
fatcat:fjso4ypbpjbfdpuwiznezphr3m
*adaptive**routing*algorithm for torus networks, GOAL -Globally Oblivious*Adaptive*Locally -that provides high throughput*on*adversarial traffic patterns, matching or exceeding ...*Channel*load (γ c (R, Λ)) -The expected number of packets that cross*channel*c per cycle for the destination matrix Λ and*routing*algorithm R. ... as a well balanced non-minimal algorithm*on**k*-*ary**n*-*cubes*. ...##
###
A new adaptive hardware tree-based multicast routing in k-ary n-cubes

2001
*
IEEE transactions on computers
*

In this paper, we propose a new hardware tree-based

doi:10.1109/12.936232
fatcat:yfyujh56i5efda3abl7vhfdhbe
*routing*algorithm (HTA) for multicast communication under virtual cut-through switching in*k*-*ary**n*-*cubes*that outperforms existing software and hardware ... path-based multicast*routing*schemes. ... A minimum of three VCs per dimension is required for deadlock-free*routing*in*k*-*ary**n*-*cubes*. ...##
###
Load Unbalance in k-ary n-Cube Networks
[chapter]

2004
*
Lecture Notes in Computer Science
*

This paper studies the effect that HOL (Head-of-Line) blocking in the packet injection

doi:10.1007/978-3-540-27866-5_119
fatcat:v24suogicjhvzfk5ka2wqwjh5m
*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 directions of bidirectional links, which is responsible for a drop in the network throughput and a rise in the network ...*K*-*ary**n*-*cubes*, are the most common direct interconnection network topologies, encompassing rings, meshes, and tori. ...##
###
K-ary n-cube based off-chip communications architecture for high-speed packet processors

2005
*
48th Midwest Symposium on Circuits and Systems, 2005.
*

The

doi:10.1109/mwscas.2005.1594497
fatcat:hdx7hjifvjc7bpwzmirrjshy7u
*k*-*ary**n*-*cube*architecture allows multiple packet processing elements*on*a line card to access multiple memory modules. ... A*k*-*ary**n*-*cube*interconnect architecture is proposed, as an off-chip communications architecture for line cards, to increase the throughput of the currently used memory system. ... Performance results*k*-*ary**n*-*cube*interconnect vs. sharedbus Performance of*k*-*ary**n*-*cube*is compared against a sharedbus. ...##
###
Globally Adaptive Load-Balanced Routing on Tori

2004
*
IEEE computer architecture letters
*

We introduce a new method of

doi:10.1109/l-ca.2004.8
fatcat:wp7rjlroiba4zb6xhk3ad7znqy
*adaptive**routing**on**k*-*ary**n*-*cubes*, Globally*Adaptive*Load-Balance (GAL). GAL makes global*routing*decisions using global information. ... In contrast, most previous*adaptive**routing*algorithms make local*routing*decisions using local information (typically*channel**queue*depth). ... AE*Ñ*× Ö ÔØ ÓÒ CHAOS The Chaos*routing*algorithm [1] . MIN AD Minimal*Adaptive*(or the £-*channels*algorithm) -*route*in the minimal quadrant,*routing**adaptively*within it [6] . ...##
###
A Performance Model of Fault-Tolerant Routing Algorithm in Interconnect Networks
[chapter]

2006
*
Lecture Notes in Computer Science
*

This paper presents a new analytical model to capture the effects of failures in wormhole-switched

doi:10.1007/11758501_99
fatcat:ijgbncygjjh5zppoypeeziuf7m
*k*-*ary**n*-*cubes*using Software-Based fault-tolerant*routing*algorithm. ... The Software-Based fault-tolerant*routing*[1] has been proposed as an efficient*routing*algorithm to preserve both performance and fault-tolerant demands in large-scale parallel computers and current multiprocessor ... The*k*-*ary**n*-*cube*(also referred as*n*-dimensional, radix-*k*torus) is currently used as*one*of the most popular topologies for direct network. ...##
###
Performance evaluation of adaptive routing algorithms for k-ary n-cubes
[chapter]

1994
*
Lecture Notes in Computer Science
*

Moreover, we proposed a necessary and sufficient condition for deadlock-free

doi:10.1007/3-540-58429-3_27
fatcat:3xo4425cofavbhynrfplcyye4i
*adaptive**routing*[15]. In this paper, we design*adaptive**routing*algorithms for*k*-*ary**n*-*cubes*. ... A more powerful approach [12] only requires the absence of cyclic dependencies*on*a connected*channel*subset. ... When the header is*routed*, the router can offer*one*or more alternative paths, depending*on*whether the*routing*algorithm is deterministic or*adaptive*. ...##
###
Software-based fault-tolerant routing algorithm in multidimensional networks

2006
*
Proceedings 20th IEEE International Parallel & Distributed Processing Symposium
*

The Software-Based fault-tolerant

doi:10.1109/ipdps.2006.1639644
dblp:conf/ipps/SafaeiRKFOA06
fatcat:47x7p32zqfa2jmjtsg7ouhmaca
*routing*algorithm is a popular*routing*to achieve faulttolerance capability in networks. This algorithm is initially proposed only for two dimensional networks [1] . ... Since, higher dimensional networks have been widely employed in many contemporary massively parallel systems; this paper proposes an approach to extend this*routing*scheme to these indispensable higher ... A*k*-*ary**n*-*cube*is a class of regular graphs, consist of*N*=*k**n*nodes arranged in an ndimensional*cube*with*k*nodes along each dimension. ...##
###
Off-chip communication architectures for high throughput network processors

2009
*
Computer Communications
*

All of the

doi:10.1016/j.comcom.2008.12.043
fatcat:n44wcdfjgjhzji5tzqgx2abo3q
*k*-*ary**n*-*cube*interconnects include multiple, highly efficient techniques to*route*, switch, and control packet flows in order to minimize congestion spots and packet loss. ... We investigate multiple*k*-*ary**n*-*cube*based interconnects and propose two variations of 2-*ary*3-*cube*interconnect called the 3D-bus and 3D-mesh. ...*K*-*ary**n*-*cube*network A*k*-*ary**n*-*cube*network is a directed network topology. ...##
###
Wormhole routing techniques for directly connected multicomputer systems

1998
*
ACM Computing Surveys
*

Depending

doi:10.1145/292469.292472
fatcat:awgtqfbqvjfmvfibgxf3aeqlay
*on*the usage of paths between the source and the destination,*routing*algorithms are classified as deterministic, fully*adaptive*, and partially*adaptive*. ... The main difference among various*adaptive**routing*schemes is the technique used to avoid deadlocks. We also discuss a few algorithms based*on*deadlock recovery techniques. ... for a*k*-*ary**n*-*cube*network. ...
« Previous

*Showing results 1 — 15 out of 325 results*