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

Gary E. Barnes

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

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

Systems, architecture and hardware · 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.

Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 50% Parallel and multicore computing · 50%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
instruction scheduling		 0.011978
Comments on "The Identification of Maximal Parallelism in Straight-Line Microprograms" · IEEE Trans. Computers 1978
Compilers and program optimization
microprogram optimization		 0.011978
Comments on "The Identification of Maximal Parallelism in Straight-Line Microprograms" · IEEE Trans. Computers 1978
Processor architecture and microarchitecture
microprogramming		 0.011978
Comments on "The Identification of Maximal Parallelism in Straight-Line Microprograms" · IEEE Trans. Computers 1978
Parallel and multicore computing › parallel programming models › automatic parallelization
parallelism extraction		 0.011978
Comments on "The Identification of Maximal Parallelism in Straight-Line Microprograms" · IEEE Trans. Computers 1978
YearPublicationVenuePosition
1978 Comments on "The Identification of Maximal Parallelism in Straight-Line Microprograms"
abstract
This correspondence makes a comment on an aspect of a recent paper1by Dasgupta and Tartar.1The purpose here is to point out an implicit assumption used in their presented algorithm which prevents it from producing optimum output for all input sequences.
Gary E. Barnes
 IEEE Trans. Computers1