EDBT 2026 Demo / reviewers in the wild / expert
L. A. Klimko
dblp:50/5708
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1972
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1
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 |
Storage systems · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems › i/o scheduling
disk scheduling |
0.0 | 1 | 1972 | Analysis of Scanning Policies for Reducing Disk Seek Times · SIAM J. Comput. 1972 |
Storage systems › i/o optimization
disk seek time reduction |
0.0 | 1 | 1972 | Analysis of Scanning Policies for Reducing Disk Seek Times · SIAM J. Comput. 1972 |
Methods — techniques the papers use, named apart from their topics
response time analysis · 0.0mathematical modeling · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1972 | Analysis of Scanning Policies for Reducing Disk Seek TimesabstractA number of recent studies have examined techniques for sequencing disk accesses to minimize or reduce seek times. The principal methods proposed have been called scanning policies. In this paper we formulate and analyze simple mathematical models of head motion in disk systems in which two different scanning policies are implemented. Expressions for response times are derived, and the properties they imply are discussed. Edward G. Coffman Jr., L. A. Klimko, Barbara Ryan |
SIAM J. Comput. | 2 |