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

William J. Thomas

dblp:56/2379 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1982
—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 · 70% Distributed systems · 23% Electronic design automation · 7%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › switching network › multistage interconnection network
banyan network
0.011982
Pin Limitations and Partitioning of VLSI Interconnection Networks · IEEE Trans. Computers 1982
Interconnection networks and networks-on-chip › switching network
multistage interconnection network
0.011982
Pin Limitations and Partitioning of VLSI Interconnection Networks · IEEE Trans. Computers 1982
Distributed systems › fault tolerance › failure models
network partitioning
0.011982
Pin Limitations and Partitioning of VLSI Interconnection Networks · IEEE Trans. Computers 1982
Interconnection networks and networks-on-chip › interconnection networks
VLSI networks
0.011982
Pin Limitations and Partitioning of VLSI Interconnection Networks · IEEE Trans. Computers 1982
Electronic design automation › timing analysis
delay modeling
0.011982
Pin Limitations and Partitioning of VLSI Interconnection Networks · IEEE Trans. Computers 1982

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

analytical modeling · 0.0
YearPublicationVenuePosition
1982 Pin Limitations and Partitioning of VLSI Interconnection Networks
abstract
Multiple processor interconnection networks can be characterized as having N' inputs and N' outputs, each being B' bits wide. A major implementation constraint of large networks in the VLSI environment is the number of pins available on a chip, Np. Construction of large networks requires partitioning of the N' * N' * B' network into a collection of N * N switch modules with each input and output port being B (B ≤ B') bits wide. If each module corresponds to a single chip, then a large network can be implemented by interconnecting the chips in a particular manner. This correspondence presents a methodology for selecting the optimum values of N and B given values of N', B', Np, and the number of control lines per port. Models for both banyan and crossbar networks are developed and arrangements yielding minimum: 1) number of chips, 2) average delay through the network, and 3) product of number of chips and delay, are presented.
Mark A. Franklin, Donald F. Wann, William J. Thomas
IEEE Trans. Computers3