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

Brad Wetmore

dblp:07/4764 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1991
—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%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip
congestion control
0.011991
Alleviation of tree saturation in multistage interconnection networks · SC 1991
Interconnection networks and networks-on-chip › network contention
hot-spot contention
0.011991
Alleviation of tree saturation in multistage interconnection networks · SC 1991
Interconnection networks and networks-on-chip › switching network
multistage interconnection network
0.011991
Alleviation of tree saturation in multistage interconnection networks · SC 1991

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

network simulation · 0.0
YearPublicationVenuePosition
1991 Alleviation of tree saturation in multistage interconnection networks
abstract
This paper presents an examination of two distinct but complementary extensions of previous work on hot spot contention in multistage interconnection networks. The first extension focuses on the use of larger queues at the memory modules than are traditionally studied. The second extension explores a simple feedback damping scheme, which we refer to as bleeding, which allows selected processors to ignore feedback information. The impact of memory queue size, feedback threshold value, and bleeding on system performance (specifically maximum bandwidth per processor) is evaluated by analyzing the results of extensive network simulations. These results indicate that combining these approaches can significantly improve the effective bandwidth of a multistage interconnection network. 1. Introduction In order to achieve the goal of teraflop computing speeds by the end of the century, the number of processing nodes in a multiprocessor will have to increase substantially. However, as the numb...
Matthew K. Farrens, Brad Wetmore, Allison Woodruff
SC2