Browse Prior Art Database

Method for Managing Dynamic Storage

IP.com Disclosure Number: IPCOM000039550D
Original Publication Date: 1987-Jun-01
Included in the Prior Art Database: 2005-Feb-01
Document File: 1 page(s) / 12K

Publishing Venue

IBM

Related People

Chen, YS: AUTHOR [+4]

Abstract

This invention relates to a method for management of dynamic storage invoked by processes in a multiprogramming environment. The method steps include (a) being responsive to a processor storage request, scanning available storage and assigning the storage to the process if available, and (b), if not free, applying a phased LRU replacement discipline. The discipline further includes the steps of link listing and rendering available to satisfy the request storage elements sufficient to satisfy the request magnitude in LRU (least recently used) order. This method may be illustratively embodied in a relational data base management system for managing the storage associated with the application phase thereof.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 81% of the total text.

Page 1 of 1

Method for Managing Dynamic Storage

This invention relates to a method for management of dynamic storage invoked by processes in a multiprogramming environment. The method steps include (a) being responsive to a processor storage request, scanning available storage and assigning the storage to the process if available, and (b), if not free, applying a phased LRU replacement discipline. The discipline further includes the steps of link listing and rendering available to satisfy the request storage elements sufficient to satisfy the request magnitude in LRU (least recently used) order. This method may be illustratively embodied in a relational data base management system for managing the storage associated with the application phase thereof. As may be recalled, sequences of relational accessing statements from, for example, an application define the information to be sought but leave it to the system to determine an optimal path to the data. These data requests and the path for satisfying them are converted into an optimized runtime structure. This runtime structure is termed an application plan. In this regard, the plan constitutes the process and, during the execution, it is necessary to allocate a subpool of an appropriate size to minimize fragmentation. Likewise, when storage is limited, allocation must be just enough to maintain concurrent operations. For optimum operation, the storage control information should be separated from the data area. Also, all the s...