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.

G. Oppenheimer

dblp:72/1892 · DBLP profile ↗
← Back
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.

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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Operating systems › resource management › memory management › virtual memory
paging algorithms
0.011967
Resource management for a medium scale time sharing operating system · SOSP 1967
Operating systems
resource management
0.011967
Resource management for a medium scale time sharing operating system · SOSP 1967
Operating systems › resource management › process management › CPU scheduling
task scheduling
0.011967
Resource management for a medium scale time sharing operating system · SOSP 1967
Operating systems › resource management › memory management
virtual memory
0.011967
Resource management for a medium scale time sharing operating system · SOSP 1967
Performance modeling and evaluation
simulation
0.011967
Resource management for a medium scale time sharing operating system · SOSP 1967

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

trace-driven simulation · 0.0
YearPublicationVenuePosition
1967 Resource management for a medium scale time sharing operating system
abstract
Task scheduling and resource balancing for a medium-size virtual memory paging machine are discussed in relation to a combined batch processing and time sharing environment. A synopsis is given of the task scheduling and paging algorithms that were implemented and the results of comparative simulation are given by tracing the development of the algorithms through six predecessor versions. Throughout the discussion particular emphasis is placed on balancing the system performance relative to the characteristics of all the system resources. Simulation results relative to alternate hardware characteristics and the effects of program mix and loading variations are also presented.
G. Oppenheimer, Norman Weizer
SOSP1