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

Richard A. Huff

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

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

Software 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.

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% High-performance computing · 50%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
instruction scheduling		 0.011993
Lifetime-Sensitive Modulo Scheduling · PLDI 1993
Compilers and program optimization › instruction scheduling › software pipelining
modulo scheduling		 0.011993
Lifetime-Sensitive Modulo Scheduling · PLDI 1993
Compilers and program optimization › instruction scheduling
software pipelining		 0.011993
Lifetime-Sensitive Modulo Scheduling · PLDI 1993
Processor architecture and microarchitecture › register management
register pressure		 0.011993
Lifetime-Sensitive Modulo Scheduling · PLDI 1993
High-performance computing
scientific computing		 0.011993
Lifetime-Sensitive Modulo Scheduling · PLDI 1993

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

bidirectional slack scheduling · 0.0
YearPublicationVenuePosition
1993 Lifetime-Sensitive Modulo Scheduling
abstract
This paper shows how to software pipeline a loop for minimal register pressure without sacrificing the loop's minimum execution time. This novel bidirectional slack-scheduling method has been implemented in a FORTRAN compiler and tested on many scientific benchmarks. The empirical results—when measured against an absolute lower bound on execution time, and against a novel schedule-independent absolute lower bound on register pressure—indicate near-optimal performance.
Richard A. Huff
 PLDI1