One-Level Storage System

Kilburn, T.; Edwards, D. Brent; Lanigan, M.J.; Sumner, Frank H.

doi:10.1109/tec.1962.5219356

Cited by 177 publications

(47 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The MONADS system uses a quite different technique which separates the task of translating virtual addresses for pages in memory from those for pages on disk. This is, in a sense, a return to the approach taken on the Atlas [16] and has many advantages in terms of efficiency and flexibility. These are discussed in [22].…”

Section: Figure 3: a Monads Virtual Addressmentioning

confidence: 99%

“…Secondary Page Table (Page Table for Page Table) 32 entries each 16 The free space bit map is a bit map indicating those disk blocks which are currently unallocated. In the current implementation the free space bit map is locked into main memory for each volume in order to simplify the page fault resolution process.…”

Section: System Dependent Red-tape Informationmentioning

confidence: 99%

See 1 more Smart Citation

Stability in a Persistent Store Based on a Large Virtual Memory

Rosenberg

Henskens

Brown

et al. 1990

Workshops in Computing

View full text Add to dashboard Cite

Persistent systems support mechanisms which allow programs to create and manipulate arbitrary data structures which outlive the execution of the program which created them. A persistent store supports mechanisms for the storage and retrieval of objects in a uniform manner regardless of their lifetime. Since all data of the system is in this repository it is important that it always be in a consistent state. This property is called integrity. The integrity of the persistent store depends in part on the store being resilient to failures. That is, when an error occurs the store can recover to a previously recorded consistent state. The mechanism for recording this state and performing recovery is called stability. This paper considers an implementation of a persistent store based on a large virtual memory and shows how stability is achieved.

show abstract

Section: Figure 3: a Monads Virtual Addressmentioning

confidence: 99%

Section: System Dependent Red-tape Informationmentioning

confidence: 99%

Stability in a Persistent Store Based on a Large Virtual Memory

Rosenberg

Henskens

Brown

et al. 1990

Workshops in Computing

View full text Add to dashboard Cite

show abstract

“…These objectives led to the design of a computer system [6] (the General Electric Model 645) embodying the coneepts of paging [8] and segmentation [3] on which the initial implementation of MTJLTICS will run.…”

Section: Introductionmentioning

confidence: 99%

Virtual memory, processes, and sharing in Multics

Daley

Dennis

1967

Proceedings of the ACM Symposium on Operating System Principles - SOSP '67

View full text Add to dashboard Cite

“…A typical two-level hierarchy consists of a fast, expensive, and small (the latter two being a consequence of the first attribute) primary memory in addition to a slow, cheap, and large secondary memory. Obtaining the appearance of a single level that is fast and large by the automatic management of the hierarchy is probably one of the primary motivations for incorporating virtual memory in a computer system [15], [17].…”

mentioning

confidence: 99%

Two-Level Replacement Decisions in Paging Stores

Babaoğlu

Ferrari

1983

IEEE Trans. Comput.

View full text Add to dashboard Cite

Abstract-One of the primary motivations for implementing virtual memory is its ability to automatically manage a hierarchy of storage systems with different characteristics. The composite system behaves as if it were a single-level system having the more desirable characteristics of each of its constituent levels. In this paper we extend the virtual memory concept to within the top level of a two-level hierarchy. Here, the top level is thought of as containing two additional levels within it. This hierarchy is not a physical one, but rather an artificial one arising from the employment of two different replacement algorithms. Given two replacement algorithms, one of which has good performance but high implementation cost and the other poor performance but low implementation cost, we propose and analyze schemes that result in an overall algorithm having the performance characteristics of the former and the cost characteristics of the latter. We discuss the suitability of such schemes in the management of storage hierarchies that lack page reference bits.

show abstract

One-Level Storage System

Cited by 177 publications

References 6 publications

Stability in a Persistent Store Based on a Large Virtual Memory

Stability in a Persistent Store Based on a Large Virtual Memory

Virtual memory, processes, and sharing in Multics

Two-Level Replacement Decisions in Paging Stores

Contact Info

Product

Resources

About