System and method for scheduled snapshot pacing with deduplication
A method, computer program product, and computer system for submitting, by a computing device, at least one snapshot request of a plurality of snapshots requests into a snapshot queue. How many snapshots of a plurality of snapshots are referencing a given point in time copy may be tracked, wherein the given point in time copy may be mapped to at least a portion of the plurality of snapshots. A desired executing time for the at least one snapshot request in the snapshot queue may be determined. The at least one snapshot request may be dequeued.
1. A computer-implemented method comprising:
submitting, by a computing device, at least one snapshot request of a plurality of snapshots requests into a snapshot queue;
tracking how many snapshots of a plurality of snapshots are referencing a given point in time copy, wherein the given point in time copy is mapped to at least a portion of the plurality of snapshots;
determining a desired executing time for the at least one snapshot request in the snapshot queue;
dequeuing the at least one snapshot request; and
deduplicating duplicate requests in the snapshot queue.
2. The computer-implemented method of claim 1 , wherein the dequeuing is based upon, at least in part, a centralized timer.
3. The computer-implemented method of claim 1 , wherein the dequeuing is based upon, at least in part, at least one of an executing time of the at least one request being less than or equal to a current time and a duplicate request for a same storage object.
4. The computer-implemented method of claim 1 , wherein the desired execution time is based upon, at least in part, a storage object ID and a pacing window.
5. The computer-implemented method of claim 3 , further comprising deleting an entry of the at least one snapshot request.
6. The computer-implemented method of claim 5 , further comprising decrementing a reference count from a reference count table.
7. A computer program product residing on a computer readable storage medium having a plurality of instructions stored thereon which, when executed across one or more processors, causes at least a portion of the one or more processors to perform operations comprising:
submitting at least one snapshot request of a plurality of snapshots requests into a snapshot queue;
tracking how many snapshots of a plurality of snapshots are referencing a given point in time copy, wherein the given point in time copy is mapped to at least a portion of the plurality of snapshots;
determining a desired executing time for the at least one snapshot request in the snapshot queue; and
dequeuing the at least one snapshot request, wherein the dequeuing is based upon, at least in part, a centralized timer.
8. The computer program product of claim 7 , wherein the operations further comprise deduplicating duplicate requests in the snapshot queue.
9. The computer program product of claim 7 , wherein the dequeuing is based upon, at least in part, at least one of an executing time of the at least one request being less than or equal to a current time and a duplicate request for a same storage object.
10. The computer program product of claim 7 , wherein the desired execution time is based upon, at least in part, a storage object ID and a pacing window.
11. The computer program product of claim 9 , wherein the operations further comprise deleting an entry of a snapshot associated with the at least one snapshot request.
12. The computer program product of claim 11 , wherein the operations further comprise decrementing a reference count from a reference count table.
13. A computing system including one or more processors and one or more memories configured to perform operations comprising:
submitting at least one snapshot request of a plurality of snapshots requests into a snapshot queue;
tracking how many snapshots of a plurality of snapshots are referencing a given point in time copy, wherein the given point in time copy is mapped to at least a portion of the plurality of snapshots;
determining a desired executing time for the at least one snapshot request in the snapshot queue; and
dequeuing the at least one snapshot request, wherein the dequeuing is based upon, at least in part, at least one of an executing time of the at least one request being less than or equal to a current time and a duplicate request for a same storage object.
14. The computing system of claim 13 , wherein the dequeuing is based upon, at least in part, a centralized timer.
15. The computing system of claim 13 , wherein the operations further comprise deduplicating duplicate requests in the snapshot queue.
16. The computing system of claim 13 , wherein the desired execution time is based upon, at least in part, a storage object ID and a pacing window.
17. The computing system of claim 13 , wherein the operations further comprise deleting an entry of a snapshot associated with the at least one snapshot request and decrementing a reference count from a reference count table.