Simplified Hash Table
US-2024422006-A1 · Dec 19, 2024 · US
US9710308B1 · US · B1
| Field | Value |
|---|---|
| Publication number | US-9710308-B1 |
| Application number | US-201314140135-A |
| Country | US |
| Kind code | B1 |
| Filing date | Dec 24, 2013 |
| Priority date | Dec 24, 2013 |
| Publication date | Jul 18, 2017 |
| Grant date | Jul 18, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Techniques for improved workflow for migration planning of data storage systems. For example, a method comprises the following steps. A plurality of elements representing events of a workflow are generated, wherein each element is active for a predetermined duration. A group of one or more assets to be migrated as a unit are assigned to each element. A group of the one or more assets is moved from a first element of the plurality of elements to a second element of the plurality of elements.
Opening claim text (preview).
What is claimed is: 1. A method comprising: generating a plurality of event windows representing events of a workflow, wherein each event window of the plurality of event windows is active for a predetermined duration; assigning, to each event window of the plurality of event windows, one or more assets to be migrated as a unit; and determining whether to move a group of the one or more assets from a first event window of the plurality of event windows to a second event window of the plurality of event windows; wherein determining whether to move the group from the first event window to the second event window comprises determining whether the second event window includes the one or more assets of the group; wherein the movement of the group from the first event window to the second event window is rejected if it is determined that the first event window lacks at least one of the one or more assets of the group; and wherein the steps of the method are executed via at least one processor coupled to a memory. 2. The method of claim 1 , wherein at least two of the plurality of event windows are active at a same time. 3. The method of claim 1 , further comprising changing an order of activity of one or more of the event windows, wherein the change of the order of activity causes at least two event windows of the plurality of event windows to run in parallel. 4. The method of claim 3 , further comprising determining, prior to the change of the order of activity, whether the at least two event windows to run in parallel each include representations of the same assets. 5. The method of claim 3 , wherein the change of the order of activity modifies the workflow. 6. The method of claim 1 , wherein an event window of the plurality of event windows includes at least two snapshots overlapping with each other in time. 7. The method of claim 1 , further comprising dividing a given event window of the plurality of event windows having a given predetermined duration into a plurality of sub-windows, wherein each of the sub-windows is active for a duration shorter than the given predetermined duration. 8. The method of claim 1 , further comprising: dividing the group of the one or more assets into a first sub-group of the one or more assets and a second sub-group of the one or more assets; and moving the first sub-group to a different event window from the second sub-group. 9. The method of claim 1 , wherein the predetermined duration comprises a start time and an end time. 10. The method of claim 1 , wherein the movement of the group modifies the workflow. 11. A method comprising: generating a plurality of event windows representing events of a workflow, wherein each event window of the plurality of event windows is active for a predetermined duration; assigning, to each event window of the plurality of event windows, one or more assets to be migrated as a unit; and determining whether to change an order of activity of one or more of the event windows, wherein the change of the order of the activity causes at least two event windows of the plurality of event windows to run in parallel; wherein determining whether to change the order of activity of the one or more of the event windows comprises determining whether the at least two event windows to run in parallel each include representations of the same assets; wherein the change of the order of activity is rejected if it is determined that the at least two event windows each include the representations of the same assets; and wherein the steps of the method are executed via at least one processor coupled to a memory. 12. The method of claim 11 , wherein at least two of the plurality of event windows are active at a same time. 13. The method of claim 11 , wherein an event window of the plurality of event windows includes at least two snapshots overlapping with each other in time. 14. The method of claim 11 , further comprising dividing a given event window of the plurality of event windows having a given predetermined duration into a plurality of sub-windows, wherein each of the sub-windows is active for a duration shorter than the given predetermined duration. 15. A computer program product comprising a processor-readable storage medium having encoded therein executable code of one or more software programs, wherein the one or more software programs when executed by at least one processor implement the steps of: generating a plurality of event windows representing events of a workflow, wherein each event window of the plurality of event windows is active for a predetermined duration; assigning, to each event window of the plurality of event windows, one or more assets to be migrated as a unit; and determining whether to move a group of the one or more assets from a first event window of the plurality of event windows to a second event window of the plurality of event windows; wherein determining whether to move the group from the first event window to the second event window comprises determining whether the second event window includes the one or more assets of the group; and wherein the movement of the group from the first event window to the second event window is rejected if it is determined that the first event window lacks at least one of the one or more assets of the group. 16. The computer program product of claim 15 , wherein the one or more software programs when executed by the at least one processor further implement the step of changing an order of activity of one or more of the event windows, wherein the change of the order of activity causes at least two event windows of the plurality of event windows to run in parallel. 17. An apparatus comprising: a memory; and a processor operatively coupled to the memory and configured to: generate a plurality of event windows representing events of a workflow, wherein each event window of the plurality of event windows is active for a predetermined duration; assign, to each event window of the plurality of event windows, one or more assets to be migrated as a unit; and determine whether to move a group of the one or more assets from a first event window of the plurality of event windows to a second event window of the plurality of event windows; wherein, in determining whether to move the group from the first event window to the second event window, the processor is configured to determine whether the second event window includes the one or more assets of the group; and wherein the processor is further configured to reject the movement of the group from the first event window to the second event window if it is determined that the first event window lacks at least one of the one or more assets of the group. 18. The apparatus of claim 17 , wherein at least two of the plurality of event windows are active at a same time. 19. The apparatus of claim 17 , wherein the processor is further configured to change an order of activity of one or more of the event windows, wherein the change of the order of activity causes at least two event windows of the plurality of event windows to run in parallel. 20. The apparatus of claim 19 , wherein the processor is further configured to determine, prior to the change of the order of activity, whether the at least two event windows to run in parallel each include representations of the same assets. 21. The apparatus of claim 17 , wherein the processor is further configured to divide a given event window of the plurality of event windows having a given p
time dependent · CPC title
involving task migration · CPC title
Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues · CPC title
Priority · CPC title
Scheduler internals · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.