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

Chiang-Ling Ng

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

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

Computer networks · 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% Performance modeling and evaluation · 50%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › network performance analysis
interconnection network performance		 0.011997
Performance Analysis of Generalized Multihop Shuffle Networks · INFOCOM 1997
Interconnection networks and networks-on-chip › switching network › multistage interconnection network
shuffle network		 0.011997
Performance Analysis of Generalized Multihop Shuffle Networks · INFOCOM 1997

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

queueing analysis · 0.0
YearPublicationVenuePosition
1997 Performance Analysis of Generalized Multihop Shuffle Networks
abstract
This paper describes the performance analysis of a class of two-connected multihop shufflenets, known as generalized shuffle networks. The topology of such networks is described mathematically by the equation N=kn, where N is the total number of nodes in the network, k the number of stages in the network and n the number of nodes in each stage. Compared to classical shufflenets, the definition of generalized shuffle networks allows a larger number of feasible network structures that are realizable for a given network size N. In attempting to find an optimum network structure, network characteristics are discussed and system performance is evaluated. Important relationships and interdependencies among the various network parameters are developed to facilitate cross-structural comparison.
Chiang-Ling Ng, Seung-Woo Seo, Hisashi Kobayashi
 INFOCOM1