2003•Unpublished venueRequires access

An evaluation of planar-adaptive routing (PAR)

J.H. Kim, Andrew A. Chien

Open publisher page 27 citations

Abstract

Network performance can be improved by allowing adaptive routing, but doing so introduces new possibilities of deadlock which can overwhelm the flexibility advantages. Planar-adaptive routing resolves this tension by limiting adaptive routing to a series of two-dimensional planes, reducing hardware requirements for deadlock prevention. The authors explore the performance of planar-adaptive routers for two, three, and four-dimensional networks. Under nonuniform traffic loads, the planar-adaptive router significantly outperforms the dimension-order router, while giving comparable performance under uniform loads. With equal resources, the planar-adaptive router provides performance superior to fully adaptive routers because it requires less resources for deadlock prevention, freeing resources to increase the number of virtual lanes.>

About this research paper

What this paper is about

Network performance can be improved by allowing adaptive routing, but doing so introduces new possibilities of deadlock which can overwhelm the flexibility advantages. Planar-adaptive routing resolves this tension by limiting adaptive routing to a series of two-dimensional planes, reducing hardware requirements for deadlock prevention. The authors explore the performance of planar-adaptive routers for two, three, and four-dimensional networks. Under nonuniform traffic loads, the planar-adaptive router significantly outperforms the dimension-order router, while giving comparable performance under uniform loads. With equal resources, the planar-adaptive router provides performance superior to fully adaptive routers because it requires less resources for deadlock prevention, freeing resources to increase the number of virtual lanes.>

Why it matters

OpenAlex reports 27 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Network performance can be improved by allowing adaptive routing, but doing so introduces new possibilities of deadlock which can overwhelm the flexibility advantages. Planar-adaptive routing resolves this tension by limiting adaptive routing to a series of two-dimensional planes, reducing hardware requirements for deadlock prevention. The authors explore the performance of planar-adaptive routers for two, three, and four-dimensional networks. Under nonuniform traffic loads, the planar-adaptive router significantly outperforms the dimension-order router, while giving comparable performance under uniform loads. With equal resources, the planar-adaptive router provides performance superior to fully adaptive routers because it requires less resources for deadlock prevention, freeing resources to increase the number of virtual lanes.>

Key concepts: Router, Computer science, Adaptive routing, Routing (electronic design automation), Deadlock, Computer network, Planar, Distributed computing

Related papers

Back to paper searchBrowse research topicsOriginal source
An evaluation of planar-adaptive routing (PAR) — Research Paper | ScholarLens