Method for providing maximal concurrency in a tree structure
AssigneesInternational Business Machines Corporation, University of Massachusetts
InventorsRajesh Ramkrishna Bordawekar, John Eliot Moss
Life of this patent
Estimating the term…
Abstract
Techniques for providing maximal concurrency while ensuring no deadlock in a tree structure are provided. The techniques include accessing a minimum number of one or more nodes to perform an operation.
Claims20
A method for providing maximal concurrency while ensuring no deadlock in a tree structure, comprising accessing a minimum number of one or more nodes to perform an operation.
The method of 1, wherein accessing a minimum number of one or more nodes to perform an operation comprises accessing one node at a time to perform at least one of a search, an insertion and a deletion, wherein the at least one of the search, insertion and deletion do not need to modify the tree structure.
The method of 1, wherein accessing a minimum number of one or more nodes to perform an operation comprises accessing two or more nodes at a time to modify the tree structure.
The method of 3, wherein accessing two or more nodes at a time comprises accessing two or more nodes at a same level of the tree structure.
The method of 3, wherein accessing two or more nodes at a time comprises accessing two or more nodes in a left-to-right order.
A computer program product comprising a computer readable medium having computer readable program code for providing maximal concurrency while ensuring no deadlock in a tree structure, said computer program product including:
- computer readable program code for accessing a minimum number of one or more nodes to perform an operation.
An apparatus for providing maximal concurrency while ensuring no deadlock in a tree structure, comprising:
- a memory;
- and
- at least one processor coupled to said memory and operative to:
- access a minimum number of one or more nodes to perform an operation.
Dependencies are inferred from the claim text.