Demo Data from VLDB 2026 / reviewers in the wild / expert
Lee C. Varian
dblp:73/3878
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1967
—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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Memory systems · 91% Performance modeling and evaluation · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems › virtual memory management
page replacement algorithms |
0.0 | 1 | 1967 | An empirical study of the behavior of programs in a paging environment · SOSP 1967 |
Memory systems › memory management › virtual memory
paging |
0.0 | 1 | 1967 | An empirical study of the behavior of programs in a paging environment · SOSP 1967 |
Memory systems › memory management
virtual memory |
0.0 | 1 | 1967 | An empirical study of the behavior of programs in a paging environment · SOSP 1967 |
Performance modeling and evaluation
workload characterization |
0.0 | 1 | 1967 | An empirical study of the behavior of programs in a paging environment · SOSP 1967 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1967 | An empirical study of the behavior of programs in a paging environmentabstractThis paper reports initial results from an empirical study directed at the measurement of program operating behavior in those multiprogramming systems in which programs are organized into fixed length pages. The data collected from the interpretive execution of a number of paged programs is used to describe the frequency of page faults; i.e. the frequency of those instants at which an executing program requires a page of data or instructions not in main (core) memory. These data are used also for the evaluation of two page replacement algorithms and for assessing the effects on performance of changes in the amount of storage allocated to executing programs. Lee C. Varian, Edward G. Coffman Jr. |
SOSP | 1 |