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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Renzo Di Antonio

dblp:45/6405 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1989
—ORCID · none

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

Systems, architecture and hardware · 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 · 87% Compilers and program optimization · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 50% Memory systems · 50%

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

TopicWeightPapersLastEvidence papers
Operating systems › resource management › memory management › virtual memory
paging
0.011989
Using PAGE-AHEAD for large FORTRAN programs · SC 1989
Operating systems › resource management › memory management
virtual memory
0.011989
Using PAGE-AHEAD for large FORTRAN programs · SC 1989
Memory systems › virtual memory management
demand paging
0.011989
Using PAGE-AHEAD for large FORTRAN programs · SC 1989
Storage systems
virtual storage
0.011989
Using PAGE-AHEAD for large FORTRAN programs · SC 1989

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

page-ahead · 0.0
YearPublicationVenuePosition
1989 Using PAGE-AHEAD for large FORTRAN programs
abstract
Virtual storage management allows an efficient use of computer memory through the cooperative actions of the computer hardware and the operating system which are completely transparent to application programs. However, when program data exceed the available memory space, the program elapsed time may be dominated by the time spent in paging I/O operations. The data transfer rate, as determined by the operating system implementation of demand paging, may be small when compared with the maximum I/O bandwidth that the I/O hardware could support.
Renzo Di Antonio, John Eilert, Marcello Vitaletti
SC1