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

U. V. Premkumar

dblp:78/3296 · DBLP profile ↗
← Back
1ranked-venue papers
1as 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 · 1 first-authorSoftware engineering, systems software and programming languages · 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 · 56% Cloud and datacenter computing · 44%

Topics — the 3 heaviest of 3, 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
Resource allocation in rectangular SW banyans · ISCA 1982
Cloud and datacenter computing
resource allocation		 0.011982
Resource allocation in rectangular SW banyans · ISCA 1982
Interconnection networks and networks-on-chip › multiprocessor interconnection
processor-memory interconnection		 0.011982
Resource allocation in rectangular SW banyans · ISCA 1982
YearPublicationVenuePosition
1982 Resource allocation in rectangular SW banyans
abstract
This paper presents an algorithm for the formation of configurations connecting processors to memory and I/O devices on rectangular SW banyan networks with equivalent processor resources as the base nodes and equivalent memory and I/O resources as the apex nodes. Given a set of resource configuration requests, the algorithm always finds a partition of the network that meets the requests in space and time complexity linear with respect to the number of resources in the network.
U. V. Premkumar, James C. Browne
 ISCA1