Hybrid Model Of Fine-Grained Locking And Data Partitioning
US-2024411726-A1 · Dec 12, 2024 · US
US9996289B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9996289-B2 |
| Application number | US-201514884501-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 15, 2015 |
| Priority date | Oct 21, 2014 |
| Publication date | Jun 12, 2018 |
| Grant date | Jun 12, 2018 |
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.
Embodiments of the present disclosure provide a method and apparatus for assigning lock resources to objects by obtaining a first alternative lock for the object, and determining first correlations between the object and each of one or more other objects when the first alternative lock has been assigned to the one or more other objects, wherein in response to determining that each of the first correlations is lower than a predetermined threshold, assign the first alternative lock to the object, and may maximize the possibility of parallel execution and reduce the time waiting for lock resources, thereby avoiding lock contention.
Opening claim text (preview).
What is claimed is: 1. A method for assigning a lock resource to a first object, comprising: a. obtaining a first alternative lock for the first object; b. determining first correlations between the first object and each of one or more other objects when the first alternative lock has been assigned to the one or more other objects; c. in response to determining that each of the first correlations is lower than a predetermined threshold, assigning the first alternative lock to the first object; d. in response to determining that any of the first correlations being higher than the predetermined threshold: i. obtaining a second alternative lock for the first object; ii. determining second correlations between the first object and each of the one or more other objects when the second alternative lock has been assigned to the one or more other objects; and iii. in response to determining that each of the second correlations being lower than the predetermined threshold, assigning the second alternative lock to the object; and e. in response to determining that any of the second correlations being higher than the predetermined threshold: i. calculating a first value of all of the first correlations as a first correlation value for the first alternative lock; ii. calculating a second value of all of the second correlations as a seccond correlation value for the second alternative lock; and iii. triggering the first alternative lock or the second alternative lock that has a larger one between the first correlation value and the second correlation value of the correlation values not to be assigned to the object. 2. The method according to claim 1 , wherein a correlation between two objects is determined based on whether the two objects belong to one or more of the following consisting from a group of: a same clone group, a same RAID group, a same resource pool and a same deduplication domain. 3. The method according to claim 1 , further comprising storing information of the lock resource assigned to the first object. 4. An apparatus for assigning a lock resource to a first object, comprising a processing unit configured to: a. obtaining a first alternative lock for the first object; b. determining first correlations between the first object and each of one or more other objects when the first alternative lock has been assigned to the one or more other objects; c. in response to determining that each of the first correlations is lower than a predetermined threshold, assigning the first alternative lock to the first object; d. in response to determining that any of the first correlations being higher than the predetermined threshold: i. obtaining a second alternative lock for the first object; ii. determining second correlations between the first object and each of the one or more other objects when the second alternative lock has been assigned to the one or more other objects; and iii. in response to determining that each of the second correlations being lower than the predetermined threshold, assigning the second alternative lock to the first object; and e. in response to determining that any of the second correlations being higher than the predetermined threshold: i. calculating a first value of all of the first correlations as a first correlation value for the first alternative lock; ii. calculating a second value of all of the second correlations as a second correlation value for the second alternative lock; and iii. triggering the first alternative lock or the second alternative lock that has a larger one between the first correlation value and the second correlation value of the correlation values not to be assigned to the object. 5. The apparatus according to claim 4 , wherein a correlation between two objects is determined based on whether the two objects belong to one or more of the following consisting from a group of: a same clone group, a same RAID group, a same resource pool, and a same deduplication domain. 6. The apparatus according to claim 4 , further configured to store information of the lock resource assigned to the object.
Locking methods, e.g. locking methods for file systems allowing shared and concurrent access to files · CPC title
Disk arrays, e.g. RAID, JBOD · CPC title
in relation to access · CPC title
Command handling arrangements, e.g. command buffers, queues, command scheduling · CPC title
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.