Keywords

Virtual computer systems, Content-addressable memory (CAM), Real-time virtual address decoder, Hardware implementation of replacement policies, Least recently used (LRU) algorithm, Secondary storage to primary memory mapping

Abstract

This research report gives a general description of virtual memory systems. The mechanisms and policies and their effect on the operation and efficiency of virtual memory are explained. A virtual memory using a real time virtual address decoder, to decode a 32 bits of virtual address for the secondary memory to obtain the primary address location discussed. The decoder is developed with the use of associative or content-addressable memories. Replacement algorithms, used for selecting the pages of the main memory to be replaced, are described. The hardware implementation of the least recently used and least often used replacement policies using associative memories is presented.

Notes

If this is your thesis or dissertation, and want to learn how to access it or for more information about readership statistics, contact us at STARS@ucf.edu

Graduation Date

Spring 1982

Advisor

Patz, Benjamin W.

Degree

Master of Science (M.S.)

College

College of Engineering

Format

PDF

Pages

59 pages

Language

English

Rights

Public Domain

Length of Campus-only Access

None

Access Status

Masters Thesis (Open Access)

Identifier

DP0013705

Subjects

Virtual storage (Computer science); Memory management (Computer science); Memory hierarchy (Computer science); Memory maps (Computer science); Memory--Research

Accessibility Status

Searchable text

Download

Included in

Engineering Commons

Share

COinS