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.

J. Y. Babonneau

dblp:19/7018 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1977
—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 · 100%
Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 50% Compilers and program optimization · 50%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization › memory optimization
data locality optimization
0.011977
Automatic and General Solution to the Adaption of Programs in a Paging Environment · SOSP 1977
Software maintenance and evolution › software reengineering
program restructuring
0.011977
Automatic and General Solution to the Adaption of Programs in a Paging Environment · SOSP 1977
Memory systems › memory management › virtual memory
paging
0.011977
Automatic and General Solution to the Adaption of Programs in a Paging Environment · SOSP 1977
Memory systems › memory management
virtual memory
0.011977
Automatic and General Solution to the Adaption of Programs in a Paging Environment · SOSP 1977
Memory systems › cache management
cache replacement
0.011977
Automatic and General Solution to the Adaption of Programs in a Paging Environment · SOSP 1977
Memory systems › memory management › virtual memory
page replacement
0.011977
Automatic and General Solution to the Adaption of Programs in a Paging Environment · SOSP 1977
YearPublicationVenuePosition
1977 Automatic and General Solution to the Adaption of Programs in a Paging Environment
abstract
The efficiency of replacement algorithms in paged virtual-storage systems depends on the locality of memory references. The restructuring of the blocks which compose the program may improve this locality. [HATFIELD and GERALD 71] [MASUDA SHIOTA NOGUCHI and OHKI 74] [FERRARI 76].
J. Y. Babonneau, M. S. Achard, Gérard Morisset, M. B. Mounajjed
SOSP1