Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chris M. Cunningham

dblp:38/3739 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 50% Electronic design automation · 38% Parallel and multicore computing · 12%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › routing algorithms › adaptive routing
fault-tolerant adaptive routing
0.011995
Fault-Tolerant Adaptive Routing for Two-Dimensional Meshes · HPCA 1995
Electronic design automation › physical design
routing
0.011995
Fault-Tolerant Adaptive Routing for Two-Dimensional Meshes · HPCA 1995
Parallel and multicore computing › parallel architecture
massively parallel processor
0.011995
Fault-Tolerant Adaptive Routing for Two-Dimensional Meshes · HPCA 1995
Interconnection networks and networks-on-chip › routing algorithms
wormhole routing
0.011995
Fault-Tolerant Adaptive Routing for Two-Dimensional Meshes · HPCA 1995

Methods — techniques the papers use, named apart from their topics

simulation · 0.0
YearPublicationVenuePosition
1995 Fault-Tolerant Adaptive Routing for Two-Dimensional Meshes
abstract
Many massively parallel computers in use today utilize simple deterministic XY wormhole routing to transmit messages between nodes. Because XY routing does not provide any routing adaptability, it lacks the ability to avoid congested links, as well as faults. Therefore, the focus of this paper will be two-fold: improving the performance of wormhole routing and providing fault tolerance for up to N-1 faults in an N/spl times/N two-dimensional mesh. A simulation model based on the Intel Paragon is presented that compares several known routing strategies with the proposed strategy to illustrate how local state information can be used to provide a potential network throughput improvement of up to 20%, while achieving fault tolerance.>
Chris M. Cunningham, Dimiter R. Avresky
HPCA1