Výsledky vyhľadávania - Nonminimal routing algorithm

Unicast-based multicast algorithm in wormhole-routed star graph interconnection networks Autor Misic, Jelena

“…A contention-free unicast-based multicast algorithm is developed for wormhole-routed star graph interconnection networks…”
Získať plný text

Polarized Routing for Large Interconnection Networks Autor Camarero, Cristobal, Martinez, Carmen, Beivide, Ramon

“… In this article, we introduce the polarized routing algorithm, an adaptive nonminimal hop-by-hop mechanism that can be used in most of topologies, including…”
Získať plný text

Fault-tolerant wormhole routing in meshes without virtual channels Autor GLASS, C. J, NI, L. M

“… The turn model produces routing algorithms that are deadlock free, very adaptive, minimal or nonminimal, and livelock free for direct networks--whether or not they contain virtual channels…”
Získať plný text

HAFTA: Highly adaptive fault‐tolerant routing algorithm for two‐dimensional network‐on‐chips Autor Ipek, Anil, Tosun, Suleyman, Ozdemir, Suat

“…‐based NoC routing algorithm for selecting a minimal or nonminimal path to minimize the negative effect of learning duration…”
Získať plný text

Switch-Less Dragonfly on Wafers: A Scalable Interconnection Architecture based on Wafer-Scale Integration Autor Feng, Yinxiao, Ma, Kaisheng

“… the global throughput. Based on the proposed architecture, we also introduce baseline and improved deadlock-free minimal/non-minimal routing algorithms with only one additional virtual…”
Získať plný text

Wait-free deflection routing of long messages Autor Kucera, L.

“… (also called nonminimal adaptive or hot potato) routing. This paper deals with problems connected with the use of deflection algorithms…”
Získať plný text

A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing Autor Schwiebert, Loren, Jayasimha, D.N.

“… Recently, Duato has solved this problem for a restricted class of adaptive routing algorithms…”
Získať plný text

Adaptive Multicast Wormhole Routing in 2D Mesh Multicomputers Autor Lin, X.L., Mckinley, P.K., Esfahanian, A.H.

“… The nonminimal routing algorithm exhibits the best adaptivity, although it creates more network traffic than the other methods…”
Získať plný text

Adaptive deadlock- and livelock-free routing in the hypercube network Autor Pifarre, G.D., Gravano, L., Denicolay, G., Sanz, J.L.C.

“…This paper consists of two parts. In the first one, two new algorithms for wormhole routing on the hypercube network are presented…”
Získať plný text

An effective methodology to improve the performance of the up/down routing algorithm Autor Sancho, J.C., Robles, A., Duato, J.

“… Current proposals use the up*/down* routing algorithm to remove cyclic dependencies between channels and avoid deadlock…”
Získať plný text

High-performance routing in networks of workstations with irregular topology Autor Silla, F., Duato, J.

“… In this paper, we propose two general methodologies for the design of adaptive routing algorithms for networks with irregular topology…”
Získať plný text

Valved routing: efficient flow control for adaptive nonminimal routing in interconnection networks Autor Liao, Wei-Kuo, King, Chung-Ta

“…Adaptive nonminimal routing (or misrouting) may move messages away from their destinations to temporarily cope with the dynamic load in an interconnection network…”
Získať plný text

Multicast communication algorithm on a wormhole-routed star graph interconnection network Autor Misic, J.

“… In order to eliminate contention in the multicast algorithm, the minimal deterministic routing algorithm is converted to a nonminimal one…”
Získať plný text

The turn model for adaptive routing Autor Glass, Christopher J., Ni, Lionel M.

“…We present a model for designing wormhole routing algorithms that are deadlock free, livelock free, minimal or nonminimal, and maximally adaptive…”
Získať plný text

Efficient fully adaptive wormhole routing in n-dimensional meshes Autor Boura, Y.M., Das, C.R.

“…An efficient fully adaptive wormhole routing algorithm for n-dimensional meshes is developed…”
Získať plný text

Adaptive deadlock-and livelock-free routing in the hypercubenetwork Autor Pifarre, G D, Gravano, L, Denicolay, G, Sanz, J L C

“…This paper consists of two parts. In the first one, two new algorithms for wormhole routing on the hypercube network are presented…”
Získať plný text

The case for chaotic adaptive routing Autor Bolding, K., Fulgham, M., Snyder, L.

“…Chaotic routers are randomizing, nonminimal adaptive packet routers designed for use in the communication networks of parallel computers…”
Získať plný text

Packet routing in multiprocessor networks Autor Chinn, Donald Dotway

“… There is a simple algorithm to route packets in these networks, called the dimension order algorithm…”
Získať plný text

The Chaos router Autor Konstantinidou, S., Snyder, L.

“…The Chaos router, a randomizing, nonminimal adaptive packet router is introduced…”
Získať plný text

Uniform Minimal First: Latency Reduction in Throughput-Optimal Oblivious Routing for Mesh-Based Networks-on-Chip Autor Song, Yang, Lin, Bill

“… O1TURN is a well-known oblivious routing algorithm for mesh-based NoCs that has been shown to be worst-case throughput optimal for even network radices, but not for odd radices…”
Získať plný text