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

Yuanping Mu

dblp:135/5551 · DBLP profile ↗
← Back
1ranked-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 · 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 · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › network topology
hypercube variant
0.212013
Exchanged Crossed Cube: A Novel Interconnection Network for Parallel Computation · IEEE Trans. Parallel Distributed Syst. 2013
Interconnection networks and networks-on-chip
interconnection networks
0.212013
Exchanged Crossed Cube: A Novel Interconnection Network for Parallel Computation · IEEE Trans. Parallel Distributed Syst. 2013
Interconnection networks and networks-on-chip
network topology
0.212013
Exchanged Crossed Cube: A Novel Interconnection Network for Parallel Computation · IEEE Trans. Parallel Distributed Syst. 2013
Interconnection networks and networks-on-chip
routing and broadcasting
0.212013
Exchanged Crossed Cube: A Novel Interconnection Network for Parallel Computation · IEEE Trans. Parallel Distributed Syst. 2013
Graph algorithms and graph theory
graph connectivity
0.012013
Exchanged Crossed Cube: A Novel Interconnection Network for Parallel Computation · IEEE Trans. Parallel Distributed Syst. 2013

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

routing algorithm · 0.3broadcasting algorithm · 0.3
YearPublicationVenuePosition
2013 Exchanged Crossed Cube: A Novel Interconnection Network for Parallel Computation
abstract
The topology of interconnection networks plays a key role in the performance of parallel computing systems. A new interconnection network called exchanged crossed cube (ECQ) is proposed and analyzed in this paper. We prove that ECQ has the better properties than other variations of the basic hypercube in terms of the smaller diameter, fewer links, and lower cost factor, which indicates the reduced communication overhead, lower hardware cost, and more balanced consideration among performance and cost. Furthermore, it maintains several attractive advantages including recursive structure, high partitionability, and strong connectivity. Furthermore, the optimal routing and broadcasting algorithms are proposed for this new network topology.
Keqiu Li, Yuanping Mu, Keqin Li 0001, Geyong Min
IEEE Trans. Parallel Distributed Syst.2