Claims
- 1. A method for dynamically mapping data in a computer storage subsystem, comprising:
using an internal mapping mechanism to mark an old data location; pointing write requests for the old data location to a side file; writing new data to the side file; and reconciling the old and new data locations.
- 2. The method according to claim 1, wherein the step of reconciling the old and new data locations further comprises moving the new data.
- 3. The method according to claim 1, wherein the step of reconciling the old and new data locations further comprises returning the old data to its original location.
- 4. The method according to claim 1, wherein the dynamic mapping is qualified by a virtual volume ID.
- 5. The method according to claim 1, wherein the step of reconciling the old and new data locations further comprises establishing an initiation point to find data algorithmically.
- 6. The method according to claim 5, further comprising:
establishing an initiation point upon creation of a snapshot copy of a data file; and directing the dynamic mapping pointers to the location of the new initiation point.
- 7. The method according to claim 5, further comprising:
sending the old data to the side file; and transferring the initiation point of the old data to a new snapshot copy.
- 8. The method according to claim 1, wherein the internal mapping mechanism is used to identify extent boundaries for read and write authorization controls.
- 9. The method according to claim 1, wherein the internal mapping mechanism is used to compensate for a particular physical location which is no longer usable.
- 10. The method according to claim 9, wherein the internal mapping mechanism is a D-mark mechanism.
- 11. The method according to claim 9, wherein the internal mapping mechanism is an Erase-gap mechanism.
- 12. A computer program product in a computer readable medium for use in a data processing system, for dynamically mapping data in a computer storage subsystem, the computer program product comprising:
instructions for using an internal mapping mechanism to mark an old data location; instructions for pointing write requests for the old data location to a side file; instructions for writing new data to the side file; and instructions for reconciling the old and new data locations.
- 13. The computer program product according to claim 12, wherein the instructions for reconciling the old and new data locations further comprises instructions for moving the new data.
- 14. The computer program product according to claim 12, wherein the instructions for reconciling the old and new data locations further comprises instructions for returning the old data to its original location.
- 15. The computer program product according to claim 12, wherein the dynamic mapping is qualified by a virtual volume ID.
- 16. The computer program product according to claim 8, wherein the instructions for reconciling the old and new data locations further comprises instructions for establishing an initiation point to find data algorithmically.
- 17. The computer program product according to claim 16, further comprising:
instructions for establishing an initiation point upon creation of a snapshot copy of a data file; and instructions for directing the dynamic mapping pointers to the location of the new initiation point.
- 18. The computer program product according to claim 16, further comprising:
instructions for sending the old data to the side file; and instructions for transferring the initiation point of the old data to a new snapshot copy.
- 19. The computer program product according to claim 12, wherein the internal mapping mechanism is used to identify extent boundaries for read and write authorization controls.
- 20. The computer program product according to claim 1, wherein the internal mapping mechanism is used to compensate for a particular physical location which is no longer usable.
- 21. The computer program product according to claim 20, wherein the internal mapping mechanism is a D-mark mechanism.
- 22. The computer program product according to claim 20, wherein the internal mapping mechanism is an Erase-gap mechanism.
- 23. A system for dynamically mapping data in a computer storage subsystem, comprising:
an internal mapping mechanism to mark an old data location; an indirection component to point write requests for the old data location to a side file; a writing component to write new data to the side file; and a processing component for reconciling the old and new data locations.
CROSS REFERENCE TO RELATED APPLICATIONS
[0001] This application claims the benefit of the filing date of corresponding U.S. Provisional Patent Application No. 60/212,389, 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, Ser. No. 09/751,635, Attorney Docket No. 00-059-DSK; EFFECTING INSTANT COPIES IN A DYNAMICALLY MAPPED SYSTEM, Ser. No. Attorney Docket No. 00-060-DSK; DYNAMICALLY CHANGEABLE VIRTUAL MAPPING SCHEME, Ser. No. 9/751,772, Attorney Docket No. 00-062-DSK; RECOVERY OF DYNAMIC MAPS AND DATA MANAGED THEREBY; Ser. No. 09/752,253, Attorney Docket No. 00-063-DSK; FLOATING VIRTUALIZATION LAYERS, Ser. No. 09/752,071, Attorney Docket No. 00-116-DSK, and SELF DEFINING DATA UNITS, Ser. No. 09/751,641, Attorney Docket No. 00-117-DSK, filed on Dec. 29, 2000, assigned to the same assignee, and incorporated herein by referenced.
Provisional Applications (1)
|
Number |
Date |
Country |
|
60212389 |
Jun 2000 |
US |