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

Carl Hein

dblp:90/2673 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1989
—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
Performance modeling and evaluation · 50% Interconnection networks and networks-on-chip · 38% Processor architecture and microarchitecture · 12%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › queueing models
blocking probability
0.011989
Comparative performance of circuit-switched networks based on blocking probability · SC 1989
Interconnection networks and networks-on-chip › switching network
circuit-switched network
0.011989
Comparative performance of circuit-switched networks based on blocking probability · SC 1989
Processor architecture and microarchitecture
multicore design
0.011989
Comparative performance of circuit-switched networks based on blocking probability · SC 1989
Performance modeling and evaluation › network performance analysis
network performance modeling
0.011989
Comparative performance of circuit-switched networks based on blocking probability · SC 1989

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

analytical modeling · 0.0
YearPublicationVenuePosition
1989 Comparative performance of circuit-switched networks based on blocking probability
abstract
A class of dynamic parallel processor interconnection networks, called circuit-switched networks, are composed of layers of small crossbar elements. Although such networks provide full connectivity, they are often called blocking networks, since contentions for network links sometimes block message pathways. The results from a study are reported in which the goal was to determine the effect of variations in a network's topology to aid in the selection of more optimal architectures. Three approaches were used in the study to determine the relative blocking performance of networks based on topology.
Carl Hein
SC1