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

Robert C. Daley

dblp:57/4401 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1969
—ORCID · none

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

Software engineering, systems software and programming languages · 2 · 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
2 papers
Operating systems · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 77% Processor architecture and microarchitecture · 23%

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

TopicWeightPapersLastEvidence papers
Memory systems › memory management
virtual memory
0.011969
The multics virtual memory · SOSP 1969
Operating systems
dynamic linking
0.011967
Virtual memory, processes, and sharing in Multics · SOSP 1967
Operating systems › resource management › memory management
virtual memory
0.011967
Virtual memory, processes, and sharing in Multics · SOSP 1967
Operating systems › resource management
process management
0.011967
Virtual memory, processes, and sharing in Multics · SOSP 1967

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

virtual memory · 0.0segmentation · 0.0paging · 0.0dynamic linking · 0.0
YearPublicationVenuePosition
1969 The multics virtual memory
abstract
As experience with use of on-line operating systems has grown, the need to share information among system users has become increasingly apparent. Many contemporary systems permit some degree of sharing. Usually, sharing is accomplished by allowing several users to share data via input and output of information stored in files kept in secondary storage. Through the use of segmentation, however, Multics provides direct hardware addressing by user and system programs of all information, independent of its physical storage location. Information is stored in segments each of which is potentially sharable and carries its own independent attributes of size and access privilege.Here, the design and implementation considerations of segmentation and sharing in Multics are first discussed under the assumption that all information resides in a large, segmented main memory. Since the size of main memory on contemporary systems is rather limited, it is then shown how the Multics software achieves the effect of a large segmented main memory through the use of the GE 645 segmentation and paging hardware.
A. Bensoussan, C. T. Clingen, Robert C. Daley
SOSP3
1967 Virtual memory, processes, and sharing in Multics
abstract
The value of a computer system to its users is greatly enhanced if a user can, in a simple and general way, build his work upon procedures developed by others. The attainment of this essential generality requires that a computer system possess the features of equipment-independent addressing, an effectively infinite virtual memory, and provision for the dynamic linking of shared procedure and data objects. The paper explains how these features are realized in the Multics system.
Robert C. Daley, Jack B. Dennis
SOSP1