Source: http://www.google.com/patents/US6701392?dq=6680675
Timestamp: 2014-08-21 09:20:31
Document Index: 447583653

Matched Legal Cases: ['application No. 60', 'art 50', 'art 80', 'art 100', 'art 170', 'art 50', 'art 50', 'art 50', 'art 50', 'art 50', 'art 50']

Patent US6701392 - Hierarchical approach to indentifying changing device characteristics - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign in<nobr>Advanced Patent Search</nobr>PatentsDetermining device characteristics includes obtaining a first globally accessible value, if the first globally accessible value corresponds to a stored first value, obtaining device characteristics data from a relatively fast memory, if the first globally accessible value does not correspond to the stored...http://www.google.com/patents/US6701392?utm_source=gb-gplus-sharePatent US6701392 - Hierarchical approach to indentifying changing device characteristicsAdvanced Patent SearchPublication numberUS6701392 B1Publication typeGrantApplication numberUS 09/998,494Publication dateMar 2, 2004Filing dateNov 30, 2001Priority dateNov 14, 2001Fee statusPaidAlso published asDE60203773D1, DE60203773T2, EP1313018A1, EP1313018B1, US6810447, US20040133706Publication number09998494, 998494, US 6701392 B1, US 6701392B1, US-B1-6701392, US6701392 B1, US6701392B1InventorsMark J. Halstead, Adi Ofer, Dan ArnonOriginal AssigneeEmc CorporationExport CitationBiBTeX, EndNote, RefManPatent Citations (14), Referenced by (9), Classifications (19), Legal Events (4) External Links: USPTO, USPTO Assignment, EspacenetHierarchical approach to indentifying changing device characteristicsUS 6701392 B1Abstract Determining device characteristics includes obtaining a first globally accessible value, if the first globally accessible value corresponds to a stored first value, obtaining device characteristics data from a relatively fast memory, if the first globally accessible value does not correspond to the stored first value, obtaining a second globally accessible value, if the second globally accessible value corresponds to a stored second value, obtaining device characteristics data from a relatively fast memory, if the second globally accessible value does not correspond to the stored second value, obtaining device characteristics data from a relatively slow memory and updating the relatively fast memory, the stored first value, and the stored second value. The globally accessible first value may include device I/O information. The globally accessible values may be stored in global memory that is accessible to a plurality of processors.
What is claimed is: 1. A method of accessing a device, comprising:
obtaining status information that indicates how to access the device; examining at least a portion of the status information to determine if configuration of the device has changed; if the configuration of the device has not changed, accessing stored configuration data from a first memory, wherein the first memory is not accessible to all of a plurality of processors; and if the configuration of the device has changed, accessing new configuration information from a second memory and updating the stored configuration data with the new configuration information, wherein the second memory is accessible to all of the plurality of processors. 2. A method, according to claim 1, wherein the first memory is local to a processor that accesses the first memory.
3. A method, according to claim 1, wherein the stored configuration data indicates whether a device is a source or a destination for data in a remote data communication link.
4. A method, according to claim 1, wherein examining at least a portion of the status information includes determining whether the portion of the status information is equal to a first stored value.
if the portion of the status information is not equal to the first stored value, obtaining additional status information and determining if a portion of the additional status information is equal to a second stored value. 6. A method, according to claim 5, further comprising:
following updating the stored configuration data, updating the first and second stored values. 7. A computer program product that accesses a device, comprising:
executable code that obtains status information that indicates how to access the device; executable code that examines at least a portion of the status information to determine if configuration of the device has changed; executable code that accesses stored configuration data from a first memory if the configuration of the device has not changed, wherein the first memory is not accessible to all of a plurality of processors; and executable code that accesses new configuration information from a second memory and updates the stored configuration data with the new configuration information if the configuration of the device has changed, wherein the second memory is accessible to all of the plurality of processors. 8. A computer program product, according to claim 7, wherein the stored configuration data indicates whether a device is a source or a destination for data in a remote data communication link.
9. A computer program product, according to claim 7, wherein executable code that examines at least a portion of the status information includes executable code that determines whether the portion of the status information is equal to a first stored value.
executable code that obtains additional status information and determines if a portion of the additional status information is equal to a second stored value if the portion of the status information is not equal to the first stored value. 11. A computer program product, according to claim 10, further comprising:
executable code that updates the first and second stored values following updating the stored configuration data. 12. Apparatus that accesses a device, comprising:
means for obtaining status information that indicates how to access the device; means for examining at least a portion of the status information to determine if configuration of the device has changed; means for accessing stored configuration data from a first memory if the configuration of the device has not changed, wherein the first memory is not accessible to all of a plurality of processors; and means for accessing new configuration information from a second memory and updating the stored configuration data with the new configuration information if the configuration of the device has changed, wherein the second memory is accessible to all of the plurality of processors. 13. Apparatus, according to claim 12, wherein the first memory is local to a processor that accesses the first memory.
14. Apparatus, according to claim 12, wherein the stored configuration data indicates whether a device is a source or a destination for data in a remote data communication link.
15. Apparatus, according to claim 12, wherein means for examining at least a portion of the status information includes means for determining whether the portion of the status information is equal to a first stored value.
16. Apparatus, according to claim 15, further comprising:
means for obtaining additional status information and determining if a portion of the additional status information is equal to a second stored value if the portion of the status information is not equal to the first stored value. 17. Apparatus, according to claim 16, further comprising:
means for updating the first and second stored values following updating the stored configuration data.
CROSS REFERENCE TO RELATED APPLICATIONS This application claims priority to U.S. provisional application No. 60/332,991, filed on Nov. 14, 2001.
Host processor systems may store and retrieve data using a storage device containing a plurality of host interface units (host adapters), disk drives, and disk interface units (disk adapters). Such storage devices are provided, for example, by EMC Corporation of Hopkinton, Mass. and disclosed in U.S. Pat. No. 5,206,939 to Yanai et al., U.S. Pat. No. 5,778,394 to Galtzur et al., U.S. Pat. No. 5,845,147 to Vishlitzky et al., and U.S. Pat. No. 5,857,208 to Ofek. The host systems access the storage device through a plurality of channels provided therewith. Host systems provide data and access control information through the channels to the storage device and the storage device provides data to the host systems also through the channels. The host systems do not address the disk drives of the storage device directly, but rather, access what appears to the host systems as a plurality of logical disk units. The logical disk units may or may not correspond to the actual disk drives. Allowing multiple host systems to access the single storage device unit allows the host systems to share data stored therein. correspond to the actual disk drives. Allowing multiple host systems to access the single storage device unit allows the host systems to share data stored therein.
In some instances, it may be desirable to copy data from one storage device to another. For example, if a host writes data to a first storage device, it may be desirable to copy that data to a second storage device provided in a different location so that if a disaster occurs that renders the first storage device inoperable, the host (or another host) may resume operation using the data of the second storage device. Such a capability is provided, for example, by the Remote Data Facility (RDF) product provided by EMC Corporation of Hopkinton, Massachusetts. With RDF, a user may denote a first storage device as a master storage device and a second storage device as a slave storage device. Other incarnations of RDF may provide a peer to peer relationship between the local and remote storage devices. The host interacts directly with the local storage device, but any data changes made to the local storage device are automatically provided to a remote storage device using RDF. The local and remote storage devices may be connected by a data link, such as an ESCON link or a Fiber Channel link. The RDF functionality may be facilitated with an RDF adapter (RA) provided at each of the storage devices.
In some instances, it may be desirable to modify the RDF configuration system. However, in many cases, such modifications require skilled technicians using special software and non-standard connections to the local storage devices. It is desirable to automate the RDF configuration modification process to allow a host to modify the RDF configuration. In addition, it is desirable that allowing dynamic modifications to RDF configuration will not effect operation of the storage device when individual devices therein need to access the dynamic configuration information.
SUMMARY OF THE INVENTION According to the present invention, determining device characteristics includes obtaining a first globally accessible value, if the first globally accessible value corresponds to a stored first value, obtaining device characteristics data from a relatively fast memory, if the first globally accessible value does not correspond to the stored first value, obtaining a second globally accessible value, if the second globally accessible value corresponds to a stored second value, obtaining device characteristics data from a relatively fast memory, if the second globally accessible value does not correspond to the stored second value, obtaining device characteristics data from a relatively slow memory and updating the relatively fast memory, the stored first value, and the stored second value. The globally accessible first value may include device I/O information. The globally accessible values may be stored in global memory that is accessible to a plurality of processors. The relatively slow memory may be global memory that is accessible to a plurality of processors. The relatively fast memory may be local to a processor that accesses the first and second stored values. The second stored value may indicate whether a device is a source or a destination for data in a remote data communication link.
According further to the present invention, accessing a device includes obtaining status information that indicates how to access the device, examining at least a portion of the status information to determine if configuration of the device has changed, if the configuration of the device has not changed, accessing stored configuration data from relatively fast memory, and if the configuration of the device has changed, accessing new configuration information from relatively slow memory and updating the stored configuration data with the new configuration information. The relatively slow memory may be global memory that is accessible to a plurality of processors. The relatively fast memory may be local to a processor that accesses the fast memory. The stored configuration data may indicate whether a device is a source or a destination for data in a remote data communication link. Examining at least a portion of the status information may include determining whether the portion of the status information is equal to a first stored value. Accessing a device may also include, if the portion of the status information is not equal to the first stored value, obtaining additional status information and determining if a portion of the additional status information is equal to a second stored value. Accessing a device may also include following updating the stored configuration data, updating the first and second stored values.
According further to the present invention, a computer program product that determines device characteristics, includes executable code that obtains a first globally accessible value, executable code that obtains device characteristics data from a relatively fast memory if the first globally accessible value corresponds to a stored first value, executable code that obtains a second globally accessible value if the first globally accessible value does not correspond to the stored first value, executable code that obtains device characteristics data from a relatively fast memory if the second globally accessible value corresponds to a stored second value, and executable code that obtains device characteristics data from a relatively slow memory and updates the relatively fast memory, the stored first value, and the stored second value if the second globally accessible value does not correspond to the stored second value. The globally accessible first value may include device I/O information. The second stored value may indicate whether a device is a source or a destination for data in a remote data communication link.
According further to the present invention, a computer program product that accesses a device includes executable code that obtains status information that indicates how to access the device, executable code that examines at least a portion of the status information to determine if configuration of the device has changed, executable code that accesses stored configuration data from relatively fast memory if the configuration of the device has not changed, and executable code that accesses new configuration information from relatively slow memory and updates the stored configuration data with the new configuration information if the configuration of the device has changed. The stored configuration data may indicate whether a device is a source or a destination for data in a remote data communication link. Executable code that examines at least a portion of the status information may include executable code that determines whether the portion of the status information is equal to a first stored value. A computer program product that accesses a device may also include executable code that obtains additional status information and determines if a portion of the additional status information is equal to a second stored value if the portion of the status information is not equal to the first stored value. A computer program product that accesses a device may also include executable code that updates the first and second stored values following updating the stored configuration data.
According further to the present invention, an apparatus that determines device characteristics includes means for obtaining a first globally accessible value, means for obtaining device characteristics data from a relatively fast memory if the first globally accessible value corresponds to a stored first value, means for obtaining a second globally accessible value if the first globally accessible value does not correspond to the stored first value, means for obtaining device characteristics data from a relatively fast memory if the second globally accessible value corresponds to a stored second value, means for obtaining device characteristics data from a relatively slow memory and updating the relatively fast memory, the stored first value, and the stored second value if the second globally accessible value does not correspond to the stored second value. The globally accessible first value may include device I/O information. The globally accessible values may be stored in global memory that is accessible to a plurality of processors. The relatively slow memory may be global memory that is accessible to a plurality of processors. The relatively fast memory may be local to a processor that accesses the first and second stored values. The second stored value may indicate whether a device is a source or a destination for data in a remote data communication link.
According further to the present invention an apparatus that accesses a device, includes means for obtaining status information that indicates how to access the device, means for examining at least a portion of the status information to determine if configuration of the device has changed, means for accessing stored configuration data from relatively fast memory if the configuration of the device has not changed, and means for accessing new configuration information from relatively slow memory and updating the stored configuration data with the new configuration information if the configuration of the device has changed. The relatively slow memory may be global memory that is accessible to a plurality of processors. The relatively fast memory may be local to a processor that accesses the fast memory. The stored configuration data may indicate whether a device is a source or a destination for data in a remote data communication link. Means for examining at least a portion of the status information may include means for determining whether the portion of the status information is equal to a first stored value. The apparatus may further include means for obtaining additional status information and determining if a portion of the additional status information is equal to a second stored value if the portion of the status information is not equal to the first stored value. The apparatus may further include means for updating the first and second stored values following updating the stored configuration data.
FIG. 2 is a flow chart illustrating operation of the system described herein.
FIG. 3 is a flow chart illustrating determining which volumes to use for read and write operations according to the system described herein.
FIG. 4 is a diagram illustrating global memory for storage devices according to the system described herein.
FIG. 5 is a flow chart illustrating a hierarchy for determining whether to use static or dynamic configuration data in connection with assessing RDF configuration of a device according to the system described herein.
FIG. 6 is a schematic diagram showing in detail a storage device and components thereof used in connection with the system described herein.
FIG. 7 is a diagram illustrating a ready buffer and a set of bytes used in connection with the system described herein.
FIG. 8 is a flow chart illustrating steps performed in connection with accessing the ready buffer and the set of bytes set forth in FIG. 7.
FIG. 9 is a flow chart illustrating an alternative embodiment of the system described herein.
DETAILED DESCRIPTION OF VARIOUS EMBODIMENTS Referring to FIG. 1, a diagram 20 shows a relationship between a host 22, a local storage device 24 and a remote storage device 26. The host 22 reads and writes data from and to the local storage device 24 via a host adapter 28, which facilitates the interface between the host 22 and the local storage device 24. Data from the local storage device 24 is copied to the remote storage device 26 via an RDF link 29 to cause the data on the remote storage device 26 to be identical to the data on the local storage device 24. Note that there may be a time delay between the transfer of data from the local storage device 24 to the remote storage device 26, so that the remote storage device 26 may, at certain points in time, contain data that is not identical to the data on the local storage device 24. Communication using RDF is described, for example, in U.S. Pat. Nos. 5,742,792, and 5,544,346, both of which are incorporated by reference herein.
Each of the disks 33 a-33 c is coupled to a corresponding disk adapter unit (DA) 35 a, 35 b, 35 c that provides data to a corresponding one of the disks 33 a-33 c and receives data from a corresponding one of the disks 33 a-33 c. Similarly, a plurality of DA's 36 a, 36 b, 36 c of the remote storage device 26 are used to provide data to corresponding ones of the disks 34 a-34 c and receive data from corresponding ones of the disks 34 a-34 c. A data path exists between the DA's 35 a-35 c, the HA 28 and RA 30 of the local storage device 24. Similarly, a data path exists between the DA's 36 a-36 c and the RA 32 of the remote storage device 26.
The local storage device 24 also includes a global memory 37 that may be used to facilitate data transferred between the DA's 35 a-35 c, the HA 28 and the RA 30. The memory 37 may contain parameters from system calls, tasks that are to be performed by one or more of the DA's 35 a-35 c, the HA 28 and the RA 30, and a cache for data fetched from one or more of the disks 33 a-33 c. Similarly, the remote storage device 26 includes a global memory 38 that may contain parameters from system calls, tasks that are to be performed by one or more of the DA's 36 a-36 c and the RA 32, and a cache for data fetched from one or more of the disks 34 a-34 c. Use of the memories 37, 38 is described in more detail hereinafter.
The storage space in the local storage device 24 that corresponds to the disks 33 a-33 c may be subdivided into a plurality of volumes or logical devices. The logical devices may or may not correspond to the physical storage space of the disks 33 a-33 c. Thus, for example, the disk 33 a may contain a plurality of logical devices or, alternatively, a single logical device could span both of the disks 33 a, 33 b. Similarly, the storage space for the remote storage device 26 that comprises the disks 34 a-34 c may be subdivided into a plurality of volumes or logical devices, where each of the logical devices may or may not correspond to one or more of the disks 34 a-34 c. Providing an RDF mapping between portions of the local storage device 24 and the remote storage device 26 involves setting up a logical device on the remote storage device 26 that is a remote mirror for a logical device on the local storage device 24. The host 22 reads and writes data from and to the logical device on the local storage device 24 and the RDF mapping causes modified data to be transferred from the local storage device 24 to the remote storage device 26 using the RAs, 30, 32 and the RDF link 29. In steady state operation, the logical device on the remote storage device 26 contains data that is identical to the data of the logical device on the local storage device 24. The logical device on the local storage device 24 that is accessed by the host 22 is referred to as the �R1 volume� (or just �R1�) while the logical device on the remote storage device 26 that contains a copy of the data on the R1 volume is called the �R2 volume� (or just �R2�). Thus, the host reads and writes data from and to the R1 volume and RDF handles automatic copying and updating of the data from the R1 volume to the R2 volume.
In some situations, it may be beneficial to allow the host 22 to create and destroy RDF volumes during operation of the system. Note that RDF volumes may be created and destroyed in pairs so that an R1/R2 pair may be destroyed or an R1/R2 pair may be created. Creating or destroying R1/R2 pairs may be initiated by the host 22. The host may send a multihop/multiexecute system command, such as described in U.S. patent application Ser. No. 09/867,136 filed on May 29, 2001, which is incorporated by reference herein. The multihop/multiexecute system command is a single system command that is provided to multiple storage devices and indicates operations to be performed by the multiple storage devices. For example, the host 22 may send a multihop/multiexecute system command requesting that a particular R1/R2 pair be destroyed where the R1 volume is on the local storage device 24 and the R2 volume is on the remote storage device 26 by having each of the storage devices 24, 26 locally modify a table (discussed in more detail below) that is used internally by each of the storage devices 24, 26 to govern setting up and managing RDF volumes. Creating an R1/R2 pair involves creating the R1 volume on one storage device and creating the R2 volume on another storage device.
Further note that, in certain instances, it may be useful to establish an RDF connection to one or more existing volumes. Thus, for example, an existing source volume may be connected to newly-created destination volume using RDF. Accordingly, for the discussion set forth herein, references to creating volumes may be understood to include creating connections to existing volumes. Similarly, references to destroying volumes may be understood to include simply destroying RDF connections thereto, as appropriate. Note that, both in the case of creating or destroying new volumes and in the case of creating or destroying simply the connections to existing volume, the same tables (discussed below) that contain RDF connection data are modified.
Referring to FIG. 2, a flow chart 50 illustrates steps performed in connection with creating or destroying R1/R2 pairs. Processing begins at a first step 52 where it is determined if a destroy command is being issued. In some embodiments, only create or destroy commands are issued. Thus, if a command is not a destroy command, the command is a create command. If it is determined at the step 52 that a destroy command was issued, then control passes from the step 52 to a step 54 any where background I/O operations, such as background copying, are suspended. Prior to destroying the R1/R2 pair, it is useful to first suspend any background I/O. In other embodiments, the step 54 is not necessary and not executed because destroying the volumes will cause background I/O (and other operations involving the R1/R2 pair) to cease automatically.
Following the step 54 is a step 56 where an allocation table on the storage device corresponding to the R1 volume is modified. The allocation table contains dynamic information about the RDF configuration of a storage device. The allocation table may contain a two dimensional array indexed by logical device identifiers (such as numbers) and by mirror numbers for each of the logical devices. In some embodiments, each device may have up to four mirrors. Other embodiments may employ more than four mirrors. Entries for the allocation table may indicate whether a mirror for a device is a local mirror, an R1 volume, an R2 volume, or some other type of mirror, such as BCV or a RAID mirror.
At the step 56, the allocation table on the storage device containing the R1 volume is modified to remove the R1 volume. Following the step 56 is a step 58 where the allocation table on the storage device containing the R2 volume is modified to remove the R2 volume. Following the step 58 is a step 60 where the result of the previously executed operations (e.g., success or failure) is returned. Following the step 60, processing is complete.
If it is determined at the step 52 that a destroy command is not being issued (and hence a create command is being issued), then control passes from the step 52 to a step 62 where the R1 or R2 volume is created at a first site. In one embodiment, the host issues the multihop/multiexecute command to a first storage device such as the local storage device 24, in which case the first site would be the local storage device 24 (i.e., the first site to receive the command). In an embodiment illustrated herein, the first site on which the creation of an R1/R2 pair is attempted is the local storage device 24 that is coupled directly to the host 22. Creation at the first cite includes modifying the appropriate allocation table. Following the step 62 is a test step 64 where it is determined if creation of the R1 or R2 volume at the step 62 was successful. If not, control passes from the step 64 to a step 66 where an error indication is returned to the host 22. Following the step 66, processing is complete.
If it is determined at the test step 64 that the creation of the R1 or R2 volume at the step 62 was successful, then control passes from the step 64 to a step 68 where the R1 or R2 volume, as the case may be, is created at a second site. Creation at the second site includes modifying the appropriate allocation table. The second site may be the second storage device to receive the command. In an embodiment illustrated herein, the second site is the remote storage device 26 that receives a command from the host 22 through the local storage device 24.
Following the step 68 is a test step 70 where it is determined if creation at the step 68 was successful. If it is determined at the test step 70 that the creation at the second site was not successful, then control passes from the step 70 to a step 72 where the first site that was created is destroyed. Note that R1 and R2 volumes are created in pairs so that failure to create one of the volumes at the second site causes the volume that was successfully created at the first site to be destroyed at the step 72. Following the step 72 is a step 74 where an error is returned to the host 22 in a manner similar to returning an error at the step 66, discussed above. Following the step 74, processing is complete.
If it is determined at the test step 70 that creation of the R1 or R2 volume at the second site at the step 68 was successful, control transfers from the step 70 to a step 75 where invalid tracks for each of the storage devices 24, 26 are set. The invalid tracks are used to indicate differences between the R1 and R2 volumes. In instances where the R1 volume contains the initial data, all of the tracks of the R1 volume are set to invalid indicating that all of the R1 data is inconsistent with the R2 data, and thus needs to be copied from R1 to R2. If the R2 volume contains the initial data to be used, then all of the tracks of the R2 volume are invalidated and a Sync command is provided to the storage device containing the R1 volume to cause the tracks of the local mirror corresponding to the R1 volume to be invalidated, thus initiating a background copy of data from R2 to R1. Following the step 75 is a step 78 where a not ready indicator for the R1 volume is cleared, indicating that RDF operations between R1 and R2 may commence. Note that the not ready indicator refers to the R1/R2 link, and not necessarily to the ability of R1 and/or R2 to accept data from a host. Note that data can be organized in units other than tracks, in which case, the operations disclosed herein would be performed on whatever units other than tracks that are used.
Following the step 78 is a step 79 where an indicator that the operation was successful is returned to the host 22. Following the step 79, processing is complete. Note that setting invalid tracks and setting and clearing device not ready status, discussed above, may be performed in a different order than that indicated in FIG. 2 and discussed above, provided that the settings are maintained in an appropriate state during the creation operation and thereafter.
In some embodiments, it may be useful to create and destroy the R1/R2 volumes in a particular order. For example, it may be useful to create the R2 volume first followed by the R1 volume. Similarly, it may be useful to destroy the R1 volume first followed by destroying the R2 volume. Alternatively, the volumes may be created and destroyed in any order while operations may be controlled by setting a not ready indicator for the R1 volume, where the not ready indicator for the R1 volume controls whether operations take place. Thus, the R1 and R2 volumes may be created in any order, but the not ready indicator of the R1 volume is not set to indicate ready unless and until both R1 and R2 have been created. Similarly, setting the not ready indicator for R1 as a first step allows subsequent steps for destroying R1 and R2 to take place in any order.
In some embodiments, it may be useful to have the command that creates the R1/R2 pair indicate the specific volumes to be used for both the R1 volume and the R2 volume. That is, the host 22 may select an existing logical device from the local storage device 24 as the R1 volume and, in addition, may select an existing logical device from the remote storage device 26 as an R2 volume. In an alternative embodiment, it may be possible to have the remote storage device 26 select any unused logical device as the R2 volume. Alternatively still, an API may be layered on to one of the storage devices 24, 26 and/or the host 22 to pick the R2 volume in instances where the system command expects specific volume identification for the R1 volume.
Note, in addition, there may be situations where the initial data for a newly-created R1/R2 pair is found on the R2 volume. For example, if the remote storage device 26 has coupled thereto a host (not shown) that fails, it may be useful to restart the system with the host 22 coupled to the local storage device 24. However, in that case, the initial data for starting up may be located on the R2 volume (i.e., on the remote storage device 26). Thus, at start up, the initial data is copied from the R2 device to the R1 device, after which the host 22 maintains normal RDF operation with the R1 device being located on the local storage device 24 and the R2 device being located on the remote storage device 26. The copy from the R2 device to the R1 device (or, from an R1 device to an R2 device) may be provided using a background copy.
Referring to FIG. 3, a flow chart 80 illustrates operation of the system after an R1/R2 pair is initialized but prior to completion of the background copy. Note that the host 22 may read and write from and to an R1 volume even if the background copy has not completed.
Processing begins at an initial test step 82 where it is determined if the R2 volume contains the initial data. If not, then control passes from the test step 82 to a step 84 where the R1 volume is used for the read or write operation requested by the host 22.
If it is determined at the test step 82 that the R2 volume is specified as containing the initial data, then control passes from the test step 82 to a test step 86 where it is determined if the track being written to or read from is invalid. An invalid track indicates that the initial data, located on the R2 volume, has not yet been copied back to the R1 volume. Setting invalid tracks is discussed above in connection with FIG. 1. Thus, if it is determined at the test step 86 that the track being written to or read from by the host 22 is invalid, control passes from the step 86 to a step 88 where the R2 volume is used for the read or write operation using RDF. Note that, in some instances, less than an entire track is written by the host. Thus, for an invalid track where R2 contains the initial data, it is useful to have the data from the host 22 provided to the R2 volume. Following the step 88, processing is complete. Alternatively, if it is determined at the test step 86 that the track being read to or written from is not invalid, then control passes from the test step 86 to the step 84 where the R1 volume is used, in a conventional fashion. Following the step 84, processing is complete.
Referring to FIG. 4, a diagram shows global memory that could represent the memory 37 of the local storage device 24 or the memory 38 of the remote storage device 26. The global memory includes a memory location for static configuration data 92 and a memory location for dynamic configuration data 94, such as the allocation table, discussed above. Static configuration data 92 includes configuration information for the storage device that is set up at the factory or by a technician. The static configuration data 92 may be provided in a file that is read into global semiconductor memory or it may provided in non-volatile portions of semiconductor memory.
The dynamic configuration data 94 represents the configuration of the corresponding system that has been modified from the static configuration data 92. Thus, for example, the static configuration data 92 may indicate that particular volumes form an R1/R2 RDF pair while the dynamic configuration data 94 overrides the static configuration data 92 by indicating that the particular R1/R2 RDF pair has been subsequently destroyed. The dynamic configuration data 94 may also be stored on a disk and read into electronic memory and/or may be stored in electronic memory that is non-volatile. In some embodiments, the dynamic configuration data 94 may override the static configuration data 92. In other embodiments, the dynamic configuration data 94 is only additive and may only be used in instances where there is no entry in the static configuration data 92 corresponding to an item.
Referring to FIG. 5, a flow chart 100 illustrates determination of a configuration of a particular logical device. Note that each read or write access from or to a logical device uses knowledge of the configuration of the device to determine if, for example, the device is part of an R1/R2 pair.
Processing begins at a first step 102 where it is determined if there is an entry for the logical device in the dynamic configuration data 94. If not, then control passes from the step 102 to a step 104 where the static configuration data 92 is consulted to determine the configuration of the device. Note that it is possible for each logical device to have a local, and thus easily accessible, copy of the static configuration data 92 since, by definition, the static configuration data 92 does not change. Following the step 104, processing is complete.
If it is determined at the test step 102 that there is an entry for the logical device in the dynamic configuration data 94, then control passes from the test step 102 to a step 106 where the dynamic configuration data 94 is used to determine the configuration of the logical device. Note that, as an alternative, it is possible to first check the static configuration data 92 and then check to see if an overriding entry exists in the dynamic configuration data 94.
Referring to FIG. 6, a diagram shows a storage device 110 in more detail. The storage device 110 includes a plurality of host adapters 112-114 and a plurality of disk adapters 116-118. Each of the disk adapters 116-118 is coupled to a respective one of a plurality of disks 120-122. The storage device 110 also includes a global memory 124 an RDF adapter (RA) 126 and an outside connection 128 to the RA 126. A bus 130 connects the HAs 112-114, the DAs 116-118, the global memory 124 and the RA 126. Each of the HAs 112-114 includes a connection for coupling to a host (not shown).
For every read and write operation performed by one of the hosts coupled to one of the HAs 112-114, the corresponding one of the HAs 112-114 determines where the data is to be placed. For example, if the storage device 110 includes a local volume of an R1/R2 pair, the particular one of the HAs 112-114 that receives the data from the host must be able to direct the data to the correct one of the disk adapters 116-118 in order to provide the data to the R1 volume and must also be able to appropriately direct the data to the RA 126 that provides the data to the R2 volume on another storage device (not shown). In addition, in connection with a background copy operation, the DAs 116-118 access information indicating the source and destination of the data. Thus, for example, if an R1/R2 pair is set up between the storage device 110 and another remote storage device (not shown), then the DAs 116-118 would assist in the background copy of data from the volume containing the initial data (R1 or R2) to the other volume. In such a case, the DAs 116-118 access information that indicates where the data should go (i.e., which volume is the corresponding one of the volumes of the R1/R2 pair). Similarly, it is useful for the RA 126 to access the configuration information for the volumes in order to be able to process incoming data, for example.
Accordingly, it is useful for the HAs 112-114, the DAs 116-118 and the RA 126 to be able to have access to accurate information indicating the set up configuration of the volumes on the storage device 110. One way to obtain the information is to read the dynamic configuration data 94 from global memory 124 for each read or write operation and then, if the device for which the inquiry is made is not found in the dynamic configuration data 94, to then access the static configuration data 92. However, accessing global memory for every I/O operation could adversely impact the performance of the storage device 110. Accordingly, a more efficient mechanism for determining the configuration of the devices of the storage device 110 is provided.
Referring to FIG. 7, a diagram 150 illustrates a mechanism for decreasing the number of accesses to global memory used to determine configuration data. A ready buffer 152 represents data that is accessed each time an I/O is performed. The ready buffer 152 indicates useful I/O related information, such as the state of the devices and/or the state of the system. Thus, the ready buffer 152 is accessed for each I/O operation.
The ready buffer 152 include a revision number field 154 which, in some embodiments, is a byte of data that is incremented each time a device configuration has changed. Thus, a device performing an I/O can look to the revision number field 154 to determine if further inquiry is necessary.
A set of bytes 156 may be accessed in response to the revision number field 154 changing. A particular byte 158 of the set of bytes 156 could be used to indicate a change in the dynamic RDF configuration for the storage device. Thus, the combination of the ready buffer 152 and the set of bytes 156 may be used to minimize accesses to global memory 124 each time an I/O is performed.
Referring to FIG. 8, a flow chart 170 illustrates steps performed in connection with using the ready buffer 152 and the set of bytes 156. Processing begins at a first step 172 where a device performing an I/O determines if the ready buffer field 154 has changed (e.g., incremented). If it is determined at the step 172 that the ready buffer field has not changed, then control passes from the step 172 to a step 174 where the device, such as one of the HAs 112-114, one of the DAs 116-118, and/or the RA 126, uses a locally stored data to determine configuration information. That is, the revision number field 154 being equal to a previously observed version of the revision number field 154 indicates that no changes have been made to the RDF configuration. Thus, control passes from the step 172 to the step 174 where a locally stored copy of the configuration data may be used by the device performing the I/O in order to determine how to handle particular data. Following the step 174, processing is complete.
If it is determined at the test step 172 that the revision number field 154 has changed, then control passes from the step 172 to a step 176 where the set of bytes 156 is fetched. The set of bytes 156 may be stored, for example, in global memory 124 or in another memory, such as non-volatile electronic memory or on a disk.
Following the step 176 is a test step 178 where it is determined if the byte 158 in the set of bytes 156 corresponding to an RDF configuration change has been modified (e.g., incremented). If not, then control passes from the step 178 to the step 174, discussed above, where the stored local copy of the configuration data is used to determine the RDF configuration. Following step 174, processing is complete.
If it is determined at the test step 178 that the RDF configuration has changed, then control passes from the step 178 to a step 180 where the dynamic configuration data 94 in the global memory 124 is accessed. Following the step 180 is a step 182 where the stored local copy of the configuration data is updated with the new version of the data from global memory 124. Following the step 182 is the step 174 where the locally stored version of the configuration data (which has just been updated) is used by the device to determine the RDF configuration. Following the step 174, processing is complete.
In some embodiments, it is possible to also include a background mechanism that periodically accesses the dynamic configuration data from the allocation table and updates the local copy of the configuration data in the storage for each device. Thus, each device may be updated by this background task without first having to perform an I/O.
Note that the mechanism discussed herein for using revision numbers to control accesses to global memory when determining the RDF configuration of the system may be applied to other system parameters as well, such as BCV configuration. BCV is discussed, for example, in U.S. Pat. No. 6,101,497, which is incorporated by reference herein.
Referring to FIG. 9, a flow chart 50′ illustrates an alternative embodiment to the embodiment described in connection with the flow chart 50 of FIG. 2. The flow chart 50 of FIG. 2 shows a system where there are two commands, create and destroy. The system illustrated by the flow chart 50′ of FIG. 9 provides for a third command that swaps R1 and R2 in addition to the create and destroy commands discussed above. Swapping R1 and R2 may be performed using a single command that causes the R1 volume to become the R2 volume and causes the R2 volume to become the R1 volume. This may be useful in instances where, for example, a host coupled to a local storage device is replaced by a different host that is coupled to a corresponding remote storage device. The command may be provided by the host. The host may send a multihop/multiexecute system command, such as described in U.S. patent application Ser. No. 09/867,136 filed on May 29, 2001, which is incorporated by reference herein.
Processing begins at a first step 52′ where it is determined if a destroy command has been issued. If so, then control passes from the step 52′ to the step 54, which is discussed above in connection with the flow chart 50 of FIG. 2. If, on the other hand, it is determined at the step 52′ that a destroy command has not been issued, then control passes from the step 52′ to a step 53 where it is determined if a create command has been issued. If a create command has been issued, control passes from the step 53 to the step 62, which is discussed above in connection with the flow chart 50 of FIG. 2.
If it is determined at the test step 53 that a create command has not been issued, then a swap R1/R2 command has been issued. That is, in a system having three commands, a process of elimination provides that if it is determined at the step 52′ that a destroy command has not been issued, and if it is determined at the step 53 that a create command has not been issued, then a swap R1/R2 command has been issued. Alternatively, a particular portion of code may be executed based on the command received, which could be a swap R1/R2 command. For the swap R1/R2 command, control transfers from the step 53 to a step 192 where the device not ready flag for R1 is set. Setting the device not ready flag for R1 at the step 192 causes RDF operations to cease for the R1/R2 pair. Following the step 192 is a step 194 where an entry for the allocation table corresponding to the storage device containing the R1 volume and an entry for the allocation table corresponding to the storage device containing the R2 volume are both modified so that the R1 volume becomes the R2 volume and vice versa. Following the step 194 is a step 196 where the device not ready bit is cleared for the new R1 device. Clearing the device not ready bit for the R1 volume at the step 196 allows RDF operations to resume. However, when RDF operations resume, the previous R2 volume is now the R1 volume and the previous R1 volume is now the R2 volume. Following the step 196 is a step 198 where the result of the operations corresponding to the command for swapping R1 and R2 (e.g., success or failure) are returned to the host. Following the step 198, processing is complete.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5544347Apr 23, 1993Aug 6, 1996Emc CorporationData storage system controlled remote data mirroring with respectively maintained data indicesUS5680640Sep 1, 1995Oct 21, 1997Emc CorporationSystem for migrating data by selecting a first or second transfer means based on the status of a data element map initialized to a predetermined stateUS5742792May 28, 1996Apr 21, 1998Emc CorporationRemote data mirroringUS5889935Mar 17, 1997Mar 30, 1999Emc CorporationDisaster control features for remote data mirroringUS5896548Feb 28, 1997Apr 20, 1999Emc CorporationData transferring system having foreground and background modes and upon detecting significant pattern of access in foreground mode to change background mode control parametersUS5933653May 31, 1996Aug 3, 1999Emc CorporationIn a data processing networkUS6044444Mar 17, 1997Mar 28, 2000Emc CorporationRemote data mirroring having preselection of automatic recovery or intervention required when a disruption is detectedUS6052797Aug 20, 1998Apr 18, 2000Emc CorporationRemotely mirrored data storage system with a count indicative of data consistencyUS6092066May 31, 1996Jul 18, 2000Emc CorporationMethod and apparatus for independent operation of a remote data facilityUS6101497Apr 25, 1997Aug 8, 2000Emc CorporationMethod and apparatus for independent and simultaneous access to a common data setUS6108748Feb 28, 1997Aug 22, 2000Emc CorporationSystem and method for on-line, real time, data migrationUS6157991Apr 1, 1998Dec 5, 2000Emc CorporationMethod and apparatus for asynchronously updating a mirror of a source deviceUS6173377Apr 17, 1998Jan 9, 2001Emc CorporationRemote data mirroringUS6209002Feb 17, 1999Mar 27, 2001Emc CorporationMethod and apparatus for cascading data through redundant data storage unitsReferenced byCiting PatentFiling datePublication dateApplicantTitleUS6862632 *Nov 30, 2001Mar 1, 2005Emc CorporationDynamic RDF system for transferring initial data between source and destination volume wherein data maybe restored to either volume at same time other data is writtenUS6976139Nov 30, 2001Dec 13, 2005Emc CorporationReversing a communication path between storage devicesUS7409470 *Nov 23, 2004Aug 5, 2008Emc CorporationDetermining configuration data in connection with dynamic RDFUS7496718 *Nov 17, 2004Feb 24, 2009Hitachi, Ltd.Data transfer and access control between disk array systemsUS7633876Aug 22, 2005Dec 15, 2009At&T Intellectual Property I, L.P.System and method for monitoring a switched metro ethernet networkUS7809909Nov 6, 2007Oct 5, 2010Hitachi, Ltd.Remote copy networkUS8250326 *Aug 29, 2008Aug 21, 2012International Business Machines CorporationData swapping in a storage systemUS8453007Jul 10, 2009May 28, 2013Fujitsu LimitedStorage device and recovery methodUS20100058017 *Aug 29, 2008Mar 4, 2010Akram BitarData swapping in a storage system* Cited by examinerClassifications U.S. Classification710/36, 710/16, 710/5, 714/E11.103, 710/37, 714/E11.1, 711/122, 710/38International ClassificationG06F3/06, G06F11/20, G06F12/00Cooperative ClassificationG06F2003/0697, G06F11/1666, G06F11/2069, G06F3/0601, G06F11/20European ClassificationG06F3/06A, G06F11/20S2M, G06F11/16MLegal EventsDateCodeEventDescriptionSep 2, 2011FPAYFee paymentYear of fee payment: 8Sep 10, 2007REMIMaintenance fee reminder mailedSep 4, 2007FPAYFee paymentYear of fee payment: 4Nov 30, 2001ASAssignmentOwner name: EMC CORPORATION, MASSACHUSETTSFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HALSTEAD, MARK J.;OFER, ADI;ARNON, DAN;REEL/FRAME:012345/0430;SIGNING DATES FROM 20011121 TO 20011129Owner name: EMC CORPORATION 35 PARKWOOD DRIVEHOPKINTON, MASSACFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HALSTEAD, MARK J. /AR;REEL/FRAME:012345/0430;SIGNING DATES FROM 20011121 TO 20011129RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services©2012 Google