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.

Leonard Y. Liu

dblp:99/4551 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1973
—ORCID · none

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

Theory of computation · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 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.

Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Operating systems › resource management
memory management
0.011973
A Page Allocation Strategy for Multiprogramming Systems with Virtual Memory · SOSP 1973
Operating systems › resource management › process management
multiprogramming
0.011973
A Page Allocation Strategy for Multiprogramming Systems with Virtual Memory · SOSP 1973
Operating systems › resource management › memory management
page allocation
0.011973
A Page Allocation Strategy for Multiprogramming Systems with Virtual Memory · SOSP 1973
Operating systems › resource management
resource allocation
0.011973
A Page Allocation Strategy for Multiprogramming Systems with Virtual Memory · SOSP 1973

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

simulation · 0.0queueing analysis · 0.0
YearPublicationVenuePosition
1973 A Page Allocation Strategy for Multiprogramming Systems with Virtual Memory
abstract
In a multiprogramming, virtual-memory computing system, many processes compete simultaneously for system resources, which include CPU's, main memory page frames, and the transmission capacity of the paging drum. (We define a “process” here as a program with its own virtual memory, requiring an allocation of real memory and a CPU in order to execute). This paper studies ways of allocating resources to processes in order to maximize throughput in systems which are not CPU-bound.
Donald D. Chamberlin, Samuel H. Fuller, Leonard Y. Liu
SOSP3
1973 An Infinite Hierarchy of Intersections of Context-Free Language
Leonard Y. Liu, Peter Weiner
Math. Syst. Theory1
1970 A Characterization of Semilinear Sets
Leonard Y. Liu, Peter Weiner
J. Comput. Syst. Sci.1