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 SIGIR 2026 / reviewers in the wild / expert

Thomas Mookken

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

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

Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 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%
Computer networks
1 paper
Network performance modeling · 100%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › routing algorithms
deadlock-free routing		 0.011988
Traffic Analysis of Rectangular SW-Banyan Networks · ISCA 1988
Network performance modeling › queueing analysis
queueing models of computer systems		 0.011988
Traffic Analysis of Rectangular SW-Banyan Networks · ISCA 1988

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

simulation · 0.0queueing model · 0.0
YearPublicationVenuePosition
1988 Traffic Analysis of Rectangular SW-Banyan Networks
abstract
An algorithm to route packets in rectangular SW-banyans is described. A packet-switching scheme is modeled on single-sided and double-sided SW-banyans. Effects of queue lengths and processor configurations on performance are studied. Prevention of deadlocks in the network is discussed. Simulation results suggest a scheme with varying queue lengths for different levels of the network to optimize performance, and that the length be limited. The algorithm presented is able to take advantage of the network traffic information stored at a node and dynamically route a packet through a shortest path which has the least load.>
Roy M. Jenevein, Thomas Mookken
 ISCA2