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

Pattabhiraman Krishna

dblp:138/3794 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1999
—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 · 100%
Computer networks
1 paper
Network performance modeling · 50% Transport protocols and congestion control · 50%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › switch architecture
crossbar switch		 0.011999
On the speedup required for work-conserving crossbar switches · IEEE J. Sel. Areas Commun. 1999
Interconnection networks and networks-on-chip › network scheduling
switch scheduling		 0.011999
On the speedup required for work-conserving crossbar switches · IEEE J. Sel. Areas Commun. 1999
Network performance modeling › network calculus
delay bounds		 0.011999
On the speedup required for work-conserving crossbar switches · IEEE J. Sel. Areas Commun. 1999
Transport protocols and congestion control › real-time communication
real-time traffic		 0.011999
On the speedup required for work-conserving crossbar switches · IEEE J. Sel. Areas Commun. 1999

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

queueing analysis · 0.0
YearPublicationVenuePosition
1999 On the speedup required for work-conserving crossbar switches
abstract
This paper describes the architecture for a work-conserving server using a combined I/O-buffered crossbar switch. The switch employs a novel algorithm based on output occupancy, the lowest occupancy output first algorithm (LOOFA), and a speedup of only two. A work-conserving switch provides the same throughput performance as an output-buffered switch. The work-conserving property of the switch is independent of the switch size and input traffic pattern. We also present a suite of algorithms that can be used in combination with LOOFA. These algorithms determine the fairness and delay properties of the switch. We also describe a mechanism to provide delay bounds for real-time traffic using LOOFA. These delay bounds are achievable without requiring output-buffered switch emulation.
Pattabhiraman Krishna, Naimish S. Patel, Anna Charny, Robert J. Simcoe
 IEEE J. Sel. Areas Commun.1