Performing a write-prioritized tree copy
AssigneeInternational Business Machines Corporation
InventorBrian David Hatfield
Life of this patent
Estimating the term…
Abstract
A computer-implemented method according to one embodiment includes obtaining a first latch for a first node within a tree data structure; copying a first version number of the first node; unlatching the first node; copying the first node; latching the first node a second time after completing the copying; copying a second version number of the first node; and performing one or more actions in response to a comparison of the first version number and the second version number.
Claims19
A computer-implemented method for performing a write-prioritized tree copy in a data storage system, comprising:
- obtaining a first latch for a first node within a tree data structure;
- copying a first version number of the first node while the first node is latched;
- unlatching the first node;
- copying the first node, including postponing a coalesce operation involving the first node and a left sibling of the first node while a copy operation is reading the first node, wherein the postponement occurs in response to determining that the copy operation has a higher priority than the coalesce operation;
- latching the first node a second time after completing the copying;
- copying a second version number of the first node while the first node is latched;
- and
- performing one or more actions in response to a comparison of the first version number and the second version number.
A computer program product for performing a write-prioritized tree copy in a data storage system, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, the program instructions executable by a processor to cause the processor to perform a method comprising:
- obtaining a first latch for a first node within a tree data structure;
- copying a first version number of the first node while the first node is latched;
- unlatching the first node;
- copying the first node, including postponing a coalesce operation involving the first node and a left sibling of the first node while a copy operation is reading the first node, wherein the postponement occurs in response to determining that the copy operation has a higher priority than the coalesce operation;
- latching the first node a second time after completing the copying;
- copying a second version number of the first node while the first node is latched;
- and
- performing one or more actions in response to a comparison of the first version number and the second version number.
A system for performing a write-prioritized tree copy in a data storage system, comprising:
- a processor;
- and
- logic integrated with the processor, executable by the processor, or integrated with and executable by the processor, the logic being configured to:
- obtain a first latch for a first node within a tree data structure;
- copy a first version number of the first node while the first node is latched;
- unlatch the first node;
- copy the first node, including postponing a coalesce operation involving the first node and a left sibling of the first node while a copy operation is reading the first node, wherein the postponement occurs in response to determining that the copy operation has a higher priority than the coalesce operation;
- latch the first node a second time after completing the copying;
- copy a second version number of the first node while the first node is latched;
- and
- perform one or more actions in response to a comparison of the first version number and the second version number.
Dependencies are inferred from the claim text.