# Patent

## Title
Swapping data storage volumes

## Abstract

A process that swaps physical storage volumes. The process performs a number of simple arithmetic operations to find a seek time for B new states of a disk. The number is of order B. Each new state is related to a current state of the disk by a swap with a selected external storage volume. The process also includes swapping one of the storage volumes of the disk with the selected storage volume in response to determining that the state produced by the swap has a smallest seek or access time among the new states.

## Background
TECHNICAL FIELD
This invention relates to data storage systems.
BACKGROUND
An access to a data storage disk proceeds via a sequence of acts that additively contribute to the time needed to complete the access. The sequence includes acts that physically align a disk's read-write head with the physical storage volume being accessed and acts that actually transfer data to or from the physically aligned storage volume.
The physical alignment typically involves two movements. One movement is a radial travel of the read-write head that aligns the head with a start track of the storage volume to be accessed. The average time for the head travel is referred to as the seek time. The other movement is a rotation of the disk that aligns the read-write head with a start sector of the storage volume to be accessed. The average time for the disk rotational movement is referred to as the rotational latency time.
The access time for a storage disk is the total time needed to complete the acts of the access. Thus, the access time is a sum of the seek time, the rotational latency time, and the actual time to transfer data. The seek time can however, provide the dominant contribution to the access time for many storage disks. Each contribution to the access time is dynamical and can depend on the state of both the disk and the applications using the disk.
The dynamical nature of the contributions to the access time is illustrated by the seek time. The seek time depends on access patterns for individual storage volumes of the disk. If the access pattern includes many consecutive accesses to the same physical storage volume, the seek time will be small. If the access pattern includes many consecutive accesses to new physical storage volumes, the seek time will be large. Determining the seek time usually requires measurements of access activity data for the physical storage volumes of the disk.
SUMMARY
In a first aspect, the invention features a process that swaps physical storage volumes. The process performs a number of simple arithmetic operations to find a seek time for B new states of a disk. The number is of order B. Each new state is related to a current state of the disk by a swap with a selected external storage volume. The process also includes swapping one of the storage volumes of the disk with the selected external storage volume in response to determining that the state produced by the swapping has a smallest seek or access time for the new states.
In various embodiments, B may be a number of order N or of order N2 where N is equal to the number of storage volumes on the disk.
In some embodiments, the act of performing includes finding a plurality of numerical objects from activity data for the current state and determining the seek time of each new state from the found numerical objects and an activity of the selected storage volume. Each act of determining may obtain a seek time by performing of order one simple arithmetic operations. The act of finding may obtain the numerical objects by performing X simple arithmetic operations. X is of order of the number of storage volumes on the disk.
In some embodiments, the act of performing includes summing component seek times to obtain the seek time for each new state. Each component seek time is associated with a reference head travel time function.
In other embodiments, each seek time corresponds to a head travel time function having a form α|j−k| of a form K|j−k|.
In a second aspect, the invention features a process for swapping storage volumes. The process includes performing X simple arithmetic operations to find a seek or access time for B new states based on Wong's formula for a disk having N physical storage volumes. X is less than B times N2, and each new state is related to a current state of the disk by a swap with a selected external storage volume. The process also includes swapping one of the storage volumes of the disk with the selected storage volume in response to determining that the state produced by the swapping has the smallest seek or access time for the new states.
In some embodiments, the selected storage volume has one of the lowest activities on the second disk prior to the swapping, and the access time of the second disk is lower that the access time of the disk prior to the swapping.
In some embodiments, the act of performing includes finding a plurality of numerical objects from activity data of the current state and determining the seek time of each new state from the found numerical objects by performing less simple arithmetic operations than there are physical storage volumes on the disk. The act of finding numerical objects performs less simple arithmetic operations than a square of the number of physical storage volumes on the disk.
In some embodiments, the act of performing includes finding a plurality of numerical objects from activity data for the current state and determining the seek time of each new state from the found numerical objects. Each act of determining obtains a seek time by performing of order one simple arithmetic operations.
In some embodiments, the act of performing includes summing component seek times to obtain the seek time for each new state. Each component seek time is a seek time associated with a reference head travel time function.
In some embodiments, each act of determining a seek time of a new state produced by swapping volume “p” evaluates {SF+Δ2tpp+Δ[Rp+R*p]}/{F+Δ}. The “S” and “F” are the respective seek time and total activity of the current state. The Rp=Σj=1, . . . NTp,jaj. The Δ is a difference of a new activity and an original activity of the storage volume “p”.
In a third aspect, the invention features a process that collects activity data on a current state of a disk, finds a plurality of numerical objects from collected activity data, and then determines seek times for B new states from the found numerical objects. Each new state is related to the current state by a swap of a storage volume of the disk with the selected external storage volume. The seek times corresponding to a reference head travel time function.
In some embodiments, the act of determining performs of order B simple arithmetic operations to obtain the seek times.
In some embodiments, the act of determining obtains B seek times by performing less than B times N simple arithmetic operations. N is the number of physical storage volumes on the disk. The act of finding obtains the numerical objects by performing less than N times N simple arithmetic operations.
In some embodiments, the act of finding evaluates the numerical objects by performing of order N simple algebraic operations with N equal to the number of storage volumes on the disk.
In some embodiments, the act of finding a plurality of numerical objects includes evaluating a set of equations {Rj+1=(Rj+aj)tRefp+1,p} for a vector object R. The “tRefp+1,p” are numbers, and each aj is an activity of the storage volume with index “j” in the current state.
In a fourth aspect, the invention features a program storage media storing a computer executable program of instructions. The instructions cause a computer to perform one or more of the above-described processes.
In a fifth aspect, the invention features a system that has means for performing of order B simple arithmetic operations to find a seek time for B new states of a disk. Each new state is related to a current state of the disk by a swap with a selected external storage volume. The system also includes means for swapping one of the storage volumes of the disk with the selected external storage volume in response to determining that the state produced has a smallest seek time or total access time for the new states.
In various embodiments, B is a number whose order N or N2. The disk has N storage volumes.
In various embodiments, each seek time corresponds to a head travel time function of the form α|j−k| or of the form K|j−k|.
Other features and advantages of the invention will be apparent from the detailed description and claims.



DESCRIPTION OF DRAWINGS
FIG. 1 shows a high-capacity data storage device;
FIG. 2 is a top view of one storage surface of the data storage device of FIG. 1;
FIG. 3 is a flow chart showing a process for calculating a seek time of a physical disk;
FIG. 4 is a flow chart showing a process for calculating a seek time associated with a reference head travel time function;
FIG. 5 is a flow chart for a process that evaluates one contribution to the seek time of FIG. 4; and
FIG. 6 shows a monitoring system that calculates disk seek times and controls inter-disk and/or intra-disk swaps;
FIG. 7 shows a storage subsystem that has multiple physical disks;
FIG. 8A is a flow chart for a process that reduces seek times of a set of physical storage disks by performing inter-disk swaps;
FIG. 8B is a flow chart for a process that reduces total access times of a set of physical storage disks by performing inter-disk swaps;
FIG. 9 is a flow chart for a process that rates inter-disk swap qualities;
FIG. 10 is a flow chart for a process that determines a threshold value used to rate a swap's quality in the process of FIG. 9;
FIG. 11 is a flow chart showing a process for calculating seek time reductions produced by inter-disk swaps;
FIG. 12 is a flow chart for a process that calculates new seek times produced by inter-disk swaps for reference travel time functions;
FIG. 13 is a flow chart for an alternate process that calculates new seek times produced by inter-disk swaps for reference travel time functions;
FIG. 14A is a flow chart for a process that reduces a disk's seek time by performing an intra-disk swap;
FIG. 14B is a flow chart for an alternate process that reduces a disk's seek time by performing an intra-disk swap;
FIG. 15 is a flow chart for a process that calculates seek time reductions produced by intra-disk swaps for a reference travel time function; and
FIG. 16 is a flow chart for a process that calculates seek time reductions produced by intra-disk swaps.



DETAILED DESCRIPTION
This application incorporates U.S. patent application Ser. No. 09/442,884, filed Nov. 18, 1999 by reference in its entirety.
This application incorporates U.S. patent application Ser. No. 09/396,146; U.S. patent application Ser. No. 09/396,253; “Load Balancing on Disk Array Storage Device”, by Eitan Bachmat et al; U.S. patent application Ser. No. 09/396,218, “Method for the Transparent Exchange of Logical Volumes in a Disk Array”, by Musik Schreiber et al; U.S. patent application Ser. No. 09/396,275, “Maximizing Sequential Output in a Disk Array Storage Device”, by Eitan Bachmat et al; and U.S. patent application Ser. No. 09/396,217, “Method for Analyzing Disk Seek Times in a Disk Array Storage Device”, by Tao Kai Lam et al; all filed Sep. 15, 1999 by reference in their entirety.
FIG. 1 is a side view of a high-capacity data storage device 10. The high-capacity data storage device 10 has a stack of physical storage disks or plattens 12-14. Each physical storage disk 12-14 has one read-write head 15-20 per storage surface 0-5. The read-write heads 15-20 rigidly attach to an arm 24, which moves the heads 15-20 toward or away from an axis 26 of the physical storage disks 12-14. The axis 26 can rotate the stack of physical disks 12-14 in the indicated sense.
FIG. 2 is a top view of a data storage surface 28 of one of the physical storage disks 12-14 shown in FIG. 1. The storage surface 28 has multiple physical storage volumes A-C. Each physical storage volume A-C is a region defined by a range of radial distances, i.e., tracks, with respect to a rotational axis 30. The various storage volumes A-C may have different sizes.
To access one of the physical storage volumes A-C, a read-write head 32 for the surface 28 is physically aligned over the volume A-C being accessed. The alignment involves radial travel of read-write head 32, e.g., under control of the arm 24 of FIG. 1, and rotation of the storage surface 28 about the rotational axis 30. The radial and rotational movements align the read-write head 32 with starting track and starting angular sector, respectively, for the physical storage volume A-C being accessed.
Accesses to the read-write head 32 are monitored by an external system 34, which collects data on activities “aA-aC” of the individual storage volumes A-C. The activities {aj} are weighted averages of numbers of reads from, writes to, and sequential prefetches from the associated physical storage volumes “j” during time periods of preselected length. In various embodiments, the weights in the average defining the activities “aA to aC” differ. By using the activities “aA-aC” of the physical storage volumes A-C of the storage surface 28, the seek time “S” of read-write head 32 of the surface 28 can be determined.
Similarly, transfer times can be determined by monitoring amounts of data transferred in accesses.
Herein, a physical storage volume, j, refers to a physically connected portion of a storage device for which activity data, aj, is separately collected. One physical storage volume may include one logical volume, several, or a portion of a logical volume of the storage device.
Seek times, rotational latency times, and transfer times provide useful performance measures for a physical storage disk. These times may be compared to standards to obtain a measure of the disk's performance. These times may also be used as a measure for determining how to accommodate heavy access loads. For example, data may be moved to volumes or disks for which these times are lower, and/or access queue depths may be lengthened in response to these times being high. If one of the seek time, rotational latency time, and transfer time becomes long, total access times become long and applications using the disk may run slowly.
Seek Times
Wong has provided a formula for calculating the seek time, S, of a physical storage disk. Wong's formula is described in Algorithmic Studies of Mass Storage Systems, by C. K. Wong (Computer Science Press, 1983). For a physical storage disk having “N” physical storage volumes, Wong's formula is: 



  S
  =
  
    
      ∑
      
        k
        ,
        
          j
          =
          1
        
        ,
        
          ...
          ⁢
          
             
          
          ⁢
          N
        
      
    
    ⁢
    
       
    
    ⁢
    
      
        a
        k
      
      ⁢
      
        a
        j
      
      ⁢
      
        
          
            t
            kj
          
          ⁡
          
            [
            
              
                ∑
                
                  
                    r
                    =
                    1
                  
                  ,
                  
                    ...
                    ⁢
                    
                       
                    
                    ⁢
                    N
                  
                
              
              ⁢
              
                 
              
              ⁢
              
                a
                r
              
            
            ]
          
        
        
          -
          1
        
      
    
  




Here, tkj is the travel time function of the access head, e.g., a read-write head, between the storage volumes “k” and “j”. Wong assumed that tkj=dkj with dkj being the distance between volumes “k” and “j”, e.g., dkj is proportional to |k−j| for disks with equal size storage volumes.

In Wong's formula, each sum runs over the “N” physical storage volumes of the physical storage disk that the access head serves. For a disk with N physical storage volumes, a straightforward calculation of the seek time, S, involves of order N2 simple arithmetic operations.
Herein, simple arithmetic operations are additions, subtractions, multiplications, and divisions of two numbers. The order of a set of simple arithmetic operations provides a range-type evaluation of the number of operations. Order N refers to ranges of numbers defined by QN where the constant Q is much smaller than N2 and much larger than N−1. Similarly, order 1 and order N2 refer to ranges of numbers defined by Q and QN2, respectively.
Often, for a computer program segment, the order of the number of simple arithmetic operations executed can be determined from the numbers of nested loops in the program segment. A program segment with zero, one, and two nested loops has of order 1, N, and N2 operations, respectively, if the inner loop of the program segment has a fixed number of operations and each loop is performed approximately N times. For example, a naive and direct evaluation of 



  
    ∑
    
      k
      ,
      
        j
        =
        1
      
      ,
      
        ...
        ⁢
        
           
        
        ⁢
        N
      
    
  
  ⁢
  
     
  
  ⁢
  
    
      a
      k
    
    ⁢
    
      a
      j
    
    ⁢
    
      t
      kj
    
  




involves of order N2 simple arithmetic operations due to the double sum, i.e., two loops. The actual number of simple arithmetic operations is about 3N2, because both additions and multiplications are involved, i.e., 3N2 is or order N2.

Seek times can be used to monitor disk performance and to control data swaps used to balance access burdens of different storage devices. But, performing N2 simple arithmetic operations to obtain a seek time is burdensome for some of these applications and may limit the uses of seek times. The burden associated with calculating seek times becomes more important as technology produces larger storage disks, which support more physical storage volumes.
The evaluation of seek times is based on a form of an access head's travel time function. For different types of data storage devices, the head travel time function, tkj, between storage volumes “k” and “j” has different forms.
For successive accesses to the same and to different physical volumes, the head travel time functions generally differ. One form for the head travel time function that allows for differences is given by:

tkj=xj, for j=k, and tkj=x0, for j≠k.

Here, the xj's and the x0 are constants. For successive accesses to different storage volumes “k” and “j”, the head travel time can also depend on the distance between the volumes, i.e., be proportional to |k−i|.

Some forms for the head travel time function allow for dependence on distances between successively accessed storage volumes. If constant movement dominates head travel, the head travel time function can often be described by the form:

tkj=xj, for j=k, and tkj=K|j−k|, for j≠k.

Here, “K” is a constant. This form provides a description of head travel in magnetic tape storage devices. In such devices, a large component of the head travel involves winding or unwinding a length of magnetic tape at a relatively constant speed.

In storage disks, hesitation and acceleration are also important components of head travel. These motions make head travel times between storage volumes “j” and “k” more complicated functions of the distance, i.e., complicated functions of |j−k|. For storage disks one form for the head travel time function is given by:

tkj=xj, for j=k, and tkj=α|j−k| for j≠k.

Henceforth, for a selected value of α, this form is referred to as a reference travel time function, tkjRef. The number α defines the particular reference travel time function, tkjRef, and may be a real or a complex number. For α=1, the associated reference travel time function is independent of distance between the storage volumes “j” and “k”. For a set of values of α, the reference travel time functions, tkjRef(n), can provide a series approximation to other head travel functions. Using a series often provides better approximations to the travel times of real access heads.

One series approximation uses two or three real values for α. For the two-term approximation, the head travel time function has the form:

tkj=xj, for j=k, and tkj=d0+dαα|j−k| for j≠k.

The value of the number α is set empirically, and the constants d0 and dα are found through a least squares optimization process. The least squares optimization process minimizes the average square error between the actual head travel time function and the series approximation to the head travel time function. The number of terms in the series may be increased to better fit the actual head travel time function. For example, the series may also use several α's having different values at the expense of heavier computational effort.

Another series expansion uses a set of complex values of α to approximate to the head travel time function. This series expansion provides a discrete Fourier series approximation. Discrete Fourier series are known to persons of skill in the art.
For some forms of the head travel time functions, tkj, fewer operations are needed to calculate a seek time. For head travel time functions tkj having the form K|k−j|, Wong has shown that a seek time can be found by performing substantially less than N2 simple arithmetic operations, i.e., of order N such operations. As was mentioned above, the form K|k−j| provides a good approximation to head travel time functions for magnetic tapes where travel time functions are distances to wind or unwind a portion of the tape. The same form does not, however, well approximate head travel time functions of many storage disks where hesitation and acceleration form important portions of the head travel. In storage disks, travel time functions represent distances to move a head between different radial tracks.
Even for storage disks, the head travel time function, tkj, is still a “real” function depending on the distance between pairs of physical storage volumes “k” and “j”, i.e., a function of |k−j|. Functions of |k−j| can be expanded in a discrete Fourier series. For the head travel time function, tkj, the discrete Fourier series takes the form:

tkj=d0+Σn=±1, ±2, . . . [N−1]/2 dn exp{i2πn|k−j|/N} with d−n=d+n*.

The smoothness of the dependence of the head travel time function on distance or |k−j| implies that the discrete Fourier series will rapidly converge to tkj. Often, the lowest terms provide a good approximation to tkj. Thus, for many physical storage disks, a good approximation to the head travel time function is given by:

tkjapprox=d0+d+1 exp{+i2π|k−j|/N}+d+1* exp{−i2πn|k−j|/N}.

For other physical storage disks, a few terms in the discrete Fourier series for the head travel time function provide a good approximation to the actual head travel time function.

Fast Evaluation of Seek Times
For special forms of head travel time function, tkj, Wong's formula may be evaluated faster by a process that entails substantially fewer simple arithmetic operations, i.e., less than of order N2 simple arithmetic operations. The special forms include “reference” travel time functions, tkjRef, which have the form:

tkj=xj for k=j and tkj=α|j−k| for k≠j.

Here, |k−j| is proportional to the distance between physical storage volumes “k” and “j”. Both the number α and the xj's are independent of |k−j|. Reference travel time functions of the form exp{±i2πn|k−j|/N} form a basis set for a discrete Fourier expansion of a head travel time function. Since the head travel time function is real, the expansion includes exp{±i2πn|k−j|/N}'s with both signs in the exponent. For real head travel time functions, the set {1, α(1)|j−k|, α(2)|j−k|} in which α(1) and α(2) are real numbers forms another basis set of reference travel time functions.

FIG. 3 is a flow chart for a process 40 that calculates seek times of physical storage disks. The process 40 collects data on the activities, aj, of each physical storage volume, j, of the disk during a collection period (step 42). The process 40 receives measurements or external data that provides the form of the disk's real head travel time function, tkj (step 44). The process 40 determines a set of coefficients, dn, of an approximate expansion of the real head travel time function, tkj, in terms of a set of “m” reference travel time functions, tkjRef(n) (step 46). The approximate expansion has the form:

tkj=Σn=1, . . . ,mdntkjRef(n)

If the reference travel time functions are low modes in a discrete Fourier basis, the coefficients, dn, are determined by known processes for discrete Fourier series. If the reference travel time functions are the set {1, α(1)|j−k|, α(2)|j−k|} with α(1) and α(2) real numbers, the coefficients, dn, can be determined by an optimization process, e.g., least squares optimization.

For each reference travel time function, tkjRef(n), the process 40 calculates a seek time, SRef(n), using Wong's formula (step 48). The process 40 calculates a portion of each seek time, SRef(n), using a recursive technique that reduces the number of simple arithmetic operations needed from order N2 to order N.
From the seek times, SRef(n), of the reference travel time functions, tkjRef(n), the process 40 calculates the seek time, S, for the disk's real access head by linear superposition (step 50). The weights of the superposition are the expansion coefficients, dn, for the disk head's travel time function, tkj, in terms of the reference travel time functions, tkjRef(n). The seek time, S, of the actual access head takes the form:

S=Σn=1, . . . mdnSRef(n)

The head seek time, S, is a sum over seek times, SRef(n), corresponding to reference travel time functions, because Wong's formula is linear in the head travel time function.

The process 40 uses the calculated seek time, S, to perform a data management function (step 52). The data management function may provide performance data on the associated storage disk, adjust a length of a data access queue, and/or swap data between different physical storage volumes. The data management functions may also depend on information other than seek times, for example, rotational latency times, priorities, and transfer times.
FIG. 4 is a flow chart for a process 60 that evaluates seek times, SRef(n)'s of the reference travel time functions, tkjRef(n). The process 60 uses a matrix decomposition of the travel time function matrix T. In matrix form, a travel time function matrix T and an activity column vector a have components:

Tkj=tkj and aj=aj with k,j=1, . . . , N.

In terms of T and a, Wong's formula takes the form:

 S=aTTa/Σj=1, . . . Naj.

The matrix form of Wong's formula can be split into several pieces based on properties of matrices.

To evaluate Wong's formula, the matrix T is written as a sum of upper triangular matrix U, diagonal matrix D, and lower triangular matrix L as follows:

T=U+D+L.

Using this decomposition of T, Wong's equation becomes:

S=aT(U+D+L)a/Σj=1, . . . Naj=[aTUa+aTDa+aTLa]/Σj=1, . . . Naj=[aT(L+L*)a+aTDa]/Σj=1, . . . Naj.

The last equality follows, because T is a Hermitian matrix, i.e., T=T†, and the activity vector a is real. The matrix T is a symmetric matrix for real head travel time functions.

The seek time, S, is a function of the matrix products H=aTLa, G=aTDa, and F=Σj=1, . . . Naj. From collected activity data, the process 60 evaluates the products F and G directly as sums of N terms (steps 62, 64). As sums the products F and G have the forms:

F=Σj=1, . . . Naj and G=Σj=1, . . . Nxjajaj.

Both F and G have N terms, because they involve single sums over the set of physical storage volumes. On the other hand, the product H involves a double sum having N(N−1)/2 terms, i.e., order N2 terms. To reduce the number of simple arithmetic operations needed to evaluate this term, the process 60 evaluates H by a recursive procedure, which entails only of order N simple arithmetic operations (step 66). The recursive procedure relies on the special form of the reference travel time functions, tkjRef(n). The evaluations of F, G, and H may be performed in parallel.

From the calculations of F, G, and H, the process 60 evaluates the formula:

SRef=[H+H*+G]/F

to determine the seek time, SRef, associated with a reference travel time function tkjRef(n) (step 68). The entire process 60 to find, S, involves of order N simple arithmetic operations, because the individual evaluations of F, G, and H involved of order N simple arithmetic operations for reference travel time functions, tkjRef(n).

For reference travel time functions, tkjRef(n), the quantity H involves a lower diagonal matrix L having a special form. The matrix L has the form: 



  L
  =
  
    
      [
      
        
          
            
              0
              ,
              ...
            
          
        
        
          
            
              α
              ,
              0
              ,
              ...
            
          
        
        
          
            
              
                α
                2
              
              ,
              α
              ,
              0
              ,
              ...
            
          
        
        
          
            
              
                α
                3
              
              ,
              
                α
                2
              
              ,
              α
              ,
              0
              ,
            
          
        
        
          
            ...
          
        
        
          
            
              
                α
                
                  N
                  -
                  1
                
              
              ,
              
                α
                
                  N
                  -
                  2
                
              
              ,
              ...
              ⁢
              
                 
              
              ,
              0
              ,
              ...
            
          
        
      
      ]
    
    .
  




The matrix L and the activity vector a define a second vector object R by:



R=La or 



  
    [
    
      
        
          
            R
            1
          
        
      
      
        
          
            R
            2
          
        
      
      
        
          
            R
            3
          
        
      
      
        
          
            R
            4
          
        
      
      
        
          ...
        
      
      
        
          
            R
            N
          
        
      
    
    ]
  
  =
  
    
      [
      
        
          
            0
          
        
        
          
            
              α
              ⁢
              
                 
              
              ⁢
              
                a
                1
              
            
          
        
        
          
            
              
                
                  α
                  2
                
                ⁢
                
                  a
                  1
                
              
              +
              
                α
                ⁢
                
                   
                
                ⁢
                
                  a
                  2
                
              
            
          
        
        
          
            
              
                
                  α
                  3
                
                ⁢
                
                  a
                  1
                
              
              +
              
                
                  α
                  2
                
                ⁢
                
                  a
                  2
                
              
              +
              
                α
                ⁢
                
                   
                
                ⁢
                
                  a
                  3
                
              
            
          
        
        
          
            ...
          
        
        
          
            
              
                
                  α
                  
                    N
                    -
                    1
                  
                
                ⁢
                
                  a
                  1
                
              
              +
              
                
                  α
                  
                    N
                    -
                    2
                  
                
                ⁢
                
                  a
                  2
                
              
              +
              ...
              +
              
                α
                ⁢
                
                   
                
                ⁢
                
                  a
                  
                    N
                    -
                    1
                  
                
              
            
          
        
      
      ]
    
    .
  




The components of this equation provide a set of recursive equations in which Rj−1 defines Rj for each component “j” of the vector equation. The recursive equations are: 


  
    
      
        R
        1
      
      =
      0
    
    ,
    
      

    
    ⁢
    
      
        R
        2
      
      =
      
        α
        ⁡
        
          (
          
            
              R
              1
            
            +
            
              a
              1
            
          
          )
        
      
    
    ,
    
      

    
    ⁢
    
      
        R
        3
      
      =
      
        α
        ⁡
        
          (
          
            
              R
              2
            
            +
            
              a
              2
            
          
          )
        
      
    
    ,
    
      

    
    ⁢
    ⋮
  




  
    
      R
      N
    
    =
    
      
        α
        ⁡
        
          (
          
            
              R
              
                N
                -
                1
              
            
            +
            
              α
              
                N
                -
                1
              
            
          
          )
        
      
      .
    
  



From the recursive equations, the whole set of Rj's can be determined by performing of order N simple arithmetic operations.

FIG. 5 is a flow chart for a process 70 that evaluates the product H for a reference travel time function, tkjRef, from the recursive equations for the Rj. Using the values of the activities aj, the process 70 calculates the value of the lowest uncalculated Rj from the previously calculated value of the next lower Rj−1and aj−1, (step 72). The recursive calculation is based on the set of formulas:

Rj=(Rj−1+aj−1)α for j≧2.

The lowest equation for the set of formulas is based on R1=0. After evaluating an Rj, the process 70 determines if there is an Rj+1 remaining to calculate (step 74). If an Rj+1 remains, the process 70 loops back 75 to calculate the Rj+1. If no Rj+1 exists, that is j=N, the process 70 evaluates H as a sum over the entire set of previously calculated Rj's (step 76). In terms of the Rj's, H is evaluated from the formula:

H=aTR=Σj=2, . . . NajRj.

A straightforward evaluation of this formula involves of order N simple arithmetic operations. Since the recursive evaluation of the set of Rj's involved of order N simple arithmetic operations, the process 70 reduces the number of simple arithmetic operations from order N2 to order N.

As numbers, N, of physical storage volumes on storage disks grow the time needed to calculate seek times increases. The reduction in the number of arithmetic operations needed to find the product H, which the process 70 provides, can produce a significant timesaving for calculations of seek times.
FIG. 6 shows one embodiment 80 of the external system 34, shown in FIG. 2, that collects activity data, determines seek times, and may control swaps between physical disks of a high-capacity storage disk 82. The system 80 includes a computer 84 having an active memory 86, a disk drive 88, and an input/output port 90. The active memory 86 stores an executable program of instructions for determining seek times according to one or more of processes 40, 60 and 70 illustrated in FIGS. 3, 4, and 5, respectively. The program may also be stored in executable form on a program storage media 90, for example, an optical or magnetic disk, which is readable by the disk drive 88. The input/output port 92 receives activity data on accesses to physical storage surfaces of the high-capacity storage disk 82. The input/output port 92 may also send commands for swapping data volumes and/or changing access queue lengths to the high-capacity disk storage 82 based on calculated seek times.
Swapping Storage Volumes
FIG. 7 shows a simple storage subsystem 100 that has multiple physical storage disks 102-104. The disks 102-104 include physical storage volumes 106-111 and may have different access loads. To reduce the access loads of heavily accessed disks, a control system 114, such as system 80 of FIG. 6, can perform swaps of whole physical storage volumes 106-111 between the disks 102-104. Typically, reducing access loads of heavier accessed disks leads to the access loads of the various disks being more balanced.
A swap between a pair of storage volumes 106-111 moves the data stored on each member of the pair to the other member of the pair. Lines 116 and 118 illustrate data movement for an exemplary swap pair of storage volumes 108 and 111. A swap includes several physical moves of the data from each storage volume of the pair. The first moves copy the data from each volume of the pair to a temporary storage buffer. The second moves recopy the data from the temporary storage to the other volume of the pair. The use of a temporary storage buffer ensures that data availability is not compromised during the swap process. At each time during a swap one copy of the data being swapped is available to other applications, i.e., either the data in the original storage volumes or a copy of the data stored in the temporary storage buffer. The data moves occurring during a swap are further described in the U.S. Patent Applications incorporated by reference herein.
Swaps can exchange compatible pairs of physical storage volumes, that is, volumes having the same size and emulation. Emulations may take a constant key and data (CKD) format used by mainframe systems or a fixed block architecture (FBA) format used by UNIX and NT systems. But, swap compatibility constraints frequently leave additional freedom in the choice of swap volumes pairs. The remaining freedom may be used to select pairs of volumes that optimally reduce access loads of the disks participating in the swaps. Performing swaps that optimally reduce access loads more efficiently uses scarce resources needed to perform swaps, e.g., temporary buffer space and data transfer busses, and results in more rapid reductions of heavy access loads.
Herein, disk access loads are measured either by total access times or by seek times. The use of total access times is available in storage subsystems that provide monitoring data on both activities of physical storage volumes and amounts of data transferred during accesses.
FIG. 8A is a flow chart for a process 120 that swaps physical storage volumes between disks to reduce disk seek times in a storage subsystem. The process 120 selects a pair of physical disks that have the highest and the lowest seek times of a storage subsystem (step 122). To perform the selection, the process 120 sorts the physical disks of the storage subsystem on seek times.
Next, the process 120 selects a best storage volume to swap from the lowest seek time disk (step 124).
The best storage volume has the lowest or one of the lowest activities on the lowest seek time disk. Swapping the volume with the lowest activity produces the lowest new activity value on the highest seek time disk. The lowest new activity value produces the largest seek time reduction for the highest seek time disk. The largest reduction results, because Wong's formula gives a seek time that monotonically decreases as the activity of any volume of a disk decreases.
The monotonic dependence of seek time on individual volume activities can be shown from Wong's formula if the head travel time function satisfies a triangle inequality. The triangle inequality has the form:

tkr+trj≧tkj.

For head travel time functions satisfying this inequality, swapping the least active volume of the lowest seek time disk results in the largest seek time reduction for the highest seek time disk of the storage subsystem.

In other embodiments, the best volume of the lowest seek time disk is defined by its effect on the seek time of that disk. In this embodiment, swapping the best volume with a selected virtual volume having a high activity produces the largest reduction to the seek time of the lowest seek time disk.
The process 120 selects a best storage volume to swap from the highest seek time disk (step 126). To select the best storage volume, the process 120 calculates reductions in the seek time, δpS, of the disk, which would result from a swap of a storage volume “p” of the highest seek time disk. δpS is the seek time of a new state of the disk, which is produced by swapping storage volume p with the already selected storage volume of the lowest seek time disk, minus the seek time of the original state of the highest seek time disk.
The process 120 calculates δpS for each state produced by a single swap of a volume “p” of the highest seek time disk and the already selected volume of the lowest seek time disk. Prior to each swap defining a δpS, the disk is in the same original state wherein the disk's state is defined by a set of activity values for physical storage volumes of the disk. The process 120 identifies the storage volume “p” corresponding to the largest reduction to the seek time, δpS, that is, the maximum value in the set {δpS}, as the best swap volume of the highest seek time disk.
After selecting the pair of physical volumes to swap, the process 120 determines whether the swap has an above-threshold quality (step 128). The quality of a swap is determined by the size of seek time reduction that the swap produces for the highest seek time disk. If the reduction to the seek time has an above threshold value, the process 120 performs the swap of the selected pair of physical storage volumes (step 130). If the reduction does not have an above-threshold value, the process 120 does not perform the swap of the selected pair of storage volumes (step 132). After determining the quality of the selected swap, the process 120 loops back 133, 134 to repeat the selection process.
FIG. 8B is a flow chart for an alternate process 129 that performs inter-disk swaps of physical storage volumes to reduce disk total access times in a storage subsystem. The process 129 sorts the physical disks of the storage subsystem based on total access times. Then, the process 129 selects a pair of physical disks that have the respective highest and lowest total access times of the storage subsystem (step 130). Next, the process 129 selects a best storage volume to swap from the disk with the lowest total access time (step 131).
In one embodiment, the best storage volume has the lowest or one of the lowest activities on the disk with the lowest total access time. Swapping the least active volume ordinarily produces a swap that produces the best reduction to total access time for the disk with the highest total access time.
In other embodiments, the best volume of the disk with the lowest total access time is defined by its effect on the total access time of that disk. In this embodiment, swapping the best volume with a selected virtual volume having a high activity produces the largest reduction to the total access time of the disk with lowest total access time.
The process 129 selects a best storage volume to swap from the disk with highest total access time (step 132). To select the best storage volume, the process 129 calculates reductions in total access time, δ′pS, of the disk, which would result from a swap of a storage volume “p” of the disk with highest total access time. The total access time is the sum of the seek, rotational latency, and data transfer times. δ′pS is the total access time of a new state of the disk, which is produced by swapping storage volume p with the already selected storage volume of the disk with lowest total access time, minus the total access time of the original state of the disk with highest total access time.
The process 129 calculates δp′S for each state produced by a single swap of a volume “p” of the highest total access time disk and the already selected volume of the lowest total access time disk. Prior to each swap defining a δp′S, the disk is in the same original state. For this embodiment, a disk's state is defined by a set of collected activity values and data transfer quantities for physical storage volumes of the disk. The process 129 identifies the storage volume “p” that produces the largest reduction to the total access time, δp′S, that is, the maximum value in the set {δp′S}, as the best swap volume of the disk with highest total access time. The process 129 performs and inter-disk swap of the selected pair of physical storage volumes (step 133).
FIG. 9 is a flow chart for a process 136 that rates the quality of a selected swap for process 120 of FIG. 8. To rate a swap's quality, the process 136 calculates a best seek time reduction (BSTR) that is potentially obtainable for the highest seek time disk through a single swap (step 138). The BSTR is an upper bound that limits any actual seek time reductions resulting from a single swap.
After calculating the BSTR, the process 136 determines whether the selected swap will reduce the seek time of the highest seek time disk by at least a preselected percentage of the BSTR (step 140). The process 136 calculates the seek time reduction for the selected swap from the Wong's formula and activity data. If the seek time reduction produced by the selected swap is as large as the preselected percentage of BSTR, the quality of the selected swap is high, and the swap is performed (step 130). If the reduction to the seek time produced by the selected swap is not as large as the preselected percentage of BSTR, the quality of the selected swap is low, and the swap is not performed (step 132).
FIG. 10 shows a process 142 for finding the BSTR used to rate swap quality. To determine the BSTR, the process 142 calculates a set of reductions to the seek time {δp,virtualS} of the highest seek time disk (step 144). Herein, each δp,virtualS is the seek time reduction for the highest seek time disk that is produced by swapping a storage volume “p” of the disk with an external virtual storage volume. The external virtual storage volume has zero activity. Thus, swapping the virtual volume produces the lowest possible activity in the highest seek time disk. Swapping the virtual storage volume produces the best seek time reduction for the highest seek time disk that is obtainable through a swap of storage volume “p”.
The calculation of each δp,virtualS is based on a new activity vector a(p) of the highest seek time disk, which is produced by a swapping the volume “p” and the virtual storage volume. The components, a(p)k, of the new activity vector, a(p), are given by:

a(p)k=ak, for k≠p, and a(p)k=0, for k=p.

Here, a is the activity vector of the highest seek time disk prior to the swap. The process 142 calculates the set of seek time reductions {δp,virtualS} from Wong's formula.

After calculating the potential seek time reductions {δp,virtualS} for each volume “p”, the process 142 selects largest member in the set {δp,virtualS} to be BSTR (step 146). Thus, the BSTR is the largest seek time reduction that can be achieved for the highest seek time disk through any swap with an external storage volume.
Since the BSTR is caused by a particular swap, the BSTR provides a relative process for rating a swap's quality with respect to a reference swap. Relative rating differs from absolute rating, which bases a swap's quality on the total seek time reduction produced. For a larger disk, the relative rating process, e.g., as used by process 136 of FIG. 9, naturally accounts for the fact that more swaps are frequently needed to achieve a selected absolute reduction to the disk's seek time. A rating process based on the BSTR is better suited for use with larger disks having many storage volumes and with storage subsystems having disks having different sizes.
Sets of seek time reductions, that is either {δpS} or {δp,virtualS}, can be calculated through fewer arithmetic operations if the travel time function between volumes “j” and “k” is a reference travel time function, tjkRef, having the form:
 tjkRef=α|j−k|.
Processes to calculate seek times associated with reference travel time functions are described above. Those processes evaluate Wong's formula by performing of order “N” simple arithmetic operations where “N” is the number of physical volumes on a physical disk.
FIG. 11 is a flow chart showing a process 150 that calculates seek time reductions produced by single swaps of disk storage volumes “p” with an external storage volume. The swap of storage volume “p” produces activity vector anew(p) whose p-th component differs from original activity vector a of the disk. The original activity vector a is determined from previously collected activity data for the disk. For the swap of volume “p”, the components, anew(p)k, of the new activity vector anew(p) have the form:

anew(p)k=ak, for k≠p, and anew(p)k=ap+Δ(p), for k=p.

Swapping the storage volume “p” changes anew(p)p by an amount Δ(p), which changes ap to the activity of the external volume prior to the swap, i.e., Δ(p)=−ap+aexternal volume.

To calculate a seek time of an access head, the process 150 obtains expansion coefficients, dn, for the access head's travel time function, tjk, over a set of the reference travel time functions, tjkRef(n) indexed by “n” (step 152). The coefficients, dn, may be obtained from a file listing the coefficients, dn, for various access heads, or may calculated from data on the actual travel time function for the disk's access head. The expansion takes the following form:

tkj=Σn=0, . . . mdntkjRef(n).

For each reference travel time function of the expansion set, the process 150 calculates the original seek time, Soriginal(n), from the original activity vector a (step 154). The process 150 evaluates the original seek times, Soriginal(n), for the reference travel time functions, tjkRef(n), using the fast processes 60 and 70, shown in FIGS. 4 and 5.

For each reference travel time function, tjkRef(n), of the set, the process 150 calculates a set of new seek times {Snew(n,p)} (step 156). Each Snew(n,p)} is associated with one of the new activity vectors in the set {anew(p)} that are produced by swapping single storage volumes of the disk with the external storage volume. The calculations of the new seek times, Snew(n,p), use Wong's equation and are described below. For each reference travel time function, tjkRef(n), the process 150 subtracts the original seek time, Soriginal(n), from each new seek time, Snew(n,p), to determine the seek time reduction, δS(n,p), associated with each swap (step 158).
The process 150 forms a set of weighted sums of the calculated seek time reductions, δS(n,p), for single swaps (step 160). Each sum is over the integer “n”, which indexes the expansion reference travel time functions, tjkRef(n). The sums provide the set of seek time reductions, e.g., δpS or δp, virtualS, for the real access head of the disk (step 158). The sums take the following form:

δS(p)=Σn=1, . . . mdnδS(n,p).

The form of δS(p) as a sum, which is weighted by expansion coefficients for the actual head travel time function, tjk, over the reference travel time functions, tjkRef(n), results from the linearity of Wong's equation in the travel time function.

Referring again to FIGS. 8 and 10, processes 120 and 142 perform process 150 to calculate seek time reductions that single swaps produce for the highest seek time disk. The process 120 performs the process 150 to calculate the set of seek time reductions {δpS} produced by swaps of storage volumes of the highest seek time disk with the selected external volume. The process 120 selects the best volume of the highest seek time disk to swap by comparing the δpS's. The process 142 performs the process 150 to calculate the set of seek time reductions {δp,virtualS} produced by swaps with the virtual volume having zero activity.
FIG. 12 is a flow chart for a process 160 that calculates a set of new seek times {Snew(n,p)} associated with reference travel time functions tRefkj(n). The new seek times result from single swaps of the storage volumes of a disk with a preselected external storage volume.
From the disk, the process 160 selects a physical storage volume “p” (step 162). For the selected volume “p”, the process 160 determines a new activity vector anew(p) that is produced by swapping of the selected volume “p” with the preselected external storage volume (step 164). The new activity anew(p) has components, anew(p)k, which are given by:

anew(p)k=ak, for k≠p, and anew(p)p=ap+Δ(p), for k=p.

Here, Δ=−ap+aexternal volume with aexternal volume equal to the activity of the preselected external volume and a equal to the original activity vector for the disk.

From the new activity vector anew(p), the process 160 calculates the new seek time Snew(n,p) by performing processes 50 and 60, shown in FIGS. 4 and 5 (step 166). The process 160 determines whether other storage volumes remain in the disk (step 168). If other storage volumes remain, the process loops back 170 to repeat the calculation of a new seek time associated with a swap between one of the remaining storage volumes and the preselected external volume. If other storage volumes do not remain, the process 160 stops.
The process 160 repeats steps 162, 164, 166, and 168 “N” times to determine the Snew(n,p) for each volume “p” of the disk. Each repetition of step 166 includes performing processes 50 and 60 of FIGS. 4 and 5, which involve doing of order “N” simple arithmetic operations. Thus, the process 160 performs of order N2 simple arithmetic operations to determine the set {Snew(n,p)} for each storage volume “p” on the disk.
FIG. 13 is a flow chart showing an alternate process 180 for calculating the set of new seek times {Snew(n,p)}. The alternate process 180 determines the entire set {Snew(n,p)} by performing of order N simple arithmetic operations. For large disks, this number is a much smaller than the number of operations performed by the process 160 of FIG. 12 to calculate the same set of seek times.
To describe the alternate process 180, Wong's formula is rewritten in a new form. The new form expresses Snew(n,p) in terms of the original activities {ak} of the disk and the change, Δ(p), to the activity vector. In terms of the original activities {ak} and Δ(p), Snew(n,p) is given by:

Snew(n,p)={aTTa+Δ(p)2Tpp+Δ(p) [Σk=1, . . . N[Tpk+T*pk]ak]}/{Σk=1, . . . Nak+Δ(p)}.

This formula can be rewritten in terms of previously described objects in the form:

Snew(n,p)={[Soriginal(n)]F+Δ(p)2tRefpp(n)+Δ(p) [Rp+R*p]}/{F+Δ(p)}.

The object F is the total activity of the disk, which is defined by:

F=Σk=1, . . . Nak.

For reference head travel time functions, tRefk,j(n), the (j+1)-th component, Rj+1, of object R is recursively defined by:

Rj+1=(Rj+aj)tRefj+1,j(n), for j≧1, and R1=0.

The N component vector object R was described in relation to processes 60 and 70 of FIGS. 4 and 5. Soriginal(n) is the seek time of the disk prior to the swap. Processes 60 and 70, shown in FIGS. 4 and 5, can calculate the objects R, F, and Soriginal(n) through of order N operations, and the results are independent of “p”.

The last formula for the new seek time, Snew(n,p), also holds for head travel time functions of the form:

tkj=xj, for j=k, and tkj=K|j−k|, for j≠k.

For head travel functions of this form, the vector object R is evaluated from the general definition Rk=Σj=1, . . . NTkj aj by a different procedure due to Wong. The procedure can also determine the objects R and Soriginal(n) by performing of order N simple arithmetic operations.

To determine the new seek time, Snew(n,p), the process 180 calculates the objects R, F, and Soriginal(n) by performing processes 60 and 70 with the activity data collected prior to the swap (step 182). The calculations of R, F, and Soriginal(n) use the original activities {ak} collected for the disk. The calculation of each component of the vector object R uses the recursive process 70, shown in FIG. 5. After calculating the objects R, F, and Soriginal(n), the process 180 selects a storage volume “p” of the disk (step 184). For the selected storage volume “p”, process 180 evaluates the above formula for Snew(n,p) using the previously calculated values of Soriginal(n), F, R and the diagonal components of the reference travel time function, tRefpp(n) (step 186). The process 180 determines whether new seek times, Snew(n,p), remain to be evaluated for other values of “p” (step 188). If other values of “p” remain, the process 180 loops 190 back to perform the evaluation for another storage volume of the disk. If other values of “p” do not remain, the process 180 stops.
In the process 180, the determination of objects Soriginal(n), F, and R entails of order N simple arithmetic operations. Furthermore, the evaluation of each seek time Snew(n,p) from these objects involves of order one simple arithmetic operations, because each evaluation does not involve summing over storage volumes of the disk. Thus, the process 180 calculates the entire set of new seek times {Snew(n,p)} for the N storage volumes of the disk by performing of order N simple arithmetic operations. Thus, evaluating new seek times has an amortized cost that equals of order one simple arithmetic operation per swap pair for which a new seek time is evaluated.
The process 180 determines the set {Snew(n,p)} used to select best swap volumes and to calculate the BSTR threshold by performing substantially fewer arithmetic computations. The lower number of needed arithmetic computations makes processes for finding best swaps more available to storage subsystems, e.g., the system 80 of FIG. 6, that swap data storage volumes to reduce disk access loads.
Swapping Storage Volumes on the Same Disk
The organization of storage volumes on a single disk can also influence the disk's total access time. For example, if the disk has two heavily accessed storage volumes that are far apart, the disk's access head may expend large amounts of time traveling between the two volumes. In such situations, moving the two heavily accessed storage volumes closer together can lower the disk's seek time and improve the disk's total access time.
FIG. 14A is a flow chart for a process 200 that performs an intra-disk swap to reduce the disk's seek time. The process 200 selects a storage volume “q” to swap (step 202). Next, the process 200 evaluates seek time reductions {δS(p,q)} produced by single intra-disk swaps of other storage volumes “p” with the selected volume “q” (step 204). The seek time reductions are calculated for single swaps between each volume of the disk and the selected volume. Next, the process 200 selects one of the disk volumes “p” based on a comparison of the seek time reductions {δS(p,q)} (step 206). The selected one of the volumes “p” produces the largest reduction to the disk's seek time when swapped with the previously selected volume “q”.
After selecting a pair of swap volumes indexed by (p,q), the process 200 determines whether the selected swap pair has a high quality (step 208). The quality is determined by comparing the seek time reduction produced by the selected swap to a predetermined threshold. High quality swaps produce above threshold seek time reductions. The threshold may be a seek time reduction produced by a swap with a predetermined external virtual swap as described in relation to FIG. 9. This type of threshold rates the quality of the selected intra-disk swap against another “single” swap. If the swap has a high quality rating, the process 200 performs the swap of the selected pair of physical storage volumes (step 210). If swap does not have a high quality rating, the process 200 does not perform the swap of the selected pair of storage volumes (step 212).
FIG. 14B shows a flow chart for an alternate process 214 for swapping physical storage volumes on the same disk to reduce the disk's seek time. The process 214 performs steps 202, 204, and 206, which have already been described in relation to the process 200 of FIG. 14A. After completing step 206, the process 214 records identities for the volumes of the selected swap pair and the associated seek time reduction in a file (step 216). Then, the process 214 determines whether a “best” swap volume has been selected for each storage volume of the disk (step 218). If there remain storage volumes for which a best swap volume have not been selected, the process 214 loops back 218 and repeats steps 202, 206, and 216 (step 220).
If the process 214 has selected a best swap volume for each storage volume, the process 214 has created a file that lists pairs of swap volumes indexed by (q,p) and associated reductions to the disk's seek time, δS(p,q). From the list, the process 214 selects the volume pair that produces the largest reduction to the disk seek time (step 222). A swap of the selected pair produces the largest reduction to the disk's seek time for an intra-disk swap. After selecting the best pair, the process 214 rates the selected pair's quality (step 224). The quality rating may based on a comparison of the seek time reduction associated with the swap to the seek time reduction available through a predetermined virtual swap as described with relation to FIG. 9. If the selected swap is of high quality, the process 214 performs the swap (step 226). If swap is not of high quality, the process 214 does not perform the swap (step 228).
As for inter-disk swaps, the set of seek time reductions {δS(p,q)} can be calculated through fewer simple arithmetic operations for special travel time functions. The special travel time functions include reference travel time function, tjkRef, which have the form:

tjkRef(n)=α(n)|j−k| and

other head travel time functions, tkj, of the form:

tkj=xj, for j=k, and tkj=K|j−k|, for j≠k.

Processes to calculate seek times associated with these special travel time functions have already been described.

FIG. 15 is a flow chart for a process 230 that calculates seek time reductions for a set of intra-disk swaps and a reference travel time function tjkRef(n). The process 230 calculates a set of seek time reductions {δS(n|p,q)} for single intra-disk swaps for a preselected set of pairs of storage volumes indexed by (p,q).
Process 230 may be described by rewriting the formula for a new seek time, Snew(n|p,q), produced by an intra-disk swap, in terms of the original activities, ak, of the disk. An intra-disk swap of storage volumes “p” and “q” produces a new activity vector anew(p,q). The new activity vector anew(p,q) has the form:

anew(p,q)=a+Δ(p,q) with

Δ(p,q)k=0, for k≠p, q;

Δ(p,q)p=aq−ap, for k=p; and

 Δ(p,q)q=ap−aq, for k=q.

The vectors anew(p,q) and a have p-th and q-th components interchanged because of the intra-disk swap of the storage volumes “p” and “q”.

Using the new activity vector anew(p,q), Wong's formula for the new seek time, Snew(n|p,q), is given by:

Snew(n|p,q)=anew(p,q)TTanew(p,q)/Σk=1, . . . Nanew(p,q)k.

This formula can be rearranged as follows:

Snew(n|p, q)

=[a+Δ(p,q)]TT[a+Δ(p,q)]/Σk=1, . . . Nak 

=[aTTa+Δ(p,q)TTa+aTTΔ(p,q)+Δ(p,q)TTΔ(p,q)]/F

=Soriginal(n)+[Δ(p,q)TR+RΔ(p,q)+Δ(p,q)TTΔ(p,q)]/F.

Here, Soriginal(n) is the disk's seek time prior to the swap. From the above form for Δ(p,q), δS(n|p,q) may be written as:

δS(n|p,q)=Snew(n|p,q)−Soriginal(n), or

δS(n|p,q)=[−(ap−aq)[Rp+Rp*−Rq−Rq*]+(ap−aq)2(Tpp+Tqq−2Tpq)]/F.

The object F is given by:

F=Σk=1, . . . Nak.

The k-th component of the vector object R is given by:

Rk=Σj=1, . . . NTkjaj.

For reference travel time functions, tRef(n), the vector object R is given recursively by:

Rj+1=(Rj+aj)tRefj+1,j(n), for j≧1, and R1=0.

For reference travel times, the objects “Rp” and F the evaluations of F and R were described in relation to processes 60 and 70 of FIGS. 4 and 5.

From the disk's original activity data, ak, process 230 calculates the objects R and F using recursive processes described in relation to FIGS. 4 and 5 (step 232). From the calculated values of the objects R and F and the original activity data a, the process 230 evaluates the above formula to calculate each δS(n|p,q) for the entire preselected set of intra-disk swap pairs (step 234).
In various embodiments the preselected set of swap pairs may include all pairs (p,q) of physical storage volumes on the disk or all pairs (p,q) for a selected physical storage volume “p”. In the former case, process 230 calculates the set of associated seek times reductions {δS(n|p,q)} by performing of order N2 simple arithmetic operations. In the later case, process 230 calculates the set of associated seek times reductions {δS(n|p,q)} by performing of order N simple arithmetic operations. In both cases, evaluating the set of reductions to seek times has an amortized cost equaling of order one simple arithmetic operation per swap pair (p,q) in the preselected set.
FIG. 16 is a flow chart for a process 240 that calculates seek time reductions produced by intra-disk swaps of a set of preselected swap pairs. The preselected swap pairs may include all pairs of storage volumes of the disk or all pairs for which the first member is a selected volume. To determine a seek time, the process 240 obtains expansion coefficients, dn, for the travel time function of the disk's actual access head, tjk, over a set of the reference travel time functions, tjkRef(n) indexed by “n” (step 242). The expansion has the form:

tkj=Σn=0, . . . mdntkjRef(n).

For each reference travel time function, tjkRef(n), the process 240 calculates the seek time reductions {δS(n|p,q)} for the entire set of preselected swap pairs according to the process 230 of FIG. 15 (step 244). To determine the seek time reductions for the real disk access head, the process 240 evaluates weighted sums of the calculated seek time reductions, δS(n|p,q) for the reference travel time functions (step 246). Each sum is over the integer “n”, which indexes the different reference travel time functions, tjkRef(n), appearing in the expansion of the disk's actual head travel time function. The sums provide the desired set of reductions to the seek times {δS(p,q)} for the real disk access head. Each sum takes the following form:

δS(p,q)=Σn=1, . . . mdnδS(n|p,q).

This sum is obtained from the expansion of the head function, tjk, in terms of the reference functions, tjkRef(n), and the linearity of Wong's equation in the travel time function.

Swaps on Disks with Several Volume Sizes
If a disk has physical storage volumes of several sizes, a storage subsystem can only swap an external physical storage volume with a portion of the disk's physical storage volumes, i.e., the volumes having the same size as the external volume. Though the storage subsystem can only swap a portion of its volumes with the external volume, Wong's formula for the new seek time produced by a swap still involves a sum over all physical storage volumes of the disk.
For disks with multiple sizes for physical storage volumes, processes 60 and 70 of FIGS. 4 and 5 still provide values for swap times if the disk head travel time function is a reference function tRefjk of the form:

tRefjk=α|Lj−Lk|.

Here, Lj and Lk are distances of the disk's j-th and k-th physical storage volumes from the center of the disk. |Lj−Lk| is the distance between the j-th and k-th physical storage volumes. This distance is proportional to |j−k| if all storage volumes have the same size. Otherwise, |Lj−Lk| is not be directly related to |j−k|. For such disks, the new form of the reference travel time function changes the equations for the vector object R.

For disks have multiple volume sizes, the vector object R is defined by a vector equation of the form: 



  
    [
    
      
        
          
            R
            1
          
        
      
      
        
          
            R
            2
          
        
      
      
        
          
            R
            3
          
        
      
      
        
          
            R
            4
          
        
      
      
        
          ...
        
      
      
        
          
            R
            N
          
        
      
    
    ]
  
  =
  
    
      [
      
        
          
            0
          
        
        
          
            
              
                α
                
                  
                    L
                    2
                  
                  -
                  
                    L
                    1
                  
                
              
              ⁢
              
                 
              
              ⁢
              
                a
                1
              
            
          
        
        
          
            
              
                
                  α
                  
                    
                      L
                      3
                    
                    -
                    
                      L
                      1
                    
                  
                
                ⁢
                
                  a
                  1
                
              
              +
              
                
                  α
                  
                    
                      L
                      3
                    
                    -
                    
                      L
                      2
                    
                  
                
                ⁢
                
                  a
                  2
                
              
            
          
        
        
          
            
              
                
                  α
                  
                    
                      L
                      4
                    
                    -
                    
                      L
                      1
                    
                  
                
                ⁢
                
                  a
                  1
                
              
              +
              
                
                  α
                  
                    
                      L
                      4
                    
                    -
                    
                      L
                      2
                    
                  
                
                ⁢
                
                  a
                  2
                
              
              +
              
                
                  α
                  
                    
                      L
                      4
                    
                    -
                    
                      L
                      3
                    
                  
                
                ⁢
                
                   
                
                ⁢
                
                  a
                  3
                
              
            
          
        
        
          
            ...
          
        
        
          
            
              
                
                  α
                  
                    
                      L
                      N
                    
                    -
                    
                      L
                      1
                    
                  
                
                ⁢
                
                  a
                  1
                
              
              +
              
                
                  α
                  
                    
                      L
                      N
                    
                    -
                    
                      L
                      2
                    
                  
                
                ⁢
                
                  a
                  2
                
              
              +
              ...
              +
              
                
                  
                    α
                    ⁢
                    
                       
                    
                  
                  
                    
                      L
                      N
                    
                    -
                    
                      L
                      
                        N
                        -
                        1
                      
                    
                  
                
                ⁢
                
                  a
                  
                    N
                    -
                    1
                  
                
              
            
          
        
      
      ]
    
    .
  




Again, the components of this equation provide a set of recursive equations in which Rj−1 defines Rjfor each component “j” of the vector equation. The recursive equations are: 


  
    
      
        R
        1
      
      =
      0
    
    ,
    
      

    
    ⁢
    
      
        R
        2
      
      =
      
        
          α
          
            
              L
              2
            
            -
            
              L
              1
            
          
        
        ⁡
        
          (
          
            
              R
              1
            
            +
            
              a
              1
            
          
          )
        
      
    
    ,
    
      

    
    ⁢
    
      
        R
        3
      
      =
      
        
          α
          
            
              L
              3
            
            -
            
              L
              2
            
          
        
        ⁡
        
          (
          
            
              R
              2
            
            +
            
              a
              2
            
          
          )
        
      
    
    ,
    
      

    
    ⁢
    ⋮
  




  
    
      R
      N
    
    =
    
      
        
          α
          
            
              L
              N
            
            -
            
              L
              
                N
                -
                1
              
            
          
        
        ⁡
        
          (
          
            
              R
              
                N
                -
                1
              
            
            +
            
              α
              
                N
                -
                1
              
            
          
          )
        
      
      .
    
  



From these equations, the entire set of Rj's can be found recursively by performing of order N simple arithmetic operations analogously to the case of a disk with a single size for physical storage volumes. By replacing earlier equations for the vector object R with these equations, previously described processes 60, 70, 160, 180, and 230 for inter-disk and intra-disk swaps can be applied to disks having physical storage volumes of multiple sizes.

Other additions, subtractions, and modifications of the described embodiments may be apparent to one of ordinary skill in the art.

## Claims

1. A process, comprising:
performing a number of simple arithmetic operations to find a seek time for B new states of a disk, the number being of order B, wherein B is of order N, the disk having N storage volumes, and each new state being related to a current state of the disk by a swap with a selected external storage volume, wherein the performing comprises finding a plurality of numerical objects from activity data for the current state and also determining the seek time of each new state from the found numerical objects and an activity of the selected storage volume, wherein each act of determining obtains a seek time by performing another number of simple arithmetic operations, the another number being of order one; and 
swapping one of the storage volumes of the disk with the selected storage volume in response to determining that the state produced by the swapping has a smallest seek time among the new states.

2. The process of claimed 1, wherein the finding obtains the numerical objects by performing X simple arithmetic operations, the X being of order of a number of storage volumes on the disk.

3. A process, comprising:
performing X simple arithmetic operations to find a seek time for B new states based on Wong's formula for a disk having N physical storage volumes, X being less than B times N2, each new state being related to a current state of the disk by a swap with a selected external storage volume on a second disk by finding a plurality of numerical objects from activity data of the current state; and 
determining the seek time of each new state from the found numerical objects by performing less simple arithmetic operations than there are physical storage volumes on the disk; and 
swapping one of the storage volumes of the disk with the selected storage volume in response to determining that the state produced by the swapping has a smallest seek time among the new states.

4. The process of claim 3, wherein the finding a plurality of numerical objects performs less simple arithmetic operations than a square of a number of physical storage volumes on the disk.

5. The process of claim 3, wherein in determining the seek time of each new state from the found numerical objects, each act of determining obtains a seek time by performing of order one simple arithmetic operations.

6. The process of claim 3, wherein the found plurality of numerical objects includes a vector object Ta, the T being a matrix whose components are values of a head travel time function, and the a being a vector whose components are activities of the current state of the disk.

7. The process of claim 3, wherein the finding a plurality of numerical objects comprises:
evaluating a set of equations {Rj+1=(Rj+aj)tRefp+1,p} for a vector object R, the “tRefp+1,p” being a number, each aj being an activity of the storage volume with index “j” in the current state.

8. The process of claim 3, wherein the determining the seek time of a new state produced by a swap of a storage volume “p” of the disk causes the computer to:
evaluate {SF+Δ2tpp+Δ[Rp+R*p]}/{F+Δ}, the “S” and “F” being respective seek time and total activity of the current state, the Rp=Σj=1, . . . NTp,jaj and the Δ being a difference of a new activity and an original activity of the storage volume “p”.

9. A process, comprising:
collecting activity data on a current state of a disk; 
finding a plurality of numerical objects from collected activity data by performing less than N times N simple arithmetic operations; and then, determining seek times for B new states from the found numerical objects by performing of order B simple arithmetic operations, each new state obtained from the current state by swapping a storage volume of the disk with the selected external storage volume, the seek times corresponding to a reference head travel time function and N being the number of physical storage volumes on the disk.

10. The process of claim 9, wherein the act of finding evaluates the numerical objects by performing of order N simple algebraic operations, the N being equal to a number of storage volumes on the disk.

11. The process of claim 9, wherein the reference head travel time function is a Fourier basis function.

12. The process of claim 9, wherein the reference head travel time function between a pair of the storage volumes is a weighted sum of numbers to powers of a distance between the pair.

13. The process of claim 9, wherein the finding a plurality of numerical objects comprises:
evaluating a set of equations {Rj+1=(Rj+aj)tRefp+1,p} for a vector object R, the “tRefp,p” being a number, each aj being an activity of the storage volume with index “j” in the current state.

14. A program storage media storing computer executable instructions, the instructions to cause a computer to:
perform a number of simple arithmetic operations to find a seek time for B new states of a disk, the number being of order B, each new state being related to a current state of the disk by a swap with a selected external storage volume, by finding a plurality of numerical objects from activity data for the current state and determining the seek time of each new state from the found numerical objects and an activity of the selected storage volume by performing another number of simple arithmetic operations, the another number being of order one; and 
swap one of the storage volumes of the disk with the selected storage volume in response to determining that the state produced by the swapping has one of a smallest seek time and a smallest access time among the new states.

15. The media of claim 14, wherein the instruction to find causes the computer to obtain the numerical objects by performing X simple arithmetic operations, the X being of order of a number of storage volumes on the disk.

16. A program storage media storing executable instructions for a process, the instructions to cause a computer to:
perform X simple arithmetic operations to find a seek time for B new states based on Wong's formula for a disk having N physical storage volumes, X being less than B times N2, each new state being related to a current state of the disk by a swap with a selected external storage volume on a second disk by finding a plurality of numerical objects from activity data of the current state; and 
determining the seek time of each new state from the found numerical objects by performing less simple arithmetic operations than there are physical storage volumes on the disk; and 
swap one of the storage volumes of the disk with the selected storage volume in response to determining that the state produced by the swapping has a smallest seek time among the new states.

17. The media of claim 16, wherein the instruction to find a plurality of numerical objects cause the computer to:
perform less simple arithmetic operations than a square of a number of physical storage volumes on the disk.

18. The media of claim 16, wherein the instruction to perform causes the computer to:
finding a plurality of numerical objects from activity data for the current state; and 
determining the seek time of each new state from the found numerical objects, each act of determining obtains a seek time by performing of order one simple arithmetic operations.

19. The media of claim 16, wherein the found plurality of numerical objects includes a vector object Ta, the T being a matrix whose components are values of a head travel time function, and the a being a vector whose components are activities of the current state of the disk.

20. The media of claim 16, wherein the instruction to find a plurality of numerical objects causes the computer to:
evaluate a set of equations {Rj+1=(Rj+aj)tRefp+1,p) for a vector object R, the “tRefp+1,p” being a number, each aj being an activity of the storage volume with index “j” in the current state.

21. The media of claim 16, wherein the instruction to determine the seek time of a new state produced by a swap of a storage volume “p” of the disk causes the computer to:
evaluate {SF+Δ2tpp+Δ[Rp+R*p]/{F+Δ}, the “S” and “F” being respective seek time and total activity of the current state, the Rp=Σj=1, . . . NTp,jaj, and the Δ being a difference of a new activity and an original activity of the storage volume “p”.