Virtual lookaside facility

• US 5,134,696 A
• Filed: 07/28/1988
• Issued: 07/28/1992
• Est. Priority Date: 07/28/1988
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Swanson, Michael D., Brown, David D., Reinheimer, Rick F., Morschhauser, Wayne J.
• Primary Examiner(s): Shaw, Gareth D.
• Assistant Examiner(s): KULIK, PAUL V
• Application Number:
  US07/225,445
• Time in Patent Office: 1,461 Days
• Field of Search: 364/200 MS File, 364/900 MS File, 364/200, 364/900, 395/425, 395/700, 395/600
• US Class Current: 711/3
• CPC Class Codes: G06F 12/0866 for peripheral storage systems, e.g. disk cache
• CPC Class Codes: G06F 12/1036 for multiple virtual address spaces, e.g. segmentation G06F12/1045 takes precedence
• CPC Class Codes: G06F 12/1045 associated with a data cache
• CPC Class Codes: G06F 12/121 using replacement algorithms
• CPC Class Codes: G06F 2212/311 In host system
• CPC Class Codes: G06F 9/4488 Object-oriented

Abstract

A virtual lookaside faclity is provided for maintaining named data objects in class-related data spaces in virtual storage, readily retrievable by user programs. A search order is associated with each user, specifying an ordered list of "major names" which are, in effect, sequentially searched for a specified "minor name", or data object, to obtain a virtual storage copy of that data object. As data objects are placed into a virtual cache, existence information, implicit in the naming structure, is captured and saved. This information is relied on later in retrieving objects from the cache. The data isolation provided by maintaining class data and control blocks in individual data spaces is exploited to prevent failures relating to one class of objects from affecting the others, and to handle latent program users, following failures, effectively.

An LRU-like trimming technique is used to remove less useful objects from the cache when cache space is fully utilized.

Claims

1. In a central electronic complex comprising system resources, user programs, and an operating system for managing said system resources, a virtual lookaside facility comprising:

A) storage means comprising main and auxiliary storage;

B) a virtual storage cache for storing data objects in said storage means, each data object being linked to a data object control structure and having a minor name uniquely identifying said data object within a data set containing said data object, said data set having a major name uniquely identifying said data set within a class of data objects, said class of data objects having a class name uniquely identifying said class of data objects within said central electronic complex, so that a particular data object is uniquely identified within said central electronic complex by a particular minor name, a particular major name, and a particular class name;

C) one or more search order definition means, each one linked to an associated one of said user programs, for uniquely specifying for said associated one of said user programs, a data set search order, comprising an ordered list of entries, each entry specifying the major name identifying an associated data set, said ordered list indicating the data set search order for a searched-for data object having a searched-for minor name;

D) CREATE means, responsive to a CREATE request by a storing one of said user programs, for storing a stored data object in said virtual storage cache, said storing one of said user programs specifying in said CREATE request a search order index into the data set search order linked to said storing one of said user programs, said search order index indicating the associated data set from which said stored data object was obtained by said storing one of said user programs;

E) existence table means, connected to said data object control structure, and containing an indication, set by said CREATE means, for determining whether said stored data object may be used from said virtual storage cache by a retrieving one of said user programs; and

F) search means, responsive to a RETRIEVE request by said retrieving one of said user programs, for retrieving said stored data object from said virtual storage cache, said search means accessing said associated search order definition means to determine from where in the data set search order associated with said retrieving one of said user programs said stored data object was retrieved, and accessing said existence table means to determine whether said stored data object may be used by said retrieving one of said user programs.

2. The facility of claim 1 in which said existence table means comprises a table linked to a block containing said searched for minor name, said table having at least one entry, said entry being associated by an ordering with a single major name, said entry containing said indication, said indication having a first entry containing said indication, said indication having a first value to indicate that said searched for minor name does not identify any data object within the data set uniquely identified by said single major name, and having a second value to indicate that said searched for minor name may identify a relevant data object within the data set uniquely identified by said single major name, said CREATE means setting said indication to said first value for each entry having an associated single major name occurring, in said ordered list of entries linked to said storing one of said user programs, prior to the major name identifying the associated data set from which said stored data object was obtained, said search means determining said stored data object to be usable by said retrieving one of said user programs when each entry having said associated single major name occurring, in said ordered list of entries linked to said retrieving one of said user programs, prior to the major name identifying the associated data set from which said stored data object was obtained has said first value.

3. The facility of claim 2 further comprising:

A) DEFINE CLASS means, responsive to a DEFINE CLASS request by a third one of said user programs, for separating cached data objects and control blocks associated with one of said classes of data objects from cached data objects and control blocks associated with others of said classes of data objects and associating an access token with said separated class;

B) PURGE means, responsive to a PURGE request by a data damage detecting function apart from any one of said user programs, for purging all of said separated cached data objects and control blocks associated with said one of said classes of data, and invalidating the associated access token;

C) invalidity determination means, invoked by said search means, for determining whether the RETRIEVE request is for said separated class whose associated access token was invalidated by said PURGE means, and returning a "failed" indication to said search means when the associated access token was so invalidated.

4. The facility of claim 3 in which said virtual storage cache comprises a first data space containing only control blocks associated with said one of said classes of cached data objects, and a second data space containing only data objects associated with said one of said classes of cached data objects.

5. The facility of claim 4 in which said access token comprises a data space access list entry (ALET).

6. The facility of claim 5, further comprising means for trimming from said virtual storage cache infrequently used data objects.

7. In a central electronic complex comprising system resources, user programs, and an operating system for managing said system resources, a programmed method for managing named data objects in a virtual lookaside facility (VLF) comprising the steps of:

A) constructing a first data set search order by an IDENTIFY function, on behalf of one of the user programs, said first data set search order comprising an ordered list of major names, each major name in the ordered list uniquely identifying one of a sequence of data sets, each data set containing associated data objects each having a minor name, said first data set search order indicating an order of searching for a data object within said sequence of data sets on request by said one of the user programs such that a search commences with a first data set in said sequence of data sets, and terminates when the data set containing said data object is identified or when all of said sequence of data sets has been searched;

B) in response to a CREATE request by said one of the user programs, placing in virtual storage managed by said VLF a copy of a particular data object having a particular minor name, said particular data object having been obtained by said one of the user programs from a containing data set having an associated major name;

C) comparing the associated major name with said ordered list of major names and setting an indicator in an existence table that said particular minor name does not identify any data object in any data set identified by any major name occurring earlier in said first data set search order than the associated major name;

D) in response to a RETRIEVE request for the particular minor name by a second one of the user programs, said second one of the user programs having a second data set search order;

providing a best data object, having the particular minor name, from said virtual storage managed by said VLF, said best data object being from a first known containing data set in said second data set search order, and further providing to said second one of the user programs a return indicator indicating either (a) that said best data object is a requested data object when said indicator indicates that the particular minor name does not identify any data object in any data set earlier in said second data set search order than the first known containing data set, or (b) that said best data object may possibly not be the requested data object when said indicator indicates that the particular minor name may possibly identify any data object in any data set earlier in said second data set search order than the first known containing data set; and

returning a "not available" indicator when no such best data object, having the particular minor name, exists in said virtual storage, managed by said VLF, from any containing data set in said second data set search order.

8. The method of claim 7, further comprising, after said steps of placing in virtual storage and storing existence information, the step of invalidating said copy of said particular data object if said particular data object is changed after said copy is placed in said virtual storage managed by said VLF.

9. The method of claim 8, further comprising the step of trimming older objects from said virtual storage managed by said VLF when an available amount of said virtual storage is less than an installation limit.