Claims
- 1. A method for recovery of compromised instances of virtual mapping systems, comprising the steps of:
identifying a plurality of physical data elements for which mapping has been compromised; determining whether anchor points exist for the plurality of physical data elements; processing anchor points to find data elements in managed order if anchor points exist; and launching processing for each element found.
- 2. The method of claim 1, wherein the managed order comprises data elements with sequential addresses.
- 3. The method of claim 1, wherein the managed order comprises data elements that are sorted by address.
- 4. The method of claim 1, wherein the managed order comprises data elements that are sorted by query frequency.
- 5. The method of claim 1, further comprising:
finding data elements in physical space if anchor points do not exist.
- 6. The method of claim 5, wherein the step of finding data elements in physical space comprises at least one of a sequential scan, random entry, and a binary search.
- 7. An apparatus for recovery of compromised instances of virtual mapping systems, comprising:
identification means for identifying a plurality of physical data elements for which mapping has been compromised; determination means for determining whether anchor points exist for the plurality of physical data elements; first processing means for processing anchor points to find data elements in managed order if anchor points exist; and second processing means for processing each element found.
- 8. The apparatus of claim 7, wherein the managed order comprises data elements with sequential addresses.
- 9. The apparatus of claim 7, wherein the managed order comprises data elements that are sorted by address.
- 10. The apparatus of claim 7, wherein the managed order comprises data elements that are sorted by query frequency.
- 11. The apparatus of claim 7, further comprising:
means for finding data elements in physical space if anchor points do not exist.
- 12. The apparatus of claim 11, wherein the means for finding data elements in physical space comprises at least one of a sequential scan, random entry, and a binary search.
CROSS REFERENCE TO PROVISIONAL AND RELATED APPLICATIONS
[0001] This application claims the benefit of the filing date of corresponding U.S. Provisional Patent Application No. ______, entitled “System for providing a policy-based demand and use of functions like virtual volumes, instant copy, RAID, etc.”, filed Jun. 19, 2000. In addition, the present invention is related to applications entitled A SYSTEM TO SUPPORT DYNAMICALLY FLEXIBLE DATA DEFINITIONS AND STORAGE REQUIREMENTS, serial no. ______, Attorney Docket Number 00-059-DSK; EFFECTING INSTANT COPIES IN A DYNAMICALLY MAPPED SYSTEM, serial no. ______, Attorney Docket Number 00-060-DSK; USING CURRENT RECOVERY MECHANISMS TO IMPLEMENT DYNAMIC MAPPING OPERATIONS, serial no. ______, Attorney Docket Number 00-061-DSK; DYNAMICALLY CHANGEABLE VIRTUAL MAPPING SCHEME, serial no. ______, Attorney Docket Number 00-062-DSK; FLOATING VIRTUALIZATION LAYERS, serial no. ______, Attorney Docket Number 00-116-DSK, and SELF-DEFINING DATA UNITS, serial no. ______, Attorney Docket Number 00-117-DSK, which are filed even date hereof, assigned to the same assignee, and incorporated herein by reference.