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

Greg Henderson

dblp:298/1778 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1974
—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.

Software engineering, system software, and programming languages
1 paper
Operating systems · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Operating systems › resource management
memory management		 0.011974
The optimal choice of window sizes for working set dispatching · SIGMETRICS 1974
Operating systems › resource management › memory management › virtual memory
paging		 0.011974
The optimal choice of window sizes for working set dispatching · SIGMETRICS 1974
Performance modeling and evaluation
simulation		 0.011974
The optimal choice of window sizes for working set dispatching · SIGMETRICS 1974

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

space-time cost modeling · 0.0simulation · 0.0
YearPublicationVenuePosition
1974 The optimal choice of window sizes for working set dispatching
abstract
The concept of varying window size in a working set dispatcher to control working set size and number of page faults is examined. A space-time cost equation is developed and used to compare fixed window size to variable window size for different types of secondary storage based on the simulated execution of real programs. A general approach is indicated for studying the relative merit of the two dispatching algorithms and their interaction with different hardware configurations.
Greg Henderson, Juan Rodriguez-Rosell
 SIGMETRICS1