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

Reid Powell

dblp:83/9913 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

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

Systems, architecture and hardware · 2

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 · 100%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip
network topology
0.112011
Interlacing Bypass Rings to Torus Networks for More Efficient Networks · IEEE Trans. Parallel Distributed Syst. 2011
Interconnection networks and networks-on-chip › network topology
network diameter
0.012011
Interlacing Bypass Rings to Torus Networks for More Efficient Networks · IEEE Trans. Parallel Distributed Syst. 2011

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

node-to-node distance analysis · 0.1bisection width analysis · 0.1
YearPublicationVenuePosition
2013 Analysis of Linpack and power efficiencies of the world's TOP500 supercomputers
Yuefan Deng, Peng Zhang 0006, Reid Powell
Parallel Comput.4
2011 Interlacing Bypass Rings to Torus Networks for More Efficient Networks
abstract
We introduce a new technique for generating more efficient networks by systematically interlacing bypass rings to torus networks (iBT networks). The resulting network can improve the original torus network by reducing the network diameter, node-to-node distances, and by increasing the bisection width without increasing wiring and other engineering complexity. We present and analyze the statement that a 3D iBT network proposed by our technique outperforms 4D torus networks of the same node degree. We found that interlacing rings of sizes 6 and 12 to all three dimensions of a torus network with meshes 30 × 30 × 36 generate the best network of all possible networks, including 4D torus and hypercube of approximately 32,000 nodes. This demonstrates that strategically interlacing bypass rings into a 3D torus network enhances the torus network more effectively than adding a fourth dimension, although we may generalize the claim. We also present a node-to-node distance formula for the iBT networks.
Peng Zhang 0006, Reid Powell, Yuefan Deng
IEEE Trans. Parallel Distributed Syst.2