CACHE/DISK SYSTEM HAVING COMMAND SELECTION BASED ON DISK ACCESS TIME

Abstract: A cache/disk subsystem responsive to commands from one or more host processors. The cache/disk subsystem includes a cache memory and a plurality of disk drives with a command queue being provided for each disk drive for storing commands awaiting execution with respect to that disk drive. These awaiting commands may include both host processor commands and trickle (write-back) commands. If less than a predetermined number of commands are awaiting execution in a command queue, selection of the next command is based on command priority. If more, then selection is based on the command having the fastest access time to its corresponding disk space taking both seek time and rotational latency into account. Exceptions are made for a high priority command or a command which remains unselected too long.

Description: TITLE CACHE/DISK SYSTEM HAVING COMMAND SELECTION BASED ON DISK ACCESS TIME RELATED APPLICATIONS This application is related to the following commonly assigned U.S. patents and copending patent application, the disclosures of which are incorporated herein by reference: U.S. Patent No. 4,394,732, issued July 19, 1983 U.S. Patent No. 4,394,733, issued July 19, 1983 U.S. Patent No. 4,413,317 issued November 1, 1983 U.S. Patent No. 4,415,970, issued November 15, 1983 U.S. Patent No. 4,419,725, issued December 6, 1983 U.S. Patent No. 4,423,479, issued December 27, 1983 U.S. Patent No. 4,425,615, issued January 10, 1984 U.S. Patent No. 4,433,374, issued February 21, 1984 U.S. Patent No. 4,437,155, issued March 13, 1984 U.S. Patent No. 4,506,323, issued March 19, 1985 U.S. Patent No. 4,523,206, issued June 11, 1985 U.S. Patent No. 4,523,275, issued June 11, 1985 U.S. Patent No. 4,530,054, issued July 16, 1985 U.S. Patent No. 4,530,055, issued July 16, 1985 U.S. Patent No. 4,598,357, issued July 1, 1986 U.S. Patent Application Serial No. 354,558, filed March 3, 1982. .BACKGROUND This application relates to improved means and methods for poviding communication between one or more host processors and a plurality of disk drive devices. The above-mentioned patents and copending application disclose particularly advantageous embodiments for this purpose wherein one or more host processors are connected through one or more storage control units (SCU) to a cache store and a plurality of disk drive devices. The contents of the cache store are controlled so as to continuously • . contain data corresponding to disk spaces which are likely to be accessed in response to a disk command issued by a host processor. Since the cache store can be accessed in a small fraction of the time ifwould take to access the disk, a very significant speed improvement is realized. In the particular embodiments disclosed in the aforementioned patents and application, data is stored in the cache store as a plurality of segments. A command (read or write) from a host processor is interpreted b y the storage control unit which first checks a segment descriptor- table (SDT) to determine whether a copy of the data stored in the specified disk space is resident in the cache store. The SDT has an entry therein for each segment of data in the cache store. If the SCU finds that a copy from the specified disk space is resident in the cache store (a "hit"), then the SCU controls the transfer of the data from/ o the host processor to/from the cache store. If the transfer is from the host processor to the cache store (write), the SCU sets a "written-to" (WT) bit in the SDT entry or entries corresponding to the segment or segments into which the data is written. The WT bit, when set, indicates that the data in the corresponding segmen " in cache store has not been written to its specified disk space. If the SCU interprets a host processor command and finds that all required segments of the data from the specified disk space are not resident in the cache store (a "miss"), then, if the disk drive device containing the specified disk space is not busy, the required segments are accessed therefrom and stored in the cache store. However, if the disk drive device containing the specified disk space is busy, then the SCU forms a command and places it in a command queue for each disk drive device and each queue stores the commands waiting to be executed by its associated disk. These queues may also store "trickle" commands which are formed, during idle time of the SCU for use in "trickling" "written-to" (WT) segments in the cache store to their specified disk spaces. When a queued command becomes the highest priority command in its command queue, it is removed from the queue and executed. If a plurality of queued commands in a command queue are at the highest priority level, then the one which has been in the queue the longest is selected for execution. ? The above described disk/cache subsystem provides a very significant improvement in the effective speed of' data transfer between a disk drive device and a host processor. However, this speed advantage can be detrimentally affected in host/disk-drive data transfer situations which cause relatively high numbers of commands requiring disk access to be stored in one or more command queues awaiting execution. In such a case, the execution of these queued commands can result in significant time being spent in accessing the specified disk spaces on the disk drive devices, thereby reducing the overall transfer rate. This will be appreciated by noting that, for each access of a selected disk space, a read/write operation not only has to wait for the head to be positioned to the selected cylinder (seek operation), but also " has to wait until the selected disk space rotates under the head (rotational latency) . BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a block diagram of a cache/disk system; FIG. 2 shows the format of a segment descriptor table entry; FIG. 3 illustrates a command queue; FIG. 4 illustrates the format of entries in a timestamp table; FIG. 5 is a flow diagram illustrating the Idle routine; FIG. 6 is a flow diagram illustrating the Service Command Queue routine; FIG. 7 is a diagram illustrating the Cache Breakout routine; FIGS. 8A and 8B comprise a flow diagram illustrating the Start Trickle routine; FIG. 9 illustrates the format of a roll table entry; FIGS. 10A and 10B comprise a flow diagram illustrating the Trickle Write routine; FIGS. 11A-11I comprise a flow diagram illustrating the Check Trickle subroutine; FIGS. 12A-12D comprise a flow diagram illustrating the Check Command Queue subroutine; FIGS. 13A and 13B comprise a flow diagram illustrating the Find Command Queue Entry subroutine; FIGS. 14A-14F comprise a flow diagram illustrating the Update TACK/WT subroutine; FIGS. 15A-15E comprise a flow diagram illustrating the Add/Delete Timestamp subroutine; FIGS. 16A and 16B comprise a flow diagram illustrating the Determine Trickle Priority subroutine; FIG. 17 is a flow diagram illustrating the Read Utility routine; and FIG. 18 is a series of graphs illustrating a portion of the Find Command Queue subroutine. DETAILED DESCRIPTION Fig. 1 is a block diagram of a cache/dis}« system of the type described in U.S. Patent application Serial No. 207,152 iled. November 14,- 1980. The system as illustrated in Fig. 1 includes a storage control unit 100 for interfacing a plurality of. host processors or channels 102 with a cache memory 106 and a bulk memory illustrated as a plurality of disk drive devices 104. Fig. 1 is not intended to fully illustrate the cache/disk system but is provided so that the reader may more easily follow the programs subsequently described. It will be understood that a complete system may have an additional storage control unit serving additional host " processors, with the storage control units having a full complement of registers as shown in Application Serial No. 207,152. The storage control unit (SCU) 100 includes channel interface circuits 108, device interface circuits 110 and control interface circuits 112 for interfacing the SCU with the host processor (hosts) , the disk drive devices and the cache memory, respectively. A BD Bus 114 is the primary data transfer bus used for transferring information between the hosts 102, the disk drive devices 104 and the cache memory 106 via the channel interface circuits 108, the device interface circuits 110 and the control interface circuits 112. The SCU is provided with a control store (CS) 116 for storing the microprogram for the SCU as well as some of the variables and constants utilized as the program is executed. Control store 116 is addressed by addressing circuits 118 under the control of a program count register PC and an index register IX. In addition, a pushdown data stack DS is provided for saving the return addresses of calling routines during the execution of subroutines. The addressing circuits 118 address the control store 116 to read instructions out to an instruction decoding and control circuit 120. The circuit 120 decodes the. " instructions it receives, selects the source or sources of data to be operated on, the destination of the result, controls branching operations and otherwise generally issues to the various elements of the storage control unit those signals necessary for executing a given instruction. The SCU includes a plurality of addressable registers designated GA-GG, OP, ST, BX and HR all connected to a source bus designated the Extended A Bus and a destination bus designated the D Bus. Register HR is a double-width register comprising two separately addressable single length registers HL and HH. HR is the primary working register for the SCU and any data fetched from control store 116 passes through HR. Data may of course be transferred from the control- store 116 to other elements connected to the BD bus. Registers GA-GG are general purpose registers which may serve as a source of information, a destination, or both. That is, a value in one of the registers GA-GG may be read out .to an arithmetic logic unit (ALU) 122, modified therein by data applied to the ALU from the Extended A Bus through a byte swapper 124, an the result returned to the same register or a different register through a right shifter circuit 126 and the D Bus. The byte swapper 124 is selectively controlled by the instruction decoder 120 to switch the two low order bytes of a word received from the Extended A Bus to the- high order byte positions or vice versa. The right shift circuit 126 is also under control of the instruction decoder 120 and may pass data from the ALU to the D Bus without shift or with a shift of 1 bit to the right. The OP register is a bit test register while the ST register is the status register. The BX .register is an addressing register used for addressing a staging buffer (SB) 128. The staging buffer 128 actually comprises two 8k staging buffers for holding segments of data as well as copies of certain variables read from the cache memory and utilized during various operations. The cache memory 106 has one section for storing segments of data (1792 words per.segment) and a random access memory (RAM) section for storing a segment descriptor table and various other global variables. The SDT and the global variables must be maintained in the memory 106 since the memory may be connected to another storage control unit like SCU 100, this additional storage control unit also interfacing further host processors and disk drive devices. The cache memory is constructed of MOSFET devices and is provided with a battery pack or uninterruptable power SU pply which will maintain the cache memory operative for some predetermined time, say fifteen minutes, in . the event the AC power supply for the cache memory should fail. The segment descriptor table (SDT) contains an entry for each segment of data resident in the cache memory 106. When a host 102 wishes to obtain data from one of the disk drives 104 it sends- a command to the SCU 100. The SCU 100 brings the SDT from cache 106 to the staging buffer 128 and determines if the desired data is resident in the cache memory. If it is, the data is then sent to the requesting host 102 from the cache memory 106 under the control of the storage control unit 100. If the requested data is not resident in cache then it must be obtained from one of the disk drive devices 104. The SCU 100 makes a determination of whether or not the disk drive device (hereinafter referred to as device) is.-on line and not busy. If the device is on line and not busy the . SCU 100 controls the transfer of the segment or segments containing the desired data from the device to the cache memory 106 and sends the desired data to the requesting host 102. If the device holding the desired data is - busy, the SCU forms a command queue entry and enters it into a command queue in the staging buffer 128. There is one command queue for " each device 104. The updated command queue is returned to the RAM portion of cache memory 106 and the host is informed that it must again address the data at a later time. W hen the device 104 finishes the job it is working on it notifies the SCU and the SCU again brings the command queue from cache memory 106 to the- staging buffer where it determines which command in the comman d queue for the device has the highest priority and controls the execution of. this command. Eventually, the comman d which was stored- in the command queue will be executed and the data staged from the device 104 to the cache memory 106. Later, when the host 102 reissues its command for the data the storage control unit d etermines that it is present in. the cache memory and sends the data from the cache memory to the requesting host via the BD Bus and the channel interface circuits 108. A similar procedure is employed if one of the hosts 102 wishes to write data to one of the devices 104. If the addresses to be written-to are included in the segments stored in cache 106 the data from the -host is written to the cache memory and not to the device 10 4 . A n in d icator is set in the SDT entry or entries corres p on d ing to the segment or segments written-to and the segments are written from the cache memory to the device 104 at some later time more convenient for the SCU 100. If the segment -or segments to be written-to are not resident in the cache memory and the device is busy, the command is queued on the command queue for that device and executed at some later time determined by its priority in order to bring the desired segments from the disk drive device.104 to the cache 106. Later, after the queued command is executed and the disk drive device signals that it has completed a seek operation, the host 102 wishing to make the write operation again issues the write command and at this time the storage control unit brings the segment or -segments into staging buffer 128, overlays them with the data from the host, and returns the modified segment or segments to the cache memory 106. As explained in the aforementioned Applications Serial Nos.- 207,097 and 207,152, when a ne segment or segments has to be brought from a device 104 to the cache memory 106 and there are no empty segments in the cache memory 106 then some of the segments resident in the cache memory 106 must be deleted or removed therefrom.in order to make room for the new segments. To accomplish this, each segment descriptor table entry is provided with a backward age link relative address and a forward age link relative address so that the segment descriptor table entries are linked from the least recently used (LRU) to the most recently used (MRU) . The least recently used segment or segments are determined from .the SDT. The new segment or segments are staged from devices 104 to the cache memory 106 to write over the LRU segments resident therein. This creates no problem where a segment being written over was not written to while resident in the cache memory since there is already a copy of the segment on one of the disks. However, where an LRU segment has been written to by a host processor while resident in the cache memory this segment must be destaged tα-one of the disk drive devices 104 before its segment space in the cache memory may be written over by the new segment. As further explained in the aforementioned applications, when the SCU 100 has no other work to do it may search the SDT to locate segments which have been written to and trickle these segments to the devices 104 thus making space available in cache 106 for additional segments. The trickling of written-to segments takes place on the same basis as segment replacement, that is, the least ' recently used segments are trickled first with the least recently used being determined from the forward and backward age links in each SDT entry. • FIG. 2 illustrates the segment descriptor table (SDT). Each SDT entry comprises four words. There is one entry in the SDT table for each segment resident in the cache memory 106. The GFTR and LFTR bit is set when the corresponding segment is a global or a local "floater" segment, i.e., one which cannot be written to a disk drive device because the device has a bad disk. However, these differences are not relevant to the present invention. The mnemonics to the left of the word formats in FIG. 2 identify both the SDT word and its location in staging buffer 128 when the SDT is moved thereto. In SBSDT1 the host ID field identifies the host that last issued a command to the associated cache segment. The device number field identifies one of the disk devices 104 and the- ' segment device relative address field is a number which represents the segment offset (relative number from the first segment) of data on a disk. In SBSDT2, bit 0 is the VALID DATA bit which indicates whether or not the segment in cache associated with this SDT entry contains valid data. The TACK bit indicates whether or not the associated cache segment space in cache memory 106 is reserved for data that will be transferred thereto either"from the host or from a disk. Bit 2 of SBSDT2 is the "written- to" indicator which indicates whether or not the associated cache segment has.been written to by the host and the written-to segment not yet destaged to the disk. The other fields of SBSDT2 are not relevant to the present invention. In SBSDT3 bit 0 is the last backward age link (LBAL) bit and when set indicates that this SDT entry is the last in the backward age link. The backward age link relative address points to the next SDT entry with" the backward age link relative addresses linking all of the segments from most recently used to the least recently used. Bit 16 is the last forward age link (LFAL) bit and when set indicates that .this entry is the last entry in the forward age link. The forward age link relative address field is the relative address of the next entry in the forward age link. The forward age link relative- address fields in all of- the SDT entries link all of the segments from least recently used to most recently used. - In a typical system, the cache memory 106 may be capable of storing 8k segments of data in which case there are 8k SDT entries each having four words as shown in Fig. 2. Fig. 3 illustrates one command σueue. There is one command queue for each of the devices 104. Each command queue includes two header words and up to seven entries with each entry having three words. The first word of.the command queue header (SBCMDQ when located in the staging buffer) includes fields DB, NCQ, device number and next sequence number. DB is an indicator bit which is set when the device associated with this command queue is busy. NCQ indicates the number of commands presently queued in this queue. The device number identifies the device 104 with which this command queue is associated. The next sequence number field contains the sequence number that is to be inserted in the next command entry made in the queue. This number starts at zero, is incremented until it reaches 255, and then wraps back around to zero. The second word of the command queue header (SBCMQH) has an active command request number field which represents the request number of the command currently being executed. The seek in progress request number field is used in conjunction with the invalid entry (IV) bit. When IV = 1 it indicates that no seek is in progress. When IV = 0 the request number is the number of the command with a seek in progress. One command queue slot is reserved for each request number. Each slot stores a three word command queue entry. The first word of a command queue entry (SBCMQ1) has a host ID field identifying the host that issued the command, a full bit (FL) indicating whether or not the slot contains a command, a priority field and a sequence number field indicating the relative sequence in which the command was received from the host. A priority value of 0 indicates the highest priority and the value 7 represents the lowest priority. As in the aforementioned patents and application, provision is made for selecting a command for execution based on its priority and sequence number. In accordance with the present invention, provision is also made for selecting a command on a different basis such that, when certain circumstances are present, disk access time is taken into account in making the selection. The SCQ bit indicates that the command has been queued and was selected for execution by the Idle Loop (service command queue) routine. The allhits bit (AHT) indicates that all of the data necessary for execution of this command is resident in the cache memory. The trickle bit (TRK) identifies a command as a trickle command. The other fields of SBCMQ1 are not relevant to an understanding of the present invention. The second word of a command queue entry (SBCQT2) has an NSEG field representing the number of segments to be transferred for this command and a segment device relative address field (SDRA). The SDRA field identifies the starting segment address of the first word of a transfer. This address is derived from the relative wor,d address field provided in a command from the host. The third word of a command queue entry (SBCFQ3) includes a user's file number field which is not utilized in the present invention. A host 102 issues a read or a write command which comprises five words. The fifth word is a 32-bit word comprising a timestamp indicating the time at which the command was issued. According to one aspect of the preferred embodiment, this timestamp is used to assign increasingly higher priority to queued trickle commands in the command queue to thereby reduce the time that a segment remains in cache after it has been written-to. In accordance with another aspect of this embodiment the timestamp for the oldest written-to segment (TOLDEST) is always saved at a specific location in the RAM. It is periodically sampled by a Read command from the host processor so that the host processor at all times has a fairly up-to-date indication of what segments in the cache memory have been written to but not destaged to the disks. If a failure should occur in the cache memory, the host processor may then determine from its last reading of TOLDEST exactly what procedures must be employed to recover from the failure. As each command is received by •the SCU from a host processor, its timestamp is stored in a location reserved for the current timestamp (TCURRENT) , replacing any timestamp therein. In addition, a timestamp table is maintained, this table having an entry corresponding to each entry in the SDT. When a segment is first written-to the timestamp passed with the host write command is saved in the timestamp table. ' Subsequent writes to a written-to segment do not alter the timestamp in the table. When a segment is trickled its timestamp entry in the timestamp table is cleared. Thus, each written-to-cache segment is timestamped with the time of the first write since it was . last written to disk. As subsequently used herein, a written-to segment is, by definition, a segment that has been written-to by a host processor but has not been returned to its disk since the write operation took place. FIG. 4 illustrates the timestamp table. The timestamp table has a slot corresponding to each segment in the cache memory. An entry is made in a slot the first time the segment is written to in response to a write command from the host processor. Each entry in this table comprises two words hence the details of two entries are shown in FIG. 4. The first word of each entry in the timestamp table is the timestamp. This is obtained from the write command issued by the host. The entries in the timestamp table - are linked in a FIFO list. Word 2 of each entry includes a backward link address and a forward link address for linking the entries from the oldest written-to to the newest written-to. Bit 0 is set if the entry is the last backward entry in the list (i.e., oldest written-to) while bit 16 is set if the entry is the last forward (i.e., newest written-to) entry in the list. The WS and BT bits are not utilized in"the present invention. The timestamp table is normally stored in the RAM portion of cache memory 106 and selected entries from the table are brought to the staging buffer 128 for use. The entries which are brought to the staging buffer may be the current entry corresponding to the segment being written to or the entry being deleted because the corresponding segment has been replaced in the cache memory. The current entry or delete entry, is stored in the staging buffer 128 at locations SBTSl and SBTS2. In some cases it may also be necessary to bring the next entry or the previous entry (relative to the current or delete entry) into the staging buffer and if the previous entry or the current entry is brought to the staging buffer it is placed in locations SBTS3 and SBTS4. It should be understood that the SDT of Fig. 2 and the command queues, one of which is illustrated in Fig. 3, are also normally stored in the RAM portion of cache memory 106 and are brought to the staging buffer 128 for use. The mnemonics given at the left of Figs. 2 and 3 are those assigned when the associated words are resident in the staging buffer. From the staging buffer individual words may be fetched to the HR register for use or modification. Variables stored in the control store 116 may also be fetched to HR for use and modification. In the following program description where the term fetch is used and the variable fetched has a mnemonic beginning with SB as, for example SBCMDQ, it will be understood that the variable is fetched from the staging buffer. If the mnemonic does not begin with the letters SB then the fetching operation is from the control store 116. " IDLE LOOP When the SCU 100 of Fig. 1 completes an operation it returns to an idle loop as illustrated in Fig. 5 where is looks for the next operation to be performed. As indicated generally at step 500, the SCU checks at the channel interface circuits 108 to see if a host is issuing a command and then checks at the device interface circuits 110 to see if one of the devices 104 has completed a seek operation and is ready to transfer data to the SCU. If any of these operations are to be performed a branch is taken from the idle loop at step 500 to perform the required operation. After the operation is completed the program returns to the start of the idle loop and again moves to step 500. If, at step 500 the program does not find that a host or a device wishes to communicate with the SCU, it proceeds to step 502 where a-Check Command Queue subroutine (Figs. 12A-12D) is called. As subsequently explained, the Check Command Queue subroutine sequentially reads the first word of each command queue header, starting at the next in priority, until it finds a non-busy device with a command queued against it. If the subroutine finds a command to be executed in one of the queues it returns to the idle loop with the value 8000 in GA and the command queue in the staging buffer. If there are no commands queued for any of the devices the Check Command Queue subroutine returns to the idle loop with the value 0 in GA. At step 504 GA is tested and if it contains the value 8000 the idle loop branches to the service command queue routine shown in Fig. 6. All 4-digit 5 values used in this specification are hexadecimal values unless otherwise indicated. If the test of GA at step 504 indicates that there are no queued commands then the program again checks the interfaces (steps not shown) to see if a 10 host or a device wishes to communicate with the SCU. If they do then the idle loop branches to perform the required operation in the same manner as for step 500. If there is still no work to be done the idle loop proceeds to step 506 where it calls a Check 5 Trickle subroutine. This subroutine, illustrated in Figs. 11A-11I, searches for trickle candidates or segments which have been written to while residing in cache by following the timestamp links (Fig. 4) starting from the oldest such segment. If a trickle 0 candidate is found, a trickle entry is built and entered in the command queue for the corresponding device and the command queue returned to the RAM. After this has been done the subroutine returns to the idle loop and, since this is the last operation 5 performed in the idle loop a return is made to the beginning of the idle loop. More than.one trickle command may be built during execution of the Check Trickle subroutine but only one trickle command- is ever generated for any given command queue. It should be noted that the Check Trickle subroutine. erely places the generated trickle command, if any, in the command queue for the associated device 104. It does not execute the command. Eventually, when the idle loop is being executed it will, at step 502 find this trickle command in the command queue and then proceed to execute it at that time. If the test of GA at step 504 indicates that the Check Command Queue subroutine found a queued command waiting to be executed, either a trickle command or a command entered in queue as a result of a read or write command from a host processor, the idle loop branches to the Service Command Queue routine. SERVICE COMMAND QUEUE Briefly, the Service Command Queue routine (FIG. 6) calls a Find Command Queue Entry subroutine to get the next command queue entry to be executed frcm the command queue in the staging buffer. This command queue is the one left in the staging buffer by the Check Command Queue subroutine at step 502. The Find Command Queue Entry subroutine then selects the disk and transfers control to the Cache Breakout routine. As illustrated in Fig. 6, the Service Command Queue routine begins by executing a Get Global Variables subroutine to bring the global variables from the RAM portion of the cache memory to the staging buffer. The global -variables include such values as the addresses of the least recently used and most . recently used segments, the addresses of the newest and oldest timestamp entries in the timestamp table, a mask word containing an indicator bit for each device indicated whether or not a trickle command is pending for the device, and many other variables as subsequently described. Upon return from the Get Global Variables subroutine step 602 is executed to load a flag value into GA. This flag value is used to tell the Find Command Queue Entry subroutine about to be called that the subroutine is to find the next to be executed command in the command queue. The Find Command Queue Entry subroutine (Figs. 13A-13B) is executed at step 604 and, as subsequently described, this subroutine returns to the calling routine with an indication in GA as to whether or not it found a command for execution. The value in GA is tested at step 606 and if a command was not found for execution the program proceeds to step 608 where -a subroutine is executed to release the SDT. A return is then made to the idle loop. If the test at step 606 indicates that the Find Command Queue Entry subroutine found a command for execution, the program proceeds to step 610 where the device address in STSXDA is fetched. This device address was placed in the control store 116 during execution of the Check Command Queue subroutine at step 502. Next, PERMOO, the base address of a permanent storage area for the devices, is fetched and loaded into GB. This permanent storage area. includes for each device the physical identification of the logical device address, current seek address, and other information not relevant to the present invention. As a last operation in step 610, the base address (ADRCNV) of an address conversion table is entered into the IX registeri In step 612, the device address is added to ADRCNV to index into the table and obtain a bit significant device address, that is, an address having a single binary 1 bit therein, the location of the bit in the word designating the address of the device. The bit significant device address (BSDA) obtained from the table is used in step 614 to adjust the permanent pointer to the device and the result is stored at location BSDA in the control store. The Service • Command Queue routine then proceeds .to the Cache Breakout routine. CACHE BREAKOUT The Cache Breakout routine (Fig. 7) begins at step 700 by fetching the request number of the command which is stored in the control store at STSXRN. . This request number was derived .from word 1 of the command queue entry found at step * - 604. The request number is multiplied by three to obtain the offset into the command queue for the current entry. This value is then added to the base address of the command queue and the result saved. At step 702 CMDQ1 is fetched from the control store. CMDQ1 is a control store copy of the first word of a command queue entry and was placed in the control store during execution of the Find Command Queue Entry subroutine at step 604. At step 704 the SCQ bit of CMDQl is tested to see if the command queue entry found at step 604 is a trickl-e command. If it is, then a branch is taken to the Start Trickle routine subsequently described. If the Cache Breakout routine is entered from some routine other than the Service Command Queue routine or if the command queue entry found at step 604 is not a trickle command, the test at step 704 proves false. At step 706 the global variables are brought from cache to the staging buffer and at step 708 the channel command timestamp stored at CEF5 of the control store is fetched and saved at GA and GB. The current timestamp SBGTSC is fetched from the staging buffer and the channel command timestamp subtracted therefrom. If SBGTSC is greater than the timestamp stored at CEF5 this condition is detected at step 712 and step 714 is bypassed. On the other hand, if the channel command timestamp is greater than SBGTSC then the channel command timestamp becomes the current timestamp and is stored at SBGTSC. After step 714 is executed the Cache Breakout routine analyzes the current command and determines what operations should be performed- to carry out the command. After these operations are completed the program returns again to the beginning of the idle loop in Fig. 5. The operations subsequent to step 714 are not relevant to the present invention. If the test of ' SCQ at step 704 shows that this bit is set, it means that this command was entered into the command queue as a result of the Check Trickle subroutine (step 506) having found a segment to trickle. In this case a branch is taken at step 704 to the Start Trickle routine. START TRICKLE The Start Trickle routine (Figs. 8A and 8B) is executed only when the Cache Breakout routine finds that a trickle command is the highest priority command in the command queue. It builds a roll table entry for the operation, selects the disk drive, and starts a seek operation. For a fixed head disk drive device an exit is taken to the Trickle Write routine to accomplish the actual trickling of one segment of data from the cache memory 106 to the specified device 104. If the trickle command is for a movable head disk drive device then the global variables are returned to cache memory 106, CMDQ1 cleared in the control store, and a return made to the idle loop to look for more work to be done while the movable head device is accomplishing the seek operation. The Start Trickle routine begins at step 800 by fetching the device address STSXDA and the base address SBTSKA of a table of trickle candidates. This table has an entry for each device, the entry containing the SDT address of the segment waiting to be trickled out for that particular device! The entries are made in the table during execution of the Check Trickle subroutine at step 506. The device address is added to the table base address and the table accessed at step 802 to obtain the SDT address of the SDT entry associated with the segment to be trickled. This SDT address is fetched to the HR register and also saved at some convenient location in the control store 116. At step 804 a roll table entry like that shown in Fig. 9 is built using the SDT address obtained from the table. The VALID and OCCUPIED bits are set and the roll table entry thus formed is stored in control store 116 at ROLTAB, the base address of the roll table. The next entry in the roll table is ' cleared to indicate the end of the table and -the value 1 is set into ROLLNR in the control store 116 to indicate that only one segment is to be rolled out from the cache to the device 104. The use of ROLLNR and a roll table entry to control the transfer of one or more segments from the cache memory to a disk device is explained in Applications Serial Nos. 207,097 and 207,152 and does not, per se, constitute part of the present invention. At step 806 the second word of the command queue entry is fetched in order to obtain the segment device relative address which is then stored in the control store at FMSDRA. The BSDA stored in the control store at step 614 is fetched at step 808 and ORed with an SDT restore flag byte. This provides-an indication to a recovery module that the roll table has been built and an SDT entry altered. The result is returned to the staging buffer at the location reserved for the SDT restore flag byte SBRSDT. At this point the storage control unit-is ready to begin the transfer operation. At step 812 the device address is fetched from STSXDA and a call made to a subroutine at 814 to select the drive indicated by the device address. Next, a call is made to a Start Seek subroutine 816 to initiate a seek operation for the selected device. At 818 a subroutine is called to put the roll table in the staging buffer back into the RAM portion of cache memory 106. At step 820 a recovery status word RECVST is fetched from the control store and updated to indicate that the roll table has been returned to the RAM. At step 822 a subroutine is called to put the command queue in the staging buffer back in the RAM. The next operation is determined by bit 5 of the ST register. If bit 5 is set it means that the disk drive device is a fixed head device. In this case, there is no need to wait for the device to seek the desired location for the data transfer. Therefore, if the test at step 824 proves true the program branches to the Trickle Write routine. If the test at step 824 indicates that the device is of the type having movable heads, the SCU proceeds to do other work while the head is being positioned. At step 826 the global variables in the staging buffer are returned to the RAM portion of the cache memory 106 and at step 828 the copy of the first word of the command queue entry in the control store (CMDQ1) is cleared. The program then returns to the idle loop of Fig. 5 to look for more work to do. Eventually, the disk device will locate the desired data and send an interrupt to the SCU. The interrupt processing module (not shown) will determine that the interrupt is for execution of a trickle command and will branch to the Trickle Write routine after placing the appropriate command queue in the staging buffer and the device number in STSXDA. TRICKLE WRITE As illustrated in Figs. 10A and 10B, the Trickle Write routine begins by fetching the first two words of the command queue entry from the staging buffer and storing them in the control store at CMDQl and CMDQ2. The EF2 bit in the first word is set before the word is stored in CMDQ1. At step 1002 a subroutine is called to bring the roll table from the RAM to the staging buffer. Next, a subroutine is called to put the- global variables in the staging .buffer back into the RAM. The storage control unit is now ready to trickle one segment of data from the cache to the selected disk device. A Cache-to-Disk subroutine is called at step 1006 to accomplish the actual transfer. After the transfer is completed, a Control Unit Device Interface (CUDI) subroutine is called at step 1008 to release the- disk drive device which received the segment of data. At step 1010 the global variables are again brought from the RAM to the staging buffer. At step 1012 the number of the device involved in the transfer is fetched from the control store and entered in GD. A subroutine is then called to get the command queue in the RAM and bring it into the staging buffer. At step 1016 the value 4000 is entered into GA as an input parameter for.a subroutine which updates the SDT. The update SDT subroutine 1018 is then executed and because of the value in GA this subroutine will reset the WT bit in word 2 of the SDT entry associated with the segment just transferred. The timestamp entry will be deleted when WT is cleared. A Delete Command Queue subroutine is called at step 1020 to delete from the command queue the trickle command which has just been executed. The first header word of the command queue is fetched at step 1022 and the Device Busy bit " reset. The header word is then returned to its location in the staging buffer. Next, a Put Command Queue subroutine is called to put the command queue in the staging buffer back in the RAM. At step 1026 the binary significant device address is fetched, inverted, and stored in GA. SBRSDT is a word containing a flag for each device indicating whether " or not the SDT should be restored. At step 1028 SBRSDT is ANDed with the value in GA and the result returned to the staging buffer at the location reserved for SBRSDT. SBGTCQ is a binary significant device address mask of the command queues with trickle commands pending. At step 1030 it is fetched from the staging buffer, ANDed with GA to reset the flag for the device just used in the trickle operation, and the updated word is returned to the staging buffer. Next, the Skip Trickle flag should be reset if SBGSAT points to the entry just trickled. At step 1032 the device address (STSXDA) and the base address (SBTKSA) of the table of SDT addresses for segments waiting to be trickled are both fetched and the table is accessed for the entry corresponding to the device just used in the trickle operation. The address thus obtained from the table is right-shifted to obtain the corresponding timestamp table entry address and this is saved at GB. The trickle SDT address from the table is then nulled (set to all ones) and the result returned to the table. At step 1036 the SDT address used for the trickle operation (SBGSAT) is fetched, and compared with the timestamp table entry address in GB. If they are not equal the program proceeds- from step 1038 directly to step 1042. If they are equal, SBGTSK, the relative SDT address of the first written-to segment skipped by the Check Trickle subroutine because a trickle command could not be built for it, is fetched, reset, and then restored to the staging buffer. The program then proceeds to step 1042 where a subroutine is called to put the global variables back in the RAM. CMDQ1 is then cleared before the Trickle Write routine branches to the idle loop. CHECK TRICKLE The Check Trickle subroutine searches for candidates for trickling, that is segments which have been written-to while residing in cache. These segments are identified by having the WT bit set in the second word of the corresponding SDT entry. The search is made by following the timestamp link starting from the oldest segment in the link. When a trickle 10 . candidate is found, a trickle command is built in the command queue for the corresponding device. The su b routine may build more than one trickle command each time it is called but it will not build a trickle command for any command queue which already has a 15 trickle command pending in it. The subroutine continues until one of the following conditions occurs: 1 ) All on-line devices have a trickle command in their command queue. 20 2 ) A device or a host provides an indication to the SCU that it needs servicing. In searching for trickle candidates, the SDT entries h aving the TACK bit set in word 2 are bypassed as candi d ates for trickling even though the WT bit may 25 be set. A lso, any SDT entry for a device which already has a trickle command in its command queue is not consi d ere d a candidate for trickling. In all of the a b ove cases the next" trickle start address global area ( S BGSAT) is updated so that when Check Trickle is 30 invoked the next time the search will start from this point. A fter the Check Trickle subroutine is started if it is found that the inhibit-trickle flag is on in the subsystem state bits SBGSTA, or all on- 35 line d evices have a Trickle command pending, or the num b er of written-to segments in cache is zero, the Check Trickle subroutine is terminated. As illustrated in Fig. 11A, the Check Trickle subroutine begins at step 1-100 by bringing the global variables from the RAM to ' the staging buffer. A check is then made to see if there are any device interrupts and if there are the subroutine exits to process the interrupt. If there are no interrupts pending then at step 1106 the subsystem state bits are checked to see if the inhibit trickle bit is set. If it is, the subroutine branches to Fig. 11G where the RAM status word RAMST is fetched from the control store, updated to indicate that the global variables are in RAM, and restored at RAMST in the control store. At step 1110 a subroutine is called to release the SDT/cache. When "this subroutine is completed the check trickle subroutine returns to the idle loop of Fig. 5. Returning to Fig. 11A, if the test at step 1108 indicates that the inhibit trickle bit is not set the program proceeds to step 1111 where it fetches SBGWTS from the staging buffer. This word indicates the number of written-to. segments in cache. It is tested at step 1112 and if there are no written-to segments in cache the program proceeds to Fig. 11G and then returns to the idle loop as previously described. If the test at step 1112 indicates that there is at least one written-to segment in cache the program proceeds to step 1113 where i fetches SBGTCQ. This word contains a bit for each device and the bit is set if the command queue for the corresponding device has a trickle command pending. SBGONL is then fetched. This word contains a bit for each device and a bit is set if the corresponding device is on-line. At step 1114 SBGONL is compared with SBGTCQ to see if all command queues have at least one trickle command pending. If they do, a branch is taken to Fig. 11G and then a = 30 - return made to the idle loop as previously explained. If the test at step 1114 indicates that there is at least one on-line device which does not have a trickle command pending in its command queue, the program proceeds to step 1115 where SBGTSK is fetched. This word is the relative SDT address of the first written-to segment previously skipped during a prior execution of the Check Trickle subroutine because the device was busy or could not be serviced. At step 1116 SBGTSK is ANDed with the value 8000 to see if the skipped flag in the high order position of SBGTSK is set. If the skipped flag is " off, the search is started from the oldest timestamp entry. A branch is taken to step 1117 where SBLRTS is fetched from the staging buffer. If the skipped flag is not off. at step 1116 then the search is started from SBGSAT. This is the SDT address used for- trickling. At step 1118 the skipped flag is reset and SBGSAT is fetched from the staging buffer. At step 1119 either SBGSAT from step 1118 or SBLRTS from step 1117 is saved in the control store as the trickle search start address. In Fig. 11B, the trickle search start address is fetched and ANDed with the value 8000 at step 1121 to see if the last forward link or entry in the timestamp table (Fig. 4) has been reached. If LFL is set then the newest entry link in the timestamp table has been reached and no further searching is required. A branch is taken to step 1122 where the skip trickle flag in SBGTSK is reset. The program then branches to Fig. 11F where a subroutine is executed to put the global variables in the staging buffer back into the RAM. A return is then made to the idle loop. Returning to Fig. 11B, if the test at step 1121 indicates that the last forward link has not been reached the starting address fetched at step 1120 is masked to obtain the forward link address which is then stored in GE as the relative timestamp address. The base address of the timestamp table in the staging buffer is loaded into GB and a transfer length of 2 is loaded into GC. The base address of the timestamp table in the A is fetched from the control store and the relative timestamp address added to it. The result is entered into GE for use as the starting address in an operation to transfer two words of the timestamp table from the RAM to the staging buffer. At step 1125 the GET RAM subroutine is called to transfer two words comprising the timestamp entry from the RAM to the staging buffer. At step 1126 the starting address saved at step 1119 is again fetched and the two high order bits removed to obtain the relative timestamp address. The address of the newest timestamp entry (SBMRTS) is fetched from the staging buffer and at step 1127 SBMRTS is compared with the relative timestamp address to see if the newest entry has been reached. If. it has, the program proceeds to step 1128 where SBTSl is fetched and checked (step 1129) to see if it is a zero value. If it is, the newest entry has already been trickled. The program branches to Fig. 11F where a subroutine is executed to put the global variables back in the RAM. A return is then made to the idle loop. If the test at step 1127 indicates that the newest entry in the timestamp table has not been reached, or if at step 1129 the test indicates that- the segment corresponding to the newest . entry in the timestamp table has not been trickled, the program proceeds to step 1130 where it computes and saves the relative SDT address. Since there are two words per entry in the timestamp table and four words per entry in the SDT table the relative SDT address is obtained by multiplying the relative timestamp entry.address by 2. This relative address is .then added to the base address of the SDT to obtain the absolute address of the corresponding SDT entry in the staging buffer. The value 4 is entered into GC to specify a transfer length and the base address of the SDT in the RAM is fetched from the control store and loaded into GE. At step 1131 the GET RAM subroutine is executed to transfer the four word SDT entry from the RAM to the staging , buffer. Next, at step 1136 word 2 of the SDT entry is fetched. At steps 1144 and 1145 word 2 of the SDT entry is tested to see if the TACK bit or the written-to bit is set. If neither bit is set, an error condition exists and the SCU stops. If the TACK bit is set the program branches from step 1144 to Fig. 11H to test the skip trickle flag and update the next trickle start address. At step 1146 the skip trickle flag is fetched and at step 1147 the flag is tested. If it is on a branch is made to Fig. 11F where the global variables are returned to the RAM before a return is made to the idle loop. If the skip trickle flag is not on at step 1147 then at step 1148 the flag is turned on and restored in the staging buffer. At step 1149 the timestamp entry forward link is fetched from SBTS2 and stored at SBGSAT, the address used for trickle. The forward link is also saved in the next trickle save area in the control store. At this time the program returns to Fig. 11F where the global variables are sent from the staging buffer to the RAM storage and a return is made to the idle loop. Returning to Fig. HB,.if the test at steps 1144 and 1145 show that the SDT entry is not tacked and the written-to bit is set the program proceeds to step 1151 (Fig- 11C) where the first word of the SDT entry is fetched from the staging buffer and saved in the control store. Also, the device number from the SDT entry is added to ADRCNV, the starting address of the address convert table. The table is indexed to fetch from the control store the bit significant device address. At step 1152 SBGTCQ, the word having one bit set for each device having a trickle command queued in its command queue, is fetched from the staging buffer. At step 1153 SBGTCQ is ANDed with the bit significant device address to see if there is already a trickle command queued for this device. The test is made at step 1153 and if there is already a trickle command queued for this device the program branches to Fig. Il where, at step 1154, a subroutine is executed to fetch the command queue from the RAM to the staging buffer. Next, a test is made to see if the SDRA of the trickle command pending in the queue matches the SDRA from the SDT entry. At step 1155 the second word of the command queue entry is fetched and the SDRA isolated. At step 1156 the first word of the corresponding SDT entry is fetched and the SDRA in this word is isolated. At step 1157 the two SDRA's are compared, if there is no match, SBGTSK is fetched and the high order bit tested to see if the skip trickle flag is on. If it is, the program proceeds to Fig. UP. If the skip trickle flag is not on, then at step 1160 it is set and SBGTSK returned to the staging buffer. At step 1161 the current TS entry in the save area is loaded into the start trickle address SBGSAT after which the program proceeds to Fig, UF. Whether the skip trickle flag is on or off, in Fig. 11F the global variables are returned to the RAM after which • the subroutine returns to the idle loop. At step 1157, if the two SDRA's are equal, the subroutine branches to Fig. HE where, at step 1162, the second word of the timestamp entry is fetched and the forward link saved in the control store to be used as the next trickle search address. At this point the routine checks to see if there is any more important work to be done by the SCU. At step 1161 a Check Disk Interrupts subroutine is performed to find out if there are any disk interrupts. The return code for the disk interrupt subroutine is checked at step 1164 and at step 1165 an instruction is executed to see if there is an EF (command from host) pending. If there is no interrupt or EF pending, then at step 1166 SBGTCQ and SBGONL are fetched and compared. At step 1167 the result is tested to see if all command queues have a trickle command pending. If there is at least one command queue that does not have a trickle command pending, then at step 1168 SBGWTS is fetched and at step 1169 a test is made to see if there are any written-to segments still present in the cache memory. If there are, the program proceeds to Fig. 11F, step 1170, where the newest timestamp entry is fetched and saved. At step 1171 the trickle search argument is fetched from the control store, the LFL bit masked off, and the trickle search argument compared with the newest timestamp entry. At step 1172 the result of the comparison is tested and if the two values are equal the last entry in the timestamp table has been checked. The program proceeds to step , 1139 where the skip trickle flag SBGTSK is fetched. At step 1140 it is tested to see-if- i is on. If it- is, the program moves to step 1123; puts"the global variables back in RAM, and returns to the idle loop. If the skip flag is not on, the program proceeds from step 1140 to step 1141 where the skip flag is set and SBGTSK returned to the staging buffer. At step 1142 the second word of the timestamp entry is fetched and the forward link address saved at a convenient location in the control store. At step 1143 the forward link address is stored in the staging buffer at SBGSAT. The subroutine is then called '' to put the global variables back in the RAM and after this is accomplished a return is made to the idle loop. If the test at step 1172 indicates that the last entry has not been checked then the program branches back to step 1120 in Fig. 11B to check the next entry. If the test at step 1164 indicates that an interrupt is pending, the test at step 1165 indicates an EF is pending, the test at step 1167 indicates that all command queues have a trickle command pending, or the test at step 1169 indicates that there are no written-to segments in the cache memory, the program branches to step 1139 of Fig. IIP and proceeds as previously described. Returning to Fig. 11C, if the test at step 1153 indicates that there is not already a trickle command queued for. this device the program proceeds to step 1173 where SBSDT2 is fetched and the local floater bit checked to see if it is set. If it is, this entry must be bypassed because the device to which the segment should be trickled is not operative. The program branches to step 1162 in Fig. HE and proceeds as previously described. If the test at step 1173 shows that the local floater bit is not set in the SDT entry the program proceeds to step 1174 where it tests to see if the bad disk bit in word 2 of the SDT entry is set for the SCU making the trickle check. If the bad disk bit is set the trickle must be bypassed and the program branches from step 1174 to Fig. HI where it proceeds as previously described. If the bad disc bit is not set then at step 1175 word 2 of the entry in the timestamp table is fetched and at step 1176 (Fig. 11D) a test is made to see if the storage control unit or subsystem is in the idle state. . If it is the program proceeds immediately to step 1179. If the subsystem is in its idle state then the AGEOLD value stored at SBGAGE and the TDELTA value stored at SBGTLD are fetched. AGEOLD is a system parameter which may be loaded into the system during parameterization. It represents an interval of time elapsing after a segment is first written to by a host processor after which the segment becomes a candidate for- trickling. Stated differently, segments having an age since first write less than AGEOLD are not trickled." The exception to this occurs if the storage control unit is in the idle state, that is, it has no other work to do. In this case a segment may be trickled even though the age since first write is not as great as AGEOLD. TDELTA is a value representing the difference between the current timestamp value and the oldest timestamp value of all the entries in the timestamp table. Generally speaking, it is desirable not to trickle written-to segments from the cache memory to the disk drive devices when there is other work to be done. Trickling during periods when there is other work to be done degrades system performance. On the other hand, it is desirable not to retain a written-to segment in the cache memory for too long a period after it is first written to since, in the event of a cache failure, the procedure for recovering lost data can become more time-consuming. Steps 1176-1178 comprise a means for balancing these two desires. If the subsystem is not idle and the age-since-first-write of the oldest written-to segment (TDELTA) is not equal to or greater than AGEOLD, the program does not check for trickle candidates but branches from step 1178 to Fig. 11H and proceeds as previously described. When the subsystem is idle, (i.e. no activity over the host-SCU interface for a given interval of say 200ms) this is detected at step 1176 and the program proceeds to step 1179 to begin checking for trickle candidates. . If the system is not idle then a check is made at step 1178 to see if the oldest written-to segment has been in cache memory for an interval of time equal to or greater than AGEOLD. If it has then the program proceeds to step 1179 to check for trickle candidates. Assume now that the test at step 1176 proves true, or the test at step 1176 proves false but the test at step 1178 proves true. The program moves to step 1179 where SBGTCQ is fetched, the bit corres¬ ponding to this command queue is set, and the updated word returned to the staging buffer. At step 1180 the SDT relative address for the entry is fetched from the save area of the control store and the base address SBTSKA of the table of SDT addresses for segments on queue for trickling is fetched from the staging buffer. The device number saved at step 1151 is added to SBTSKA to index the table and obtain the entry. The SDT relative address is entered and the entry returned to its slot in SBTSKA. The subroutine is now ready to build a trickle command and insert it in the command queue. At step 1182 a subroutine is executed to bring the command queue from the RAM to the staging buffer. The trickle execution priority (SBTPRI) is fetched from the staging buffer. The trickle priority is computed by the Determine Trickle Priority subroutine of Figs. 16A and 16B and inserted in SBTPRI at step 1642. The first word of the SDT entry is fetched from the control store save area where it was saved at step 1151. At step 1184 the host ID is isolated and the trickle priority is OR'd in. The trickle bit is set and the resulting word is stored in the control store at CMDQ1. At steD 1186 the first word of the SDT entry is again fetched from the save area. The four high order SDRA bits are isolated and a value of 1 is entered into the NSEG field. This word is then stored in the control store at CMDQ2. The formation of the third word of the command queue entry is illustrated at step 1188 and merely involves .fetching the fourth .word of the SDT entry and storing it at location CMDQ3 in the control store. The three words comprising the trickle command are now present in the control store and at step 1189 a subroutine is called to add the trickle command to the command queue. After the trickle command is added to the command queue a subroutine is to pa the command queue back in RAM. This completes the generation and insertion of one trickle command in one command queue. The program then moves to step 1162 and proceeds as previously described. It should be noted that the sequence of steps beginning at step 1120 (Fig. 11B) and proceeding in sequence-through Figs. 11B,..11C, 11D and HE to step 1172 form a closed loop. The loop may be repeated up to 16 times if there are 16 devices and thus 16 command queues. Thus, during one call of the Check Trickle subroutine it is possible (but not likely) that 16 trickle commands might be built, one for each command queue. CHECK COMMAND QUEUE The Check Command Queue subroutine is called by the idle loop and reads the command queues sequentially starting at the next in-priority until it finds a non-busy device with something queued against it. If it fails to find a device satisfying these requirements it returns to the caller with a return code of zero in GA. If it is successful in finding a device satisfying these requirements it leaves the found queue in the staging buffer and returns with a non-zero value in GA. As illustrated in Fig. 12A, the Check Command Queue subroutine begins by fetching SDTINF from the control store. This word provides information as to the location of the SDT in the cache. A Select SDT subroutine is then called to select and reserve access to the SDT in the cache memory. At step 1204 the parameters are set for bringing the command queue header for the next priority device from the RAM and placing it in locations SBCMDQ and SBCMQH of the staging buffer. Only two words are transferred, the first word being at the RAM location specified by CDGPRI which is the RAM starting address for the command queue header corresponding to the device having highest priority. After these parameters are set a Get Ram subroutine is executed in order to fetch the two header words into the. staging buffer. At step 1208 the -first header word is fetched from the staging buffer, masked, and the device number saved in GB. GC is used as. a loop iteration counter for determining when all of the command queues have been checked for a queued command. The loop begins at 1210 where the current device number is entered into HL, the count in GC entered into HH and the result saved in the. control store at CDCPRI. At step 1212 the on-line mask word SBGONL is fetched and saved in GD. At step 1214 the base address ADRCNV of the address conversion table is added to. the device number- and the bit significant device .address for the device is fetched from the control store. The bit significant device address is then compared at step 1216 with the on-line mask word to see if the device is on line. Assuming for the moment that it is not, the program proceeds to step 1218 whers GC is right-shifted one position. A check is then made at step 1218 to see if GC has been reduced to zero. Since this will not happen until sixteen devices have been checked, the program proceeds to step 1222 where the device number in GB is incremented. A test is then made at step 1224 to see if GB = 16. If GB is not equal to 16 the program loops back to step 1210. However, if GB = 16 then at step 1226 GB is set to zero and the program returns to step 1210. The reason for this is that all _. sixteen command queue headers, corresponding to the sixteen devices, must be checked but the actual checking operation starts with the next highest priority device as specified by CDCPRI. Steps 1224 and 1226 thus insure that if, for example, CDCPRI is initially 14 thereby specifying device 14, device 15 is checked and then devices 0, 1—13 in sequence. The loop comprising steps 1210-1226 is repeated, each time updating CDCPRI, addressing the address conversion table to obtain the bit significant device address, and comparing it with the on-line mask word to see if the corresponding device is on line. Assuming no devices are on line then after the sixteenth execution of the loop GC will be found equal to zero at step 1220. The program branches to Fig. 12D where a not found indicator is stored in GA. A subroutine is then executed to release the SDT after which zero is entered into a register designated CT which is associated with the cache interface control 112. A return is then made to the idle loop with an indication in GA that no command queues were found having a command"queued against them. Returning to step 1216, if the test shows that the device being tested for is on line the program branches to step 1234 in Fig. 12B where CDCPRI is fetched. At this time the high orders of CDCPRI contain the count stored therein from GC at step 1210 and the low orders contain the device number also entered therein at step 1210. The base address of the command queue translator table CQRTXL is fetched and added to the device number in CDCPRI. The result is used to access the table and fetch the address of the command queue for the on-line device. At step 1238 preparations are made for bringing the command queue header for the on¬ line device into the staging buffer from the RAM. A zero is entered into GD to indicate that the routine about to be called is to ' fetch information and the value 2 is entered into GC to indicate that two words are to be transferred. The address obtained in step 1236 is placed in GE to specify the starting address in RAM for the transfer and the address of SBCMDQ is placed in GB to specify the starting location in the staging buffer to receive the data transfer. After these operations are- accomplished the Get Ram subroutine is called to fetch the command queue for the on-line device into the staging buffer. After the command queue header for the on¬ line device is entered into the staging buffer the first header word is fetched and at step 1244 the NCQ field is checked to see if there are any commands on this queue. If there are, then a test is made at step 1246 to see if the device serviced by this command queue is busy. If there are no queued commands or if the associated device is busy then there is no work that can be performed with respect to this device. Therefore, the search through the loop 1210-1226 should be resumed. However, before the search is resumed the program branches to Fig. 12C where a Check Interrupts subroutine is called at step 1248. At step 1250 a check is made to see if there is an EF from a host and at step 1252 a check is made to see if the subroutine - of step 1248 located any interrupts requiring processing. ' If there is an EF or a pending interrupt, the subroutine branches from step 1250 or 1252 to F.ig. 12D where it releases the SDT, clears the CT register and returns to the idle loop where it will locate the particular operation which needs to be done. If there are no EFs or pending interrupts then at step 1254 CDCPRI is fetched, its device number is entered in GB and its count entered into GC. The program then returns to step 1218 and continues checking the devices in sequence for an on-line device. As before, if an on-line device is found then at step 1216 a branch is taken to step 1234 to see if the device is not busy and has a command queued for ' - it. If an on-line device is found which is not busy but has a command queued against it, the program proceeds from step 1246 -to step 1256 where it prepares to obtain.the entire command queue for the non-busy device. CDCPRI is fetched and stored at STSXDA as the current device number. The device number in HL is entered into GD and a Get Command Queue subroutine is called to fetch the command queue for the non-busy device from the RAM to the staging buffer. The operations in step 1260 fetch CDCPRI from the control store and increment it by 1 to set the next' device priority. The device number is masked off and saved at the first address in the staging buffer. At step 1262 preparations are made for transferring two words from the staging buffer starting at location zero to the RAM starting at address CDGPRI. The Put Ram subroutine is then called to accomplish the transfer. At step 1266 the value 8000 is loaded into GA to indicate to the calling routine that the Check Command Queue subroutine has found a command for execution. A return is then made to the idle loop and at step 504 the indicator in GA causes the idle loop to branch to the Service Command Queue routine. FIND COMMAND QUEUE ENTRY FIGS. 13A and 13B -comprise a flow diagram illustrating the Find Command Queue Entry subroutine. This subroutine is called by the Cache Breakout routine to find a current command or is called by the Service Command Queue routine to determine the next command in the command queue for execution. Figs. 13A and 13B illustrate only those operations of the subroutine executed when the subroutine is called by the Service Command Queue routine. At the time the subroutine is called CMDQ1 AND CMDQ2 are in the control store and a copy of the command queue is in the staging buffer beginning at location SBCMDQ. The routine begins at step 1302 by fetching the first header word for the command queue and checking NCQ to see if there are any commands queued for this device. If NCQ = 0 then there are no queued commands for this device and at step 1304 the program branches to step 1306 w h ere the value 1 is entered into GA. This is a return code for the calling routine to inform the calling routine that the subroutine was unsuccessful in finding an entry. After GA is set the subroutine returns to the calling routine. If the command queue is not empty then from step 1304 the program proceeds to step 1308 where the request code provided by the calling routine in GA is tested to see if the calling routine wants the subroutine to find the current or the next highest priority entry. If the current entry (EF2) is wanted the program branches to a sequence of steps (not shown) to find the current entry. T h ese steps are not relevant to the present invention. If the test at step 1308 indicates that the next command to be executed is to be found, the program proceeds to FIG. 13B where step 1310 loads the value 8000 into GA after which the Determine Trickle Priority subroutine is called. The- " value loaded into GA tells the Determine Trickle Priority subroutine that it is to update the priority of the trickle command in the command queue after priority has been determined. After trickle priority has been determined and the command updated at step 1312, the program proceeds to step 1315 where a test is made to determine whether there are four or more commands awaiting execution in the command queue. If not, the program proceeds to steps 1317 and 1318 to find the command entry having the highest priority and lowest sequence number, followed by the saving of the command address in GD. The details of a preferred manner for accomplishing steps 1317 and 1318 are described in the aforementioned U.S. Patent No. 4,523,206. After step 1318, the program proceeds to FIG. 13A. If there are four or more commands awaiting execution, the program instead proceeds to step 1319 where the current cylinder and angular positions of the corresponding disk drive device are determined. This determination may be made based on position data provided by the disk drive or by using the SDRA and NSEG values (FI G . 3) of a command entry which has just completed execution. The program then proceeds to step 1321 where a first candidate command entry is fetched and then tested at step 1323 to determine whether it has a priority which is higher than some predetermined priority. If so, the command is selected for immediate execution and the program branches via step 1318 to FIG. 13A. If not, another test is then made at step 1325 to determine whether this candidate command entry has been passed over (that is, not been"selected) for execution sixteen times.- If so, it is selected for immediate execution and the program branches via step 1318 to FIG. 13A. Thus, the program will proceed to step 1327 if the candidate command does not have a priority which is higher than the designated predetermined priority level, and also has not been passed over for execution sixteen times. At step 1327, the candidate command's starting record location (that is, the disk cylinder and angular position of its first record) are determined from the second word of the command entry (FIG.3). These are then used to calculate the total time required to reach this location (taking into account microprocessor overhead, head seek time and rotational latency time) using the current cylinder and angular position previously determined in step 1319. This calculated total time is tested at step 1329 (against the present total time value in GB) to determine whether it is the best (fastest) so far of the candidates tested. If so, the program proceeds to step 1331 at which the address of this best candidate command is saved in GD and the corresponding total time saved in GB, after which the program proceeds to step 1331. If the total time is not the best so far, the program proceeds directly to step 1331. At step 1331 a test is made to determine whether the end of the command queue has been reached. If not, the program branches back to step 1321 to fetch the next candidate command. If so, the program then branches to FIG. 13A. In order to provide a better understanding of the operations occurring at step 1327 in FIG. 13B, reference is directed to FIG. 18 which shows graphs illustrating various time factors involved in determining which of two command candidates should be selected for execution based on which is able to access its starting disk space in the fastest time. Time Tl in the top graph of FIG. 18 represents the time at which the current cylinder and angular position are determined in step 1319 of FIG. 13B, while M represents the microprocessor overhead (a known constant). The middle and lower graphs in FIG. 18 represent two possible command candidates designated candidate 1 and candidate 2. The candidate starting record" (known . from the candidate command entry in the command queue) comes up once each revolution and is indicated by Rl for candidate 1 and R2 for candidate 2. The seek times for candidates 1 and 2 (determined at step 1327 in FIG. 13B) are indicated by SI and S2, respectively, and the rotational latency times (also determined at step 1327) are indicated by LI and L2, respectively. The total positioning time TTl and TT2 required for candidates 1 and 2 in FIG. 18 are thus TTl = SI + LI and TT2 = S2 + L2, respectively. It will be apparent from FIG. 18 that candidate 2 would be selected over candidate 1 for execution since its total positioning time TT2 is shorter than TTl of candidate 1. Although candidate 2 requires a longer seek time S2 as compared to the seek time SI required for candidate 1, candidate 2 has a much shorter latency time L2 than LI of . candidate 1, resulting in candidate 2 having the fastest total positioning time TT2. When the program ' arrives at step 1334 in FIG. 13A (after exiting from FIG. 13B in the various ways previously described) , GD will contain the relative address in the command queue of the selected entry. It will be understood from the foregoing description of FIG. 13B that, if less than four commands are awaiting execution in the command queue, the selected entry will be the one having the highest priority and the lowest sequence number. If four or more commands are awaiting execution in the command queue and none has a priority below a predetermined priority level nor has been passed over for selection sixteen times, then the selected entry will be the one having the fastest required positioning time to the corresponding disk space taking into account microprocessor overhead time, seek time and rotational latency. If when there are four or more commands awaiting execution, at least one has. a priority above a predetermined priority level or has been passed over for selection sixteen times, then the selected entry will be the first of these encountered in performing the flow diagram of FIG. 13B. At step 1334 in FIG. 13A., the .value in GB is compared with the value FFFF which is placed in GB prior to fetching a command entry in FIG. 13B. If GB = FFFF it means that all of the slots in the command queue were empty or any full slot contained a command being executed by the other SCU. Therefore, the subroutine has found no entry for execution. A branch is taken to step 1306 where GA is set to indicate the "nofind" condition to the calling routine. A return is then taken to the calling routine. At step 1334, if GB is not equal to FFFF it means that the subroutine has found a command to be executed. At step 1336, the address of this selected command is transferred from GD to the staging buffer address register BX. At step 1338, the three words comprising the selected command queue entry , are accessed from the staging buffer and moved to locations CMDQ1, CMDQ2, and CMDQ3 in the control store. At step 1340 the request number from CMDQ1 is entered into SBCMQH in the active command request number field. At step 1342 the request number from CMDQ1 is used- to update the request number location STSXRN in the control store. At step 1344 GA is cleared to indicate to the calling routine that a command was found for execution, and after GA is updated a return is made to the calling routine. UPDATE TACK/WT FIGS. 14A-14F illustrate the Update TACK/WT subroutine. It is this subroutine which is called to update the TACK and written-to (WT) bits in the second word of an SDT entry. Two running counts are maintained, one count indicating the number of written- to segments in cache and the other indicating the number of empty segments in cache. The subroutine increments or decrements one or both of these counts depending upon what operation it is called upon to do. After the counts have been updated the subroutine calls the Add/Delete Timestamp subroutine to update the timestamp table. Upon return from the timestamp table the Update TACK/WT subroutine returns to the calling routine. The Update TACK/WT subroutine is called any time a change is made in the segment descriptor table entries. Thus, it may occur when an SDT entry is formed, when an SDT entry is deleted or when the SDT is updated. The calling routine passes to the Update TACK/WT subroutine a parameter in GA-.indicating whether the TACK bit should be set or reset, the WT bit .should be set or reset, or the TACK bit set and the SDT entry in the RAM updated. For updating the RAM, the calling routine places the SDT entry relative pointer in GB prior to calling the Update TACK/WT subroutine. Referring to Fig. 14A, the Update TACK/WT . subroutine begins by fetching the second word of the SDT entry from the staging buffer and. placing the high half of the word in GE. Next, the count of.-the number of written-to segments SBGWTS is fetched from the staging buffer and placed in GD. The count of the number of empty segments SBGMTS is fetched from the staging buffer and held in HL. At steps 1404, 1406, 1408, 1410 and 1412 the value in GA is tested to see if the calling routine has instructed that the TACK bit be reset, the WT bit reset, the TACK bit set, the WT bit set, or the TACK bit set and the SDT entry in the RAM updated. If the value in the GA register does not call for any of these operations then at step 1412 a branch is taken and a STOP instruction executed to stop the SCU because of the input parameter error. At step 1404, if the test indicates that the ' subroutine was called to reset the TACK bit a branch is taken to step 1414 to see if the TACK bit is on. If it is, the TACK bit is reset in the high half of the SDT entry word 2 contained in GE. When counting the number of empty segments in cache, those segments which are tacked, or are written- to as indicated by word 2 of the corresponding SDT entry are excluded from, the count. Since- a TACK bit was reset at step 1415 the number of empty segments is increased only if the untacked segment does not have the WT bit on. A test is made at step 1416 and if the W T bit is on the count of the number of empty segments in HL is incremented at step 1418. The program then proceeds to Fig. 14E where the number of empty segments in HL is stored in the staging buffer at SBGMTS. The number of written-to segments in GD has remained unchanged and this value is returned to SBGWTS. The secon d word of the SDT entry is fetched and the high order half-word updated with the contents of GE with the result being returned to SBSDT2. A t step 1476 bit 7 of the ST register is tested to see if it is set. This bit was reset at step 1402 and has remained unchanged. Therefore, from step 1476 the program returns to the calling routine. This bypasses the Add/Delete Timestamp subroutine since - there has been no change in the number of written-to segments. If step 1414 finds that the TACK bit is not on, or if it is on step 1416 finds that the WT bit is on, then no change is made in the count of number of empty segments. The program proceeds directly from step 1414 or 1416 to Fig. 14E where the same operations are performed as previously described. However, in this case the count of the number of empty segments in HL has not been incremented hence the same values read from SBGMTS, SBGWTS and SBSDT2 at step 1402 are returned to the staging buffer at step 1474. If the calling routine has passed a parameter in GA indicating that the TACK bit should be set, this is detected at step 1408. The program branches to Fig. 14C where the TACK bit is tested at step 1438 to see if it" is on. If it is, the program branches immediately to Fig. 14E. If the TACK bit is not on it is set in GE at step 1440 and at step 1442 a test is made to see if the WT bit is on. If it is, the program branches to Fig. 14E. If the WT bit is not on then the setting of the TACK bit at step 1440 has decreased by one the number of empty segments. At step 1444 the number of empty segments in HL is decremented by one and the program proceeds to Fig. 14E. If the calling routine- has set an indicator in GA to indicate that the T bit should be reset, this condition is detected at step 1406 and the program branches to Fig. 14B. At step 1420 the written-to bit is tested and if it is not on the program proceeds to Fig. 14E. If the WT bit is on it is reset at step 1421. At step 1422 the device address STSXDA is fetched and saved in GA and SBTKSA, the base address of the BSDA trickle table is fetched. The"two values are added and used to index the table. The value read therefrom at step 1423 is decremented and returned to the table at step 1424. At step 1425 the number of written-to segments in GD is decremented, ST7 is set, and the value 4000 is entered into GA as a parameter for the Add/Delete Timestamp subroutine which will be called. At step 1425 the TACK bit is tested and if it is not en the count of the number of empty segments is incremented. If the TACK bit is on then the incrementing of the number'of empty segments is » bypassed. In either case, the program proceeds to Fig. 14E where SBGMTS, SBGWTS and SBSDT2 are updated. At step 1476 it is found that bit 7 of the ST register is set. The Add/Delete Timestamp subroutine is called at step 1478 and, after completion of this subroutine a return is made from the Update TACK/WT subroutine to its calling routine. The value 4000 entered into GA at step 1425 tells the Add/Delete Timestamp subroutine that it should delete a timestamp entry from the timestamp table. If the routine which calls the update TACK/WT subroutine has set an indicator in GA to indicate that the WT bit should be set, this condition is detected at step 1410 and the- program.branches to Fig. 1 ' 4D. A test is made to see if WT is on and if it is, the program branches to Fig. 14E, updates SBGMTS, SBGWTS and SBSDT2 and then returns to the calling routine-, bypassing the Add/Delete Timestamp subroutine. If the test at step 1430 indicates that the W T bit is on then it is reset at 1431. Steps.1432, 1433, and 1434 fetch STSXDA and SBTKSA, add the two, index the table of SDT addresses of segments waiting to be trickled, increments the count in the high half-word of the entry indexed and restores the entry. At step 1435 the number of written-to segments is incremented, bit 7 set in the ST register and the value 8000 entered into GA. At step 1436 the TACK bit is tested and if it is on the program proceeds to Fig. 14Ξ. If the TACK bit is not on then the number of empty segments is d ecremented and the program proceeds to Fig. 14E. In F ig. 14E, SBGMTS, SBGWTS and SBSDT2 are all updated. At step 1476 the test shows that ST7 is set. so the Add/Delete Timestamp subroutine is called. Since GA contains the value 8000 the Add/Delete Timestamp subroutine will add an entry to the timestamp table. After the Add/Delete Timestamp subroutine is completed a return is made to the Update " TACK/WT subroutine and from there a return is made to that routine which called the Update TACK/WT subroutine. If the routine which calls the Update TACK/WT subroutine has placed a value in GA requesting that the TACK bit be set and the SDT entry in the RAM updated, this condition is detected at step 1412 and the program branches to Fig. 14F. The TACK bit is tested at step 1450 and if it is already on the program branches to step 1470 where the base address of the SDT table in RAM (CDCSDT) is fetched and added to the SDT entry relative pointer which was passed to the Update TACK/WT subroutine by the caller -in register GB; The result is the absolute address of the SD entry in the RAM. Preparations are made : for transferring the SDT entry to RAM. These preparations include loading the starting location of. the -SDT in the staging buffer into GB, setting the value into GC as the length of the transfer to take place, and setting bit F of the ST register to indicate that the routine about to be called is to put data into the RAM. At step 1472 the Put Ram subroutine is called to accomplish the transfer of the four word SDT entry to the SDT in the. RAM. Upon completion of the subroutine a return is made to the Update TACK/WT subroutine and then a return is made to the routine which called the Update TACK/WT subroutine. ADD/DELETE TIMESTAMP The Add/Delete Timestamp subroutine adds or deletes a timestamp entry from the timestamp table located in the cache memory. The calling routine places the value 8000 in GA if the Add/Delete Timestamp subroutine is to add a timestamp entry and places the value 4000 in GA if the subroutine is to delete a timestamp entry. The calling routine also passes the SDT address of the entry to be operated on in GE. The Add/Delete Timestamp subroutine first generates the address of the entry in the timestamp table from the SDT address and then checks GA to see whether an add or a delete operation is to be performed. For an add operation, the new entry is loaded with the timestamp sent from the host, the LFL bit in word 2 of the entry is set and all bits of the forward link are set. If a previous entry exists, the backward link of the new entry is loaded with the address of the prior entry and LBL of the new entry is reset, the newest entry pointer loaded with the new entry address, LFL of the previous entry is reset, and the forward link of the previous entry is loaded with the address of the new entry. If the new entry is the only entry in the timestamp table, LBL and BL of the new entry are set to ones, the newest entry pointer and the oldest entry pointer are loaded with the address of the new entry, and TOLDEST is loaded with the timestamp of the new entry. For a delete operation, the timestamp, LBL, and LFL are reset while BL and FL are both set to all ones. If the entry is the last valid entry in the timestamp table, TOLDEST is reset while the newest entry pointer and the oldest entry pointer are reset. If the entry is the newest entry, LFL and FL of the previous entry are set and the newest entry pointer updated to point to the previous entry. If the entry is the oldest entry, LBL and BL of the next entry are set, the newest pointer is updated to point to the next entry, and TOLDEST ia loaded with the timestamp of the next entry. If the entry being deleted is the only entry, the newest entry pointer and the oldest entry pointer are both set and TOLDEST is reset. The Add/Delete Timestamp subroutine begins in Fig. 15A by dividing the SDT relative address by two to obtain the timestamp table relative address. The reason for this is that there are four words per SDT entry but only two words per timestamp table entry. T e timestamp table relative address is then added to the base address of the timestamp table to obtain the absolute table address of the timestamp entry. At step 1502 the input parameter in GA is tested to see if it calls for a delete operation. Assuming it does not, the input parameter in GA is then tested to see if it calls for an add operation. If it does not the program executes a STOP instruction since the input parameters are not valid. If the test at step 1504 indicates that an add operation is to be performed then one entry is made in the timestamp table. The exact operations to be performed in order to add an entry depend upon whether or not the new entry will be the only entry in the timestamp table or whether there is a previous entry already in the timestamp table. If there is no previous entry in the timestamp table then SBMRTS (the timestamp pointer to the newest timestamp table entry) will be all ones. SBMRTS is checked at step 1506. Assuming that there is no previous entry in the timestamp table the program branches to step 1508 where a word is built which will set the last backward link indicator bit (LBL) to 1 (see Fig. 4) and set the backward link to all ones. __ The program then proceeds to step 1510 where the- re_3tτ of the timestamp entry word is built. LFL is set-to 1 -and the forwar -link is set to all ones. The word generated by steps 1508 and 1510 is then stored in the staging buffer at.SBTS2 which is the location of the second word of the current (new) timestamp table entry. At step 1512 the timestamp table relative address of the new entry is stored at SBMRTS as the new newest entr pointer. At step 1514 another check is made to see if there was a previous entry and, if there was not, the new entry relative address is stored in the staging buffer at the location SBLRTS which holds the pointer to the oldest timestamp table entry. A t step 1518 the channel timestamp (CEF5) is fetched from the control store and entered into SBTSl which is the first word of the new entry in the staging buffer. At step 1520 another check is made to see if there was a previous entry and if there was not the program moves to step 1522 where the channel timestamp is entered into SBGTSO, the location in the staging buffer reserved for the oldest timestamp TOLDEST. A check is made again at step 1524 to see if there was a previous- entry-and-again .assuming that there was not the program proceeds to step 1526 where the newly formed timestamp table entry in SBT1 and SBT2 is stored in the timestamp table in the RAM at the a b solute ta b le address derived in step 1500. The A d d / D elete Timestamp subroutine then returns to the U pdate- TAC K/ W T subroutine which called it. If there is a previous entry in the timestamp ta b le at the time the Add/Delete Timestamp subroutine is called to add a new entry, the forward link and LFL bit of the previous entry must be adjusted and the new entry must be made to have a backward link pointing to the previous entry. If the test at step.1506 indicates that there is a previous entry in the ' timestamp table the program proceeds to step 1528 where the newest timestamp pointer (SBMRTS) is added to the base address of the timestamp table to obtain the absolute address of the previous entry. This address is then utilized to address the RAM and move the previous entry from the . -. RAM to the staging buffer at locations SBTS3 and SBTS4. At step 1532 the previous entry is fetched- from SBTS4 for the purpose of building a word to update SBTS . The absolute timestamp table address of the new entry is inserted as the forward link and the LBL bit is cleared. The resulting word is then returned to the - staging buffer at location SBTS4. ' - The links of -the new..entry, .are now formed. The newest timestamp pointer SBMRTS " is fetched and made the backward link of the new entry, : At step 1510 LFL - is set and all ones are inserted into the word as the forward link. The resulting word is stored at SBTS2 as word 2 of the new timestamp table entry. It is now necessary to update the global variables and load the ' timestamp- into -word-1-of-the new entry. At step 1512 the relative table address of the new entry is stored at SBMRTS as the new newest timestamp entry. The test at 1514 proves true so the program proceeds to step 1518 where -the channel timestamp CEF5 in the control, store is inserted as the timestamp in word 1 of SBTSl. The test at steps 1520 and 1524 both indicate a previous entry- and .-at-step.1536 a routine is called to put the previous entry back in the RAM from the staging buffer. At step 1526 the newly formed entry is transferred from the staging buffer -to the timestamp table in the RAM. A return is then made to the calling routine. In order to delete " an entry from the timestamp table the Add/Delete Timestamp subroutine proceeds as follows." At step 1502 the test of the parameter passed by the calling routine shows that the calling routine wishes an entry deleted from the timestamp table. A branch is taken to Fig. 15C where the timestamp table relative address of the ' entry to be deleted is converted to an SDT relative address by - multiplying it by 2. The SDT relative address may or may not be used as subsequently described. CMDQ1, the first word of the cache command as stored in the control store, is fetched and checked to see if a STORE THROUGH command is being executed. If it is, a branch is taken from step 1540 to step 1544. If the test at step 1540 indicates that a STORE THROUGH command is not being executed then it. is necessary .to call a Test and Delete Trickle subroutine... This, routine, is invoked - whenever a segment has its WT bit in the" SDT entry reset or a segment is deleted- from the SDT. If a trickle is pending in. the command queue of the associated device and has the same segment device relative address, the trickle entry in the command queue is deleted and the-skip trickle flag in SBGTSK is reset. The purpose of the Test and Delete Trickle subroutine is to avoid attempting ' to trickle a segment- • which has been deleted or whose WT bit in the SDT entry is no longer set. Since the Test and Delete Trickle subroutine is. not- relevant to an understanding of the present invention, it is not " described-further. At -step 1544 the absolute table address of the delete entry (that is, the-entry to be deleted) is fetched and the parameters are set up for a two word transfer which transfers the delete entry from the timestamp table in the RAM to locations SBTSl and SBTS2 • in the staging buffer. SBTS2 is then fetched from the staging buffer and the LBL bit checked. Assuming for the moment that it is set, the program branches from step 1548 to Fig. 15D, where, at step 1566, SBTS2 is again fetched. The LFL bit is checked at step 1568. If it is also set it means that the entry to be deleted is the only entry in the timestamp table. The program branches from step 1568 to Fig. 15E. At step 1588 SBST2 is again fetched and at step 1590 the LBL and LFL bits are checked to see if they are both 1, Under th • assumed circumstances thέy are so the program proceeds to step 1591 where SBMRTS, SBLRTS and SBGTSO are set to all ones. At step 1592 a zero is entered into SBT S l there b y providing a zero timestamp in the deleted entry. A word is built up and inserted in SBTS2, this word having all ones in the forward and backward links with LFL and LBL reset. The -program-then returns to Fig. 15 B where, at step 1526, the new entry, that is, the deleted entry, is transferred from SBT S l an d SBT S2 in the staging buf er- to-its appropriate location in the timestamp table contained in the RAM, T he subroutine then returns to the calling routine. If the entry being deleted is not the only entry in the timestamp -table then adjustment will have to be made in either the -forward link address of the previous entry in the chain,. ' the backward link of the next entry in the chain,- or both the -forward -link in the previous entry and the backward link in the next entry - d epending upon- whether....the entry ,to be deleted is the newest entry, the oldest entry, or some entry interme d iate the newest entry and the oldest , entry. A ssume that the entry to be deleted is the oldest entry. W hen SBTS2 is fetched and LBL tested at step 1548 it is found to be set. The program branches to Fig. 15 D , again fetches SBTS2 at step 1556 and tests LFL at step 1568. If the entry is not the newest entry then from step 1568 the program proceeds to step 1570. The forward link of the delete entry is added to the base address of- the timestam -table to obtain the 5 RAM address of the next entry. The two-word next entry is moved from RAM to locations SBTS3 and SBTS4 in the staging buffer. At step 1574 SBTS2 is fetched and the forward and backward links of the delete entry saved, LBL is 10. tested to set an indicator, and under the assumed condition this indicator is set. At step 1576 the second word of the next timestamp table entry is fetched. At step 1578 the indicator set at step 1574 15 is tested and since under the assumed conditions it is set, the program proceeds to step 1579 where the backward link is set to all ones and LBL is set to 1. The word built up at steps- 1576 and 1579 is then stored as the second word of the next timestamp table entry. 20 Thus,. if the entry being deleted is the oldest entry in the timestamp table-the-backward link and the LBL bit of the next entry are all set to ones. The forward link and LFL of the next entry are left unchanged. 5 From step 1580 the program proceeds to Fig. 15E where it adjusts the global variables. A test is made at step 1582 to " see if the indicator was set at step 1574. Under the assumed conditions the indicator is set and the program proceeds to step 1583 where the 0 forward link of the delete entry is entered in the staging buffer at SBLRTS. Since this forward link specifies the address of the next entry, the address of the next entry becomes .the address of the oldest timestamp table entry. 5 " At step 1584 the timestamp of the next entry is transferred from SBTS3 to the location SBGTSO in the staging buffer as the oldest timestamp in the timestamp table. At step 1586 the two words comprising the next entry are transferred from"the staging buffer to the timestamp table in the RAM. At step 1588 the second word of the delete entry is fetched and checked to see if LBL and LFL are both 1. Under the assumed conditions they are not so the program branches to step .1592 where it zeros the timestamp, sets FL and BL to all l's, and resets LFL and L B L for the delete entry. The program then returns to Fig. 15B, step 1526, where the delete entry is transferred from the staging buffer to the timestamp table in the RAM. The program then returns to the calling routine. A ssume now that the Add/Delete Timestamp subroutine is called for -the purpose of deleting an entry which is the newest entry in the timestamp table. In Fig. 15A, steps.1500 and 1502 are executed and a branch taken to Fig: 15C where the steps previous . described are executed down to step 1548. At this point the test will find that the LBL bit is not-set and the program proceeds to step 1550 where the backward link of the delete entry is merged with the timestamp table base address to obtain the table address of the previous entry. The address thus derived is utilized at step 1552 to move the previous entry from the timestamp table to locations SBTS3 and S B TS4 in the staging buffer. A t step 1554 word 2 of the delete entry is fetched and the forward link and backward link addresses saved. An indicator is then set if LFL of the delete entry is a 1. Under the assumed conditions this is true. A t step 1556 the second word of the previous entry is fetched for the purpose of building a new wor d for this entry. . At step 1558 a test is made to see if the indicator was set at step 1554. Since it was, the forward link of the word being built is set to all ones and the LFL bit is set. The resulting word is stored at SBTS4. The net result " of steps 1556 and 1559 is 5 that the forward link of the previous entry is set to all ones and its LFL bit set to indicate that the entry " is now the last or newest entry in the timestamp chain. From step 1560 the ' program proceeds to Fig. 10. 15D where another test is made at step 1562 to see if the indicator was set at step 1554. Under the assumed conditions it was so the program proceeds to step 1563 where the backward link of the delete entry is sent to the staging buffer and stored at SBMRTS. Since the 15 backward link of the delete entry is the address of the previous entry, the previous entry.,becomes the newest entry in .the timestamp table. At step 1564 the updated previous entry is transferred from the staging.buffer' to its location in 20 the timestamp table in the RAM. At step 1566 the delete entry is fetched and its LFL bit checked. Since it is assumed that the delete entry is the last entry in the table the program branches to- Fig.- 15E * where the delete -entry is again 25 fetched at step 1588 and checked at step 1590 to see if both LBL and LFL are set. Since it is.assumed that the entry being deleted is not the only entry in the timestamp table the program branches to step 1592 where the timestamp in word 1 of the delete entry is set to 0 zero, the forward link and backward link in word 2 are both set to all ones and the LFL and LBL bits in word 2 are set to zero. The program then branches to step 1526 in Fig. 15B wher -the -updated delete entry is- transferrεd from the staging buffer to its location in 35 the timestamp table in the RAM. Assume now that the entry to be deleted is neither the first nor the last entry in a.timestamp table. In this case it is necessary to adjust the forward link of the previous entry to point to the next entry and adjust the backward link of the next entry to point to the previous entry thereby removing the deleted entry from the chain. In Fig. 15A the program proceeds to decision point 1502, branches to Fig. 15C and executes steps 1538-1552 in the manner described above for the condition where the delete entry is the newest but not the only entry in the table. At step 1554 the delete entry is fetched and the backward and forward links βaved. Since LFL will not be equal to 1 the indicator is not set. At step 1556 word 2 of the previous entry is fetched for b uilding a new word 2 for the previous entry. The forward link of the delete entry becomes the forward link of the previous entry. The backward link of the previous entry and LBL remain unchanged. At step 1558 the test will indicate that the indicator is not set so the program branches to step 1560 where the word generated at step 1556 is loaded into SBTS4 as the updated previous entry. The LFL bit is zero in the updated previous entry. The program then proceeds to Fig. 15D where the test at step 1562 will show under the assumed conditions that the indicator is not set. Therefore, SBMR T is not updated and the program proceeds to step 1564 where the updated previous entry is transferred from the staging buffer to the timestamp table in the RAM. A t step 1566 the delete entry is fetched and the L FL bit tested. Under the ' assumed conditions LFL will not be set so the program proceeds to step 1570 where the forward link of the delete entry is added to t h e b ase address of the timestamp table to obtain the a b solute table address of the next entry. At step 1572 the two words comprising the next entry are transferred from the RAM to the staging buffer at locations SBTS3 and SBTS4. At step 1574 the second word of the delete entry is fetched and the forward and backward links saved. Under the assumed conditions, the indicator is not set to show that LBL is equal to 1. At step 1576 the second word of the next entry is fetched. The backward link of the delete entry becomes the backward link of the next entry. The forward link of the next entry remains unchanged. A step 1578 the test will show that the indicator was not set at step 1574 and the program branches from step 1578 to step 1580 where the word built up at step 1576 is stored at SBTS4. As a result of the operations at step 1576, a word is built up for updating the second word of the next entry, the word built" up comprising .the. forward link of the next entry- and the backward link-of the- delete entry. From step 1580 the program proceeds to FIG. 15E where the test at step 1582 will show that the indicator was not set at step 1574. Thus, SBLRTS and SBGTSQ are not updated and the program proceeds to step 1586. At- step 1586 the updated next entry is returned from the staging buffer to its timestamp table location in the RAM. At step 1588 the delete entry is fetched and LBL and LFL checked to see if they are both ones. Under the assumed conditions they are not and the program branches to step 1592 where the timestamp in word 1 of the delete entry is set to zero, the forward and backward links in word 2 of the entry set to all ones, and the LBL and LFL bits are reset. The program then proceeds to Fig. 15B where step 1526 is executed to transfer the updated delete entry from the staging buffer to the timestamp table in the RAM. The program then returns to the calling routine. DETERMINING TRICKLE PRIORITY Figs. 16A and 16B comprise a flow diagram illustrating the operations performed with respect to the . determination of trickle priority. In accordance with the principles of the present invention trickle priority is computed according .to two diff rent criteria, the priorities for the two criteria are compared, and the highest priority utilized as the trickle priority. According to one criterion, priority is cυmpu-t-ed as illustrated in Table I. According to this criterion priority is based on how long it has been since the first write to the oldest written-to segment in cache. In Table I, TDELTA represents the difference between the current- timestamp. and the oldest timestamp. AGEOLD is a system paramter which is loaded during system parameterization and represents the length of time that a written-to segment may remain in cache before it is considered old. If TDELTA is less than twice AGEOLD then the priority assigned-according to the first criterion is 7. When TDELTA is between two and four times AGEOLD then a priority of 5 is assigned. If TDELTA is between four and eight times AGEOLD then a priority of 3 is assigned and if TDELTA is equal or greater than eight times AGEOLD then 1 is assigned as the priority. 1 represents the highest priority whereas 7 represents the lowest priority. PRIORITY TDELTA<2 X AGEOLD 7 (Low) 2 X AGEOLD≤TDELT < X AGEOLD 5 4 X AGEOLD≤TDELTA<8 X AGEOLD 3 8 X AGEOLDΪΞTDELTA 1 (High) Table I PRIORITY Segments WT=≤25% 7 (Low) 25%-=Segments WT≤50% 5 50%-^ Segments WT≤75% 3 75%< : Segments WT 1 (High) Table II Referring to Fig. 16A, reference numerals 1602-1618 identify the steps performed in order to compute priority based on the time (age) since first write of the oldest written-to segment. When the subroutine is called, an input parameter provided by the calling routine is saved in GA. If this parameter has the value 8000 it means that the Determine Trickle Priority subroutine should also update the priority of the trickle command in the command queue after computing priority. If it has the value 0000 then the trickle priority is computed but the command queue entry is not updated. AGEOLD is moved from its location SBGAGE in the staging buffer to GF. Next, the current timestamp provided with the last read or write instruction from a host processor (TCURRENT) is fetched from SBGTSC and the timestamp of the " oldest written-to segment (TOLDEST) is fetched from SBGTSO. TOLDEST is then subtracted from TCURRENT to obtain TDELTA a value representing the age since first write of the oldest written-to segment. TDELTA is stored in SB at location SBGTLD. Once TDELTA has been computed, the value 7, representing the lowest possible priority, is entered into GA. AGEOLD, presently held in GF, is multipl i ed by 2 and the result returned " , to GF. At step 1612, a test is made to see if TDELTA is equal to or greater than GF. If it is not, then TDELTA is less than 2 X AGEOLD and the assigned priority should be 7. The value 7 was entered into GA at step 1608 and at step 1618 this value is saved at some convenient location m the control store. Returning to step 1612, if TDELTA is equal to or greater than GF then the value 2 is subtracted from GA and the result returned to GA as a new P°*sible priority value. This value is checked to see if it is equal to 1 and if it is not the program loops back to step 1610 where the contents of GF are again . mult i pl i ed by 2 and returned to. GF. This places a value of 4 X AGEOLD in GF. At step 1612 another test is made, this time to see if TDELTA is equal to or greater than 4 x AGEOLD. If it is not, " the program jumps to step 1618 and the value in GA, now 5, is saved in the control store as the priority. . The loop comprising steps 1610, 1612, 1614 and 1616, may be repeated up to three times with the value in GA -being--reduced by.2..each time-the loop is executed. Thus, if on the final run through the loop the test at step 1612 still finds that. TDELTA is equal to or greater than GF 'the value 2 is again subtracted from GA which reduces the priority value there i n to 1 This condition is detected .at- step 1616 and the program proceeds from step 1616 to.-step 1618 where the p riority value of 1 is saved at the convenient locat i on in the control store. This completes computation of a priority value based on the age since first write or " the oldest written-to segment in cache. The second criterion for assigning priority is based- on the number of written-to segments in cache. As shown in Table II, a priority of.7 is assigned if the number of written-to segments is less than 25% of the total number of segments in cache. ' If between 25 and 50% of the ' segments in cache have been 5 written to, then the assigned priority value is 5. If between 50 and 75% of the segments have been written to, the priority is assigned a value of 3 and if over 75% of the segments have been written to, a priority of 1 is assigned. 10. Steps 1620-1636 illustrated in Figs. 16A and 16B compute a priority based on the second criterion. At step 1620, SBGCAP is fetched and divided by 2. SBGCAP is a fixed value representing the maximum possible number of segments in the cache memory. The 3 result obtained by dividing SBGCAP by 2 is stored at GE.-. In addition, this value is divided by 2 to obtain a value which is stored at GB, this value representing 25% of the total number of segments in the cache memory. GB and GE are added-together -to obtain-a value 20 representing 75% of the cache segments and this value is stored at GC. At step 1622, SBGWTS is fetched from the staging buffer and stored in GF. SBGWTS represent a count of the number of segments in the cache memory 25 that have not been destaged to a disk device since they were last written to. At step 1624, SBGWTS is compared with the 75% value obtained -at step 1620 and if SBGWTS is greater then the value 1 is loaded into GD as a . priority value. 30 If SBGWTS is not greater than the 75% value then at step 1628 it is compared with the 50% value obtained at step 1620. If SBGWTS is greater than the 50% value then the value 3 is entered into GD as a priority value. Finally, if SBGWTS is not greater than 5 the 50% value then it is compared with the 25% value obtained at step 20. If SBGWTS is greater than the 25% value then the value 5 is entered into GD. If the test at step 1632 shows that SBGWTS is not greater than the 25% value then a 7 is entered into GD as the priority value. ~ - At this point the subroutine has completed the computation of the priority value based on the second criterion and this value is contained in GD, having been placed therein at one of the steps 1626, 1630, 1634 or 1636. At step 1638 the subroutine compares the ageold priority saved at step 1618 with the written-to priority entered into GD at one of the steps 1626, 1630, 1634 or 1636. If the ageold priority is higher than the written-to priority then the program proceeds from step 1638 to step 1640 where the ageold priority is stored at SBTPRI as the trickle priority. On the other hand, if the test at step 1638 indicates that the written-to priority is higher than the ageold priority then at step 1642 the written-to.priority is sent to SBTPRI as the trickle priority. Next, GA is tested at step 1644 and if the first command in the command queue (SBCMQ1) is not to be updated the program returns to the caller. If the test at step 1644 indicates that SBCMQ1 should be updated, SBTPRI and SBCMQ1 are fetched from the staging buffer. At step 1648 the full bit (bit 4) of SBCMQ1 is tested to see if the first command queue entry is full. If it is not, the new priority is not inserted and the program returns to the calling routine. If the test at step 1648 indicates that the FL bit of the first entry in the command queue is set, the new priority SBTPRI is inserted and SBCMQ1 as thus modified is returned to the staging buffer. The program then returns to the calling routine. READ UTILITY Should there be a cache memory failure it is desirable that a host processor be able to reconstruct any data which may have been--lost and be able to do this in the least possible ' time. Essentially, what the host processor needs to know in this case is (1) which of the segments resident in the cache memory had been written to by the host but had not yet been written to the disk at the time of failure and (2) when the oldest of such written-to segments was first written to. As is evident from the foregoing description, the provision of a timestamp in each entry of the timestamp table gives an indication of when each segment was first written to if it has not been destaged. Furthermore, from this table the SCU continuously maintains the parameter TOLDEST and updates this parameter each time a segment is written to or a written-to segment is destaged to a disk in accordance with the timestamps maintained in the timestamp table. Since a cache memory failure may destroy the contents of the timestamp table, a host processor, in anticipation of the possibility of such a failure, periodically retrieves TOLDEST and saves it with other file recovery synchronization information, e.g., on a system audit trail. In the event of a cache memory failure the host may use the last TOLDEST it retrieved to recover from the failure. The host processor periodically issues a READ UTILITY command to the storage control unit 100 and the storage control unit retrieves TOLDEST rom the RAM and sends it to the host processor. Each time TOLDEST is sent to the host processor it replaces the TOLDEST value read in response to the last previous READ UTILITY command. Thus, by interspersing READ UTILITY commands with the other commands sent to a storage control unit a host processor may always have available a fairly up-to-date indication of how far back in time (i.e., in its program) it must go in its recovery procedure in order to regenerate the data that was lost by the cache memory failure. The routine performed in response to the Read Utility command from the host is illustrated in FIG. 17. Actually, the READ UTILITY command may read different parameters from the subsystem in accordance • with a subcommand field as fully explained in application Serial No. 207,152. Only that portion of the Read Utility routine is shown which is executed when the Read Utility command has a subcommand field specifying that the oldest timestamp value should be read. When the Read Utility command is issued by the host and accepted by the SCU 100 it is loaded into the control store 116 and decoded to find out exactly which subcommand should be executed. When it is determined that the subcommand specifies that the oldest timestamp value is to be read the base address of the- SDT- in the cache memory 106 is set up and a call is made at step 1702 to select the SDT. This reserves the SDT in the cache memory for the use of the SCU 100 which is making the request. At step 1704 the parameters are set up in preparation for calling a Get RAM subroutine. The parameters are chosen such that only one word will be transferred, this word being transferred from location CDGTSO in the RAM to address 0 in the staging buffer. CDGTSO is the location in RAM of TOLDEST and is the location to which SBGTSO from the staging buffer is transferred when global variables are returned to the RAM. After TOLDEST is brought into the staging buffer it is then fetched and tested to see if it is zero. If it is not, a buffer-to-host transfer is initiated at step 1710 to transfer the timestamp from location 0 in the staging buffer over bus BD through the channel interface circuits 108 to the requesting host 102. If the test at step 1708 indicates that the timestamp is equal to zero then the timestamp value in the staging buffer is set to all l's before the buffer-to-host transfer is initiated. After the buffer-to-host transfer is completed, a subroutine is called at step 1714 to release the SDT. The SDT is deselected and status action 06 is stored in the control store 116 at location STSXSA. The Read Utility routine then branches to a Cache Status routine which forms a status word and sends it back to the host. The SCU returns to the idle loop after the status word has been sent to the host. DETERMINING SUBSYSTEM IDLE In FIG. 11D, at step 1176, a check is made to see if the ' subsystem is idle. The subsystem is in the idle state if there is no command received from a host processor for some predetermined interval, for example 200ms. This condition is detected by a trickle timer which functions as follows. The timer is merely a specified location TRKTMR in- control store 116. Each time the storage control unit 100 executes an idle loop, TRKTMR is fetched and incremented. The incrementing may take place, for example, as the first step (not shown) of the Idle routine illustrated in FIG. 5 of the present application. Each time a command (EF) is sent to the storage control unit 100 by the host processor and is recognized by the storage control unit, TRKTMR is fetched and reset. This operation may take place as the last step -of the Initial Selection routine illustrated in FIG. 68 of application Serial No. 207,152. The subsystem idle test at step 1176 of the present application merely involves testing the high order of TRKTMR. If it is set then the timer has trickle command then competes with other commands such as those placed therein as a result of a host processor read or write command in the same queue for the right to be executed by the storage control unit. This takes place during execution of the Find Command Queue Entry subroutine (step 604) after the Check Command Queue subroutine (step 502) first determines which command queue, associated with a non-busy device, has a command in its queue. Trickle commands are assigned priority by the Determine Trickle Priority subroutine which is called by the Find Command Queue Entry subroutine at step 604. The priority of a trickle command is determined by computing a first priority according to age since first write of the oldest written-to segment in the cache memory and computing a second priority based on the percentage of the segments in cache .memory that have been written to. The oldest timestamp in the timestamp table is saved in the cache memory ■ and updated as written-to segments are trickled to the disk drive devices. The host processor periodically reads this oldest timestamp which is saved by the host processor, preferably on a permanent storage medium such as a magnetic tape or disk so that it will not be lost by a power failure which also causes a cache failure. In the event of a cache failure, the host processor may use the last read oldest timestamp value _in order to determine what recovery procedures are required. While a preferred embodiment of the invention " has been described in specific detail, it will be obvious to those skilled in the art that various substitutions and modifications may be made in the disclosed embodiment without departing from the spirit and scope of the invention as defined by the appended claims.

Claims: What is claimed is: 1. In a cache/disk subsystem responsive to commands from a host processor, the combination comprising: disk drive means for storing data; a cache memory; and 5 control means for controlling the transfer of data between said host processor, said cache memory and said disk drive means; said control means being operative to cause disk data likely to be used in executing host processor 10 ■ commands to be stored in said cache memory; said control means being operative to provide for execution of a host processor command using disk data stored in said cache memory without having to wait for accessing of said disk drive means; 15 said control means being operative to provide for accessing said disk drive means in response to a command requiring disk access; said control means including a command queue and being operative to provide for storing therein a " 20 plurality of commands requiring disk access but not yet executed, each such command corresponding to a specified disk space of said disk drive means; said control means being capable of providing for 25 selecting a next command to be .executed from a plurality of commands stored in said command queue on a basis which takes into account the times required by the disk drive means to access the starting locations of the specified disk 30 spaces of said plurality of commands. 2. The invention in accordance with Claim 1, wherein said cache memory includes first data transferred thereto from said host processor which has not been transferred to said disk drive means, and herein said control means provides for forming a command directing the transfer of said first data to its specified disk space of said disk drive means and for storing this formed command in said command queue. 3. The invention in accordance with Claim 1 or 2, - wherein commands stored in said command queue have an assigned priority, and wherein said control means is also capable of providing for selecting a next command to be executed from a plurality of commands stored in said command queue on a basis which takes command priority into account. 4. The invention in accordance with Claim 3, wherein said control means is able to take into account the length of time a command has been stored in said command storage means in selecting the next command to be executed. 5. The invention in accordance with Claim 1 or 2, wherein said disk drive means, comprises at least one rotating disk and at least ofte radially movable transducer cooperating therewith, and " wherein the time required by said disk drive means to reach the starting location of the specified disk space indicated by a command stored in said command storage means takes into account the time required for its respective transducer to be positioned to the corresponding radial position of its respective disk and also the time required for the respective disk to • rotate to a position such that the beginning of the specified disk space is in transducing relation with its respective transducer. 6. The invention in accordance with Claim 3, wherein said control means takes into account the number of commands awaiting execution in said command queue in determining which basis to use for next command selection. 7. The invention in accordance with Claim 6, wherein said control means does not permit use of said disk access basis for selecting the next command to be executed when less than a predetermined number of commands are awaiting execution in said command queue. 8. The invention in accordance with Claim 7, wherein said control means is operative such that, when determining a next command to be selected for execution using said disk access basis, the encountering of a command having greater than a predetermined priority level w ill cause said control means to select this command as the next command to be executed. 9. The invention in accordance with Claim 7, wherein sai d control means is operative such that, when determining a next command to be selected for execution using said disk access basis, the encountering of a command which has remained unselected a predetermined number of times will cause said control means to select this command as the next command to be executed. 10. T h e invention in accordance with Claim 1 or 2, wherein said disk drive means includes a plurality of disk drives, and wherein a like command queue is provided for each disk drive. 11. In a cache/disk subsystem responsive .to commands from one or more host processors, said cache/disk su b system including a cache memory and a plurality of disk drives, a method • comprising: 5 providing a command queue for each disk drive for storing commands awaiting execution with respect to a specified disk space on that disk drive; storing host processor commands awaiting access to a disk drive in the corresponding command queue; 10 selecting a command for execution from a plurality of commands stored in a ' command queue on a basis which takes into account the times required by the corresponding disk drive to access the disk starting locations of the specified disk spaces 15 of said plurality of commands. 12. The invention in accordance with Claim 11, wherein said cache memory includes first data transferred thereto from said host processor which requires transfer to a specified disk space of a disk drive, said method ' 5 including forming a command directing the transfer of said first data to its specified disk space and storing this formed command in the respective command queue. 13. The invention in accordance with Claim 11 or 12, wherein commands stored in said command .queue have an assigned priority, and wherein the step of selecting is alternatively able to select a next command on the basis 5 of command priority. 14. The invention in accordance with Claim 13, wherein the step of selecting takes into account the number of commands awaiting execution " in a command queue in determining which basis to-use for selecting the next command to be executed.

Inventors: SWENSON ROBERT E, SWENSON, ROBERT, E.
Applicants: UNISYS CORP, UNISYS CORPORATION
Application year: 1988
Main classification: G06F12
IPC codes: G06F3, G06F12