发明名称 Method for resource management allocating and freeing credits from and to a resource credit tree
摘要 A resource credit tree for resource management includes leaf nodes and non-leaf nodes. The non-leaf nodes include a root node and internal nodes. Resource management includes initializing a operation corresponding to a resource pool, selecting, using a hash function, a leaf node of a resource credit tree, and identifying a number of available credits of the leaf node. Resource management may further include traversing, using a backward traversal path, from the leaf node to a non-leaf node based on determining that the number of available credits is less than a required number of credits or determining that capacity of the leaf node is less than the summation of the number of credits to free to the resource credit tree and the number of available credits. Resource management may further allocating and freeing credits from and to the resource credit tree.
申请公布号 US8863140(B2) 申请公布日期 2014.10.14
申请号 US201113220518 申请日期 2011.08.29
申请人 Oracle International Corporation 发明人 Sistare Steven
分类号 G06F9/46;G06F9/50 主分类号 G06F9/46
代理机构 Osha Liang LLP 代理人 Osha Liang LLP
主权项 1. A method for resource management, comprising: initializing a first operation to allocate a first number of credits corresponding to at least one resource unit in resource pool; initializing a first tally of cascading credits to the first number of credits; selecting, using a hash function, a first leaf node of a resource credit tree; identifying a number of available credits of the first leaf node; determining, by a computer processor, that the first tally of cascading credits exceeds the number of available credits of the first leaf node; traversing, beginning at the first leaf node, the resource credit tree through a first backward traversal path to a first non-leaf node of the resource credit tree; modifying, while traversing the resource credit tree, the first tally of cascading credits based on a first number of credits and a predefined capacity of at least one node of a first plurality of nodes in the first backward traversal path, wherein the first backward traversal path comprises the first leaf node, the first non-leaf node, and a second non-leaf node; identifying a number of available credits of the first non-leaf node; determining, by the computer processor, that the number of available credits of the first non-leaf node exceeds the first tally of cascading credits; and allocating, to a client and from the first non-leaf node, the first number of credits in response to determining that the number of available credits of the first non-leaf node exceeds the first tally of cascading credits.
地址 Redwood Shores CA US