Processor and memory communication in a stacked memory system
US-2024411709-A1 · Dec 12, 2024 · US
US11294775B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11294775-B2 |
| Application number | US-202016805050-A |
| Country | US |
| Kind code | B2 |
| Filing date | Feb 28, 2020 |
| Priority date | Feb 28, 2020 |
| Publication date | Apr 5, 2022 |
| Grant date | Apr 5, 2022 |
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.
Methods and systems for file level prioritization during a data backup operation are described. According to some embodiments, the method includes in response to a request to backup one or more files and for each file, sniffing file information of the file. The method further includes determining a backup critical level of the file based on the file information. The method further includes assigning a weighted value corresponding to the backup critical level of the file. The method further includes using the weighted value to calculate a Euclidean distance of the file to a next consecutive file.
Opening claim text (preview).
What is claimed is: 1. A computer-implemented method for file level prioritization during a data backup operation, comprising: in response to a request to backup one or more files and for each file, sniffing file information of the file; determining a backup critical level of the file based on the file information; assigning a weighted value corresponding to the backup critical level of the file; and using the weighted value to calculate a Euclidean distance of the file to a next consecutive file. 2. The method of claim 1 , further comprising storing the file information and the backup critical level of each file in a thesis file. 3. The method of claim 2 , further comprising sorting the one or more files based on the calculated Euclidean distance of each file. 4. The method of claim 3 , wherein sorting the one or more files comprises selecting a nearest and most critical file to be backed up based on the calculated Euclidean distance of the nearest and most critical file to a current file. 5. The method of claim 4 , further comprising backing up the sorted one or more files in accordance with the respective Euclidean distances of the sorted one or more files. 6. The method of claim 1 , wherein using the weighted value to calculate the Euclidean distance of the file comprises obtaining a dot product of the weighted value and a sequence of the file in a queue. 7. The method of claim 1 , wherein the file information comprises a file type or a filename. 8. A non-transitory machine-readable medium having instructions stored therein, which when executed by a processor, cause the processor to perform operations, the operations comprising: in response to a request to backup one or more files and for each file, sniffing file information of the file; determining a backup critical level of the file based on the file information; assigning a weighted value corresponding to the backup critical level of the file; and using the weighted value to calculate a Euclidean distance of the file to a next consecutive file. 9. The non-transitory machine-readable medium of claim 8 , wherein the operations further comprise storing the file information and the backup critical level of each file in a thesis file. 10. The non-transitory machine-readable medium of claim 9 , wherein the operations further comprise sorting the one or more files based on the calculated Euclidean distance of each file. 11. The non-transitory machine-readable medium of claim 10 , wherein sorting the one or more files comprises selecting a nearest and most critical file to be backed up based on the calculated Euclidean distance of the nearest and most critical file to a current file. 12. The non-transitory machine-readable medium of claim 11 , wherein the operations further comprise backing up the sorted one or more files in accordance with the respective Euclidean distances of the sorted one or more files. 13. The non-transitory machine-readable medium of claim 8 , wherein using the weighted value to calculate the Euclidean distance of the file comprises obtaining a dot product of the weighted value and a sequence of the file in a queue. 14. The non-transitory machine-readable medium of claim 8 , wherein the file information comprises a file type or a filename. 15. A data processing system, comprising: a processor; and a memory coupled to the processor to store instructions, which when executed by the processor, cause the processor to perform operations, the operations including: in response to a request to backup one or more files and for each file, sniffing file information of the file; determining a backup critical level of the file based on the file information; assigning a weighted value corresponding to the backup critical level of the file; and using the weighted value to calculate a Euclidean distance of the file to a next consecutive file. 16. The data processing system of claim 15 , wherein the operations further include storing the file information and the backup critical level of each file in a thesis file. 17. The data processing system of claim 16 , wherein the operations further include sorting the one or more files based on the calculated Euclidean distance of each file. 18. The data processing system of claim 17 , wherein sorting the one or more files comprises selecting a nearest and most critical file to be backed up based on the calculated Euclidean distance of the nearest and most critical file to a current file. 19. The data processing system of claim 18 , wherein the operations further include backing up the sorted one or more files in accordance with the respective Euclidean distances of the sorted one or more files. 20. The data processing system of claim 15 , wherein using the weighted value to calculate the Euclidean distance of the file comprises obtaining a dot product of the weighted value and a sequence of the file in a queue. 21. The data processing system of claim 15 , wherein the file information comprises a file type or a filename.
Backup scheduling policy · CPC title
Improving or facilitating administration, e.g. storage management · CPC title
for networked environments · CPC title
Details of searching files based on file metadata · CPC title
implemented using Network-attached Storage [NAS] architecture (distributed or networked storage systems G06F3/067; protocols for distributed storage of data in a network H04L67/1097) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.