Method and apparatus for limiting data occupancy in a cache

• US 4,466,059 A
• Filed: 10/15/1981
• Issued: 08/14/1984
• Est. Priority Date: 10/15/1981
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Hartung, Michael H., Goldfeder, Marc E., Bastian, Arlon L.
• Primary Examiner(s): Smith, Jerry
• Assistant Examiner(s): Watson, Mark P.
• Application Number:
  US06/311,738
• Time in Patent Office: 1,034 Days
• Field of Search: 364/200 MS File, 364/900 MS File
• US Class Current: 711/122
• CPC Class Codes: G06F 12/0804 with main memory updating G06F12/0806 takes precedence
• CPC Class Codes: G06F 12/0866 for peripheral storage systems, e.g. disk cache

Abstract

A storage hierarchy has a backing store and a caching buffer store. During a series of accesses to the hierarchy by a user, writing data to the hierarchy results in data being selectively removed from the buffer store. Space in said buffer store not being allocated to data being written results in such data being written to the backing store to the exclusion of the buffer store. Removal of data increases the probability of writing data to the backing store. In a preferred implementation, the backing store is one or more disk type data storage apparatus and the buffer store is an electronic random access memory.

Claims

1. The method of operation a data storage hierarchy coupled to user units and having a backing store and a caching buffer store with means to store data in said buffer store based upon addressable storage areas of said backing store, both of said stores having a plurality of addressable storage areas;

including the steps of;

monitoring chained requests for access to said storage hierarchy received from said units;

setting a status bit based upon monitoring a predetermined type of said chained requests for access which indicates whether or not writing operations for the storage of data are included in the monitored chained requests; and

storing such written data in said backing store when said status bit has been set; and

removing data stored in said buffer store related to said written data from said buffer store whenever said status bit indicates a one of said given writing operations.

2. The method set forth in claim 1 further including the steps of:

in first operations in a first one of said chained requests writing first data to said buffer store and said backing store;

in second operations in a second one of said chained requests writing second data only to said backing store; and

setting said status bit when monitoring a one of said first or second chained requests to indicate said first or second operation as said given writing operation.

3. The method set forth in claim 1 including determining a completion of said monitoring said chained requests and then performing said removing step.

4. The method set forth in claim 3 further including the steps of:

receiving a sequential bit from said units for indicating that data accessed subsequent to the receipt of said sequential bit in said chained requests is sequentially processed data;

writing data subsequent to receipt of said sequential bit as said given writing operation; and

setting said status bit each time a said subsequent writing data step occurs for indicating occurrence of said given writing operation during said monitored chained requests.

5. The method set forth in claim 3 further including the steps of:

receiving predetermined requests for writing data during said chained requests including indicating in said received predetermined requests desired access to said backing store and never accessing said buffer store while writing data to said backing store subsequent to receiving each said predetermined request;

then writing data to said backing store and not writing data to said buffer store as said given writing operation; and

setting said status bit each time a said subsequent writing data step occurs.

6. The method set forth in claim 5 further including the steps of:

during predetermined ones of said chained requests writing data to said buffer store for updating data stored therein; and

effectively removing said updated data from said buffer store as said predetermined data.

7. The method set forth in claim 3 further including the steps of:

receiving from said user an indication that sequential data is being processed;

writing data to said buffer store after receiving said sequential data indication; and

removing said updated data in said buffer store which was updated subsequent to receiving said sequential indication bit as said predetermined data.

8. The method set forth in claim 3 further including updating data in said buffer store a plurality of times in a given addressable area;

and

effectively removing said updated data that was updated a plurality of times as said predetermined data.

9. The method set forth in any of claims 4, 5, 6, 7, or 8, inclusive, wherein said buffer store is an electronic random access memory and said backing store includes a plurality of addressable DASDs, further including the steps of:

addressing said storage hierarchy in accordance with the address of a given one of said DASDs; and

separately monitoring a series of requests for each of said addressable DASDs whereby the data in said cache is limited in accordance with the addressed DASD.

10. The method set forth in claims 4, 5, 6, 7, or 8, inclusive, further including the steps of:

receiving a plurality of read data access requests, moving data to said buffer store from said backing store in accordance with said read data requests whereby read requests tend to relate to data stored in said buffer store and write requests tend to relate to data stored only in said backing store.

11. The method set forth in claim 10 further including:

identifying a last storage area accessed in said chained requests; and

upon completion of said chained requests promoting data from said backing store last storage area to said buffer store only when predetermined write operations did not occur in said chained requests.

12. The method set within claim 11 further including comparing the contents of the last storage area accessed in a first one of said stores with the data contents of the corresponding storage area in a second one of said stores and moving data between said stores to create data congruence between said stores and if said predetermined write operation occurred, effectively erasing the data contents of a one of said last referenced or corresponding one of said storage areas.

13. The method of operating a data storage hierarchy having a backing store and a caching buffer store with means to store data in said buffer store based upon addressable storage areas of said backing store, both of said stores having a plurality of addressable storage areas;

including the steps of;

receiving data storage access requests from a user for reading and writing data from and to the storage hierarchy, respectively;

analyzing said writing data access requests, removing data from said buffer store in accordance with said write data analyzing; and

analyzing said read data access requests, moving data to said buffer store from said backing store in accordance with said read data analyzing whereby read requests tend to relate to data stored in said buffer store and write requests tend to relate to data stored only in said backing store.

14. The method set forth in claim 13 including receiving a request from a user for accessing said backing store to the exclusion of said buffer store;

and in response to said backing store exclusive access, deleting predetermined data from said buffer store that was altered in predetermined ones of said write access requests that were analyzed and inhibiting promotion of predetermined other data from said backing store to said buffer store.

15. The method of operating a data storage hierarchy having a backing store and a caching buffer store with means to store data in said buffer store based upon addressable storage areas of said backing store, both of said stores having a plurality of addressable storage areas;

including the steps of;

receiving data from a user to be written into said hierarchy at a given addressed area of said backing store;

examining said buffer store to determine whether or not an addressable area thereof has been allocated to said given addressed area of said backing store;

when said examining reveals an allocated addressable area, write said data in said buffer store to said allocated area;

when said examining reveals no allocated addressable area in said buffer relating to said given addressed area, write said data to said given addressed area;

monitoring each said write operation and setting a status bit indicating a predetermined one of said write operations, removing predetermined data stored in said buffer store to thereby increase writing data to said backing store;

receiving requests from said user for data stored in said storage hierarchy; and

moving data to said buffer store from said backing store in accordance with said received requests such that such requests for data tend to be responded to by supplying data to said user from said buffer store.

16. The method set forth in claim 15 further including the steps of:

within a given series of operations writing data to said buffer store and within the same series performing said monitoring step to set said status bit for write operations occurring during predetermined conditions indicating that the likelihood of reading the data from said buffer store is remote.

17. The method set forth in claim 15 wherein said condition is indicated by receiving a said request related directly to said backing store.

18. The method set forth in claim 15 wherein said conditions relate to receiving an indication from said user that data being processed is sequential data.

19. A data storage hierarchy having an adapter adapted to be connected to using units, comprising:

a cache store;

a backing store connected to said cache store;

communication paths connected to said adapter, said backing store and said cache for transferring data signals between said adapter, backing store and cache;

switching means coupled to said communications paths for selectively switching the communication paths between said adapter, said backing store, and said cache;

read hit means coupled to said communication paths for being responsive to predetermined ones of said data transfers from said cache to said adapter for promoting data from said backing store to said cache store to make said promoted data more readily available to said adapter;

directory means coupled to said cache and backing store for indicating data stored in said cache store as it relates to addressable areas of said backing store;

means coupled to said communications paths for monitoring writing operations which transfer data signals from said adapter to either said cache or backing store; and

means for erasing data within said backing store from said cache for limiting the contents of said cache store in response to said monitoring of said writing operations.

20. The apparatus set forth in claim 19 including means coupled to said adapter for indicating a series of related operations;

and

means operative during said series of related operations to tally write operations for indicating how to limit cache contents upon the conclusion of said series of related operations.

21. The apparatus set forth in claim 20 further including a plurality of access indicating means for indicating whether a backing store or cache is to be accessed on a given request and means responsive to a directory means indicating no contents in said cache store to set said indicator to access said backing store.

22. The apparatus as set forth in claim 21 wherein:

said cache store is an electronic random access memory means;

said backing store includes a plurality of addressable direct access storage devices;

one of said access indicating means being assigned to each of said direct access storage devices for independently controlling access to said devices or to said cache for any of said devices.

23. The apparatus as set forth in claim 22 further including a programmed processor means coupled to said access indicating means for sensing same and for setting same and including program means for monitoring said operations for setting a plurality of conditions for limiting said cache contents including indications of received sequential data, receiving commands related directly to said direct access storage devices and receiving a plurality of writes for a given storage area in said cache store.

24. The machine-implemented method of operating a peripheral data storage hierarchy coupled to a host processor for transferring data therewith in accordance with access requests received from said host processor and having a backing store and a buffer store with means to store data in said buffer store based upon addressable storage areas of said backing store, both of said stores have a plurality of addressable data storage areas;

including the automatic steps of;

monitoring a series of requests for access to said storage hierarchy received from said host processor and setting a status bit for indicating whether or not sequential data is being transferred;

analyzing said series of requests for predetermined writing and reading access characteristics;

promoting all of the data stored in a one of said data storage areas of said backing store having a predetermined address relationship to said analyzed series of requests to said buffer store when said predetermined reading access characteristics occur simultaneously to said sequential data indication;

if said indication does not indicate said sequential data transfer, inhibiting promotion of data stored in said one data storage area to said buffer store; and

deleting data from said cache having a predetermined relationship to said writing operations.

25. A data-storage hierarchy adapted to be connected to a using unit and having a backing store with a first plurality of addressable data storage areas and a buffer store with a second plurality of addressable data storage areas, data transfers means connected to said backing store and said buffer store and adapted to be connected to said using unit for transferring data signals therebetween, a digital processor connected to said backing store, said buffer store and said data transfer means to actuate said data transfer means for operating said data transfer means and said stores, said digital processor including stored program means for storing a plurality of control programs, said programs including in combination:

buffer access program means for enabling said digital processor to actuate said data transfer means for storing and fetching data in and from said buffer store based upon addresses of said addressable data storage areas of said backing store;

first program means for enabling said digital processor to monitor a series of requests for access to said storage hierarchy received from said using unit and for setting a status bit to indicate whether or not given data transfer operations occurred within said series of requests that wrote data received from said using unit into said data storage hierarchy; and

second program means for enabling said digital processor during any of said series of requests for access, which include writing data to said storage hierarchy, to actuate said data transfer means for storing such written data in said backing store, and for effectively removing predetermined data stored in said buffer store, related to said written data, from said buffer store whenever said indications indicate said given operation.

26. The data-storage hierarchy set forth in claim 25, further including in said stored program means, third program means, for enabling said digital processor during a first data transfer operation to actuate said data transfer means or writing said data to said buffer store and said backing store;

in a second operation for writing some data to said backing store only and for setting said status bit when monitoring a one of said first or second operation to indicate said first or second operation as said given operation.

27. The method of operating a data storage hierarchy coupled to user units and having a backing store and a caching buffer store with means to store data in said buffer store based upon addressable storage areas of said backing store, both of said stores having a plurality of addressable data storage areas;

including the steps of;

monitoring chained requests received from said units for access to said storage hierarchy;

setting a status bit based on receiving a specific one of said monitored requests for access in said chained requests which indicates whether or not specific writing operations for the storage of data in the data storage hierarchy are included in said chained requests; and

removing data stored in said buffer store related to said data to be stored when said status bit has been set; and

storing said data in said backing store.

28. The method set forth in claim 27 further including the steps of:

in a first received request monitored during said chained requests, writing first data to said buffer store and to said backing store;

in a second received request monitored during said chained requests, writing second data only to said backing store; and

setting said status bit as a result of monitoring one of said received requests and a chained request indicating said specific writing operation.

29. The method set forth in claim 28 wherein the step of removing data is performed after completion of said chained requests.

30. The method set forth in claim 27, further receiving a sequential bit from one of said user units setting said status bit after the step of receiving a sequential bit from said one user unit and in the step of storing said data storing sequentially processed data received subsequent to receipt of the sequential bit.

31. Performing the method set forth in claim 27 in apparatus wherein said caching buffer store is a volatile random access memory and said backing store includes at least one addressable nonvolatile direct access storage device.

32. The method of operating a data storage hierarchy having an adaptor for being connected to user units for a backing store and a caching buffer store with means to store data in said buffer store based upon addressable storage areas of said backing store, both of said stores having a plurality of addressable data storage areas;

including the steps of;

receiving chained data storage access requests from the adaptor for reading the writing data from and to the storage hierarchy with respect to the user units, respectively;

analyzing said received chained data storage access request for a writing data operation access request within such chained data storage;

removing data from said buffer store in accordance with the address in said backing store of the data to be written received during said analyzed writing data operation;

storing the data received with the write operation request only in said backing store; and

analyzing said chained data storage access requests for a read operation;

moving data to said buffer store from said backing store in accordance with the address in said backing store of the data to be accessed by the read operation request analyzed;

whereby read requests tend to be directed to said buffer store and write requests tend to be directed only to said backing store.

33. The method set forth in claim 32 wherein said write analyzing step further includes the step of inhibiting the moving of data from said backing store to said buffer store for addressable storage areas to those addressable storage areas other than the addressable storage areas receiving data during said write operations.

34. The method set forth in claim 32 or 33, including the steps of:

receiving a request from said adapter for accessing said backing store and for not accessing said buffer store;

in response to said received backing store exclusive access request, deleting data from said buffer store in accordance with the address of the received write operation request; and

inhibiting promotion of data stored in other addressable storage areas of said backing store from said backing store to said buffer store.

35. In the method of operating a data storage hierarchy connected to user units and having a backing store and a caching buffer store with means to store data in said buffer store based upon addressable storage areas of said backing store, both of said stores having a plurality of addressable storage areas;

including the steps of;

receiving chained data storage access requests from the user units for reading and writing data from and to the storage hierarchy, respectively;

receiving data from the user units to be written into said data storage hierarchy at a given addressed area of said backing store, said address being included with said receiving chained data storage write access request;

examining said buffer store to determine whether or not an addressable area thereof has been allocated to said given addressed area of said backing store;

when said examined buffer store area reveals an allocated addressable area, writing said data in said buffer store to said allocated area, otherwise writing said data to said given addressed area;

monitoring chained requests for access to said storage hierarchy received from said units;

setting a status bit based on a monitored specific request for access from said chained requests which indicates whether or not specific writing operations for the storage of data are included in the specific chained request;

removing data stored in said buffer store related to said data when said status bit has been set; and

storing said received data only in said backing store;

receiving requests from said user units for retrieving data stored in said storage hierarchy; and

moving data to said buffer store from said backing store in accordance with said received retrieve requests such that said received retrieve requests for data tend to be responded to by supplying data to said user units from said buffer store.