Browse Prior Art Database

Management Technique for Memory Hierarchies

IP.com Disclosure Number: IPCOM000052470D
Original Publication Date: 1981-Jun-01
Included in the Prior Art Database: 2005-Feb-11

Publishing Venue

IBM

Related People

Authors:
May, CM [+details]

Abstract

A memory hierarchy system consists of multiple levels of devices used t store data. The highest level is typically the smallest, fastest, and most expensive (per byte), with size increasing and speed and cost decreasing as one moves down the hierarchy. Examples of memory hierarchies include: cache and main memory in a CPU, main memory and direct-access storage devices (DASDs) (when main memory is used to buffer records retrieved from DASD), random-access memory (RAM) and DASDs of buffered DASD subsystems, and the staging drives and cartridges of the Mass Storage System. (In all the foregoing examples, the higher level of the hierarchy is stated first.)