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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Thomas Hehre

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

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

Systems, architecture and hardware · 1

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 · 77% Electronic design automation · 23%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › multicast
fault-tolerant multicast routing		 0.011996
Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels · HPCA 1996
Interconnection networks and networks-on-chip › network topology
mesh network		 0.011996
Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels · HPCA 1996
Interconnection networks and networks-on-chip
network topology		 0.011996
Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels · HPCA 1996
Electronic design automation › physical design
routing		 0.011996
Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels · HPCA 1996
Interconnection networks and networks-on-chip › routing algorithms
wormhole routing		 0.011996
Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels · HPCA 1996

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

pseudo-hamiltonian path-based routing · 0.0deadlock-free routing · 0.0
YearPublicationVenuePosition
1996 Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels
abstract
This paper addresses the problem of fault-tolerant multicast routing in wormhole-routed multicomputers. We present a new pseudo-Hamiltonian path-based routing methodology for constructing deadlock-free multicast routing algorithms requiring no virtual channels. This technique is applied to construct the first fault-tolerant multicast routing algorithm for the mesh that requires no virtual channels. Simulation results indicate that this technique results in minimal performance degradation in the presence of a large number of node and channel faults.
Ran Libeskind-Hadas, Kevin Watkins, Thomas Hehre
 HPCA3