Rdma-optimized high-performance distributed cache
US-2016269502-A1 · Sep 15, 2016 · US
US9811501B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9811501-B2 |
| Application number | US-201514926850-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 29, 2015 |
| Priority date | Oct 23, 2015 |
| Publication date | Nov 7, 2017 |
| Grant date | Nov 7, 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.
A local processing apparatus and a data transceiving method thereof are provided. The local processing apparatus includes a communication module configured to transceive the data with the one or more distributed storage units, a memory configured to store a program for transceiving the data and the one or more key-value data pairs, and a processor configured to execute the program, the processor confirms whether a first key-value data exists in the memory by executing the program, and determines whether to prefetch one or more key-value data corresponding to the first key-value data based on the confirmation result.
Opening claim text (preview).
What is claimed is: 1. A local processing apparatus transceiving data with one or more distributed storage units in which one or more key-value data pairs are stored, respectively, the local processing apparatus comprising: a communication module configured to transceive the data with the one or more distributed storage units; a memory configured to store a program for transceiving the data and the one or more key-value data pairs; and a processor configured to execute the program, wherein the processor confirms whether a first key-value data exists in the memory by executing the program, and determines whether to prefetch one or more key-value data corresponding to the first key-value data based on the confirmation result, wherein a reference pattern for the one or more key-value data which are next referenced by each key-value data is stored in the memory based on a probability value, wherein the processor determines whether to prefetch the key-value data based on a transmission size of the key-value data and a transmission delay time corresponding to the transmission size, and wherein, when it is confirmed that the first key-value data does not exist, the processor searches for the first key-value data stored in the distributed storage unit, and prefetches the one or more key-value data corresponding to the searched first key-value data together with the first key-value data, and wherein the processor performs the prefetching when a first transmission delay time in a case of prefetching the first key-value data and the one or more key-value data which are next referenced by the first key-value data is smaller than a second transmission delay time in a case of receiving the first key-value data and the one or more key-value data which are next referenced by the first key-value data, respectively. 2. The local processing apparatus of claim 1 , wherein the communication module transceives the data with the one or more distributed storage units through infiniband supporting a remote direct memory access (RDMA). 3. The local processing apparatus of claim 1 , wherein the second transmission delay time is calculated based on a transmission delay time of the first key-value data and a transmission delay time and a probability value of a key-value data having the lowest probability value among the one or more key-value data which are next referenced. 4. The local processing apparatus of claim 1 , wherein the processor updates the probability value corresponding to the reference pattern for the one or more key-value data which are next referenced by the first key-value data. 5. The local processing apparatus of claim 1 , wherein, when it is confirmed that there first key-value data exists, the processor does not prefetch the one or more key-value data which are next referenced by the first key-value data, and updates the probability value corresponding to the reference pattern for the one or more key-value data which are next referenced by the first key-value data. 6. The local processing apparatus of claim 1 , wherein a transmission delay time table, in which a transmission delay time corresponding to a transmission size of the key-value data is mapped, is stored in the memory, and wherein the processor updates the transmission delay time table when the communication module receives the key-value data. 7. The local processing apparatus of claim 1 , wherein the reference pattern denotes a probability of receiving each of the one or more key-value data corresponding to the first key-value data as a next reference of the first key-value data. 8. A data transceiving method of a local processing apparatus transceiving data with one or more distributed storage units in which one or more key-value data pairs are stored, respectively, the data transceiving method comprising: confirming whether a first key-value data is stored in a memory of the local processing apparatus; and determining whether to prefetch one or more key-value data corresponding to the first key-value data based on the confirmation result, wherein a reference pattern for the one or more key-value data which are next referenced by each key-value data is stored in the memory, whether to prefetch the one or more key-value data is determined based on a transmission size of the key-value data and a transmission delay time corresponding to the transmission size, wherein, when it is confirmed that the first key-value data is not stored in the memory, the data transceiving method further comprises: searching for the first key-value data stored in a distributed storage unit; and prefetching one or more key-value data corresponding to the searched first key-value data together with the first key-value data, and wherein the determining whether to prefetch the one or more key-value data performs the prefetching when a first transmission delay time in a case of prefetching the first key-value data and the one or more key-value data which are next referenced by the first key-value data is smaller than a second transmission delay time in a case of receiving the first key-value data and the one or more key-value data which are next referenced by the first key-value data, respectively. 9. The data transceiving method of claim 8 , wherein, when it is confirmed that the first key-value data is not stored in the memory, the data transceiving method further comprises: updating a probability value corresponding to the reference pattern for the one or more key-value data which are next referenced by the first key-value data. 10. The data transceiving method of claim 8 , wherein when it is confirmed that the first key-value data is stored in the memory, the data transceiving method further comprises updating a probability value corresponding to the reference pattern for the one or more key-value data which are next referenced by the first key-value data, and wherein the one or more key-value data which are next referenced by the first key-value data are not prefetched. 11. The local processing apparatus of claim 1 , wherein the processor further determines whether to prefetch the key-value data based on the probability value.
Probabilistic graphical models, e.g. probabilistic networks · CPC title
for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS] · CPC title
using a common memory, e.g. mailbox · CPC title
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.