Issue and trigger rebalancing in a ranked issue management system
US-2016239777-A1 · Aug 18, 2016 · US
US10289971B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10289971-B2 |
| Application number | US-201514622792-A |
| Country | US |
| Kind code | B2 |
| Filing date | Feb 13, 2015 |
| Priority date | Feb 13, 2015 |
| Publication date | May 14, 2019 |
| Grant date | May 14, 2019 |
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.
Described herein is a computer implemented method for maintaining a plurality of issues, each issue having an associated rank value, the rank values of the plurality of issues defining an order of the plurality of issues. The method comprises receiving a rank operation request to change the rank of a subject issue; determining relevant issues to the rank operation request; and attempting to acquire locks on each of the relevant issues. In response to successfully acquiring locks on each of the relevant issues a new rank value for the subject issue is calculated and saved.
Opening claim text (preview).
What is claimed is: 1. A computer implemented method for performing an issue database balancing process, the method comprising: defining, by one or more database server computers, an issue database ranking scheme which defines allowable rank values and one or more issue buckets among which each issue record among a plurality of issue records is assigned within an issue database; maintaining, by the one or more database server computers, a plurality of issue database records, each issue database record having a rank value comprising a balancing component and a normal component which are read together as the rank value, wherein the balancing component identifies a current issue bucket of the plurality of issue buckets, wherein the rank value defines the order of the issue record with respect to other issue records in the database; performing, by the one or more server computers, one or more database balancing operations with a first processing thread, each database balancing operation being in respect of a given issue database record and comprising: determining, by the one or more database server computers, a new rank value for the given issue record, the new rank value resulting in the given issue record being moved from a current bucket to a new bucket and a new value for the normal component, and wherein the database balancing operation does not affect the order of the given issue record with respect to other issue records independent of the issue bucket with which the other issue records are associated; receiving, while performing the one or more database balancing operations, a request to reorder an issue record of the plurality of issue records; performing the request to reorder an issue record of the plurality of issue records with a second processing thread while the one or more balancing operations are performed with the first processing thread; and wherein the method is performed by one or more computing devices. 2. The computer implemented method according to claim 1 , wherein the issue buckets are defined by ranges of issue rank values. 3. The computer implemented method according to claim 2 , wherein determining a new rank value in a balancing operation comprises determining a new rank value falling within the range of rank values defining the new bucket. 4. The computer implemented method according to claim 1 , wherein the balancing component is of a greater significance than the normal component from an order determination perspective. 5. The computer implemented method according to claim 1 , wherein determining a new rank value in a balancing operation comprises determining a new balancing component rank value defining the new bucket and determining a new normal component rank value defining a rank within the new bucket. 6. The computer implemented method according to claim 1 , wherein determining a new rank value comprises determining the new rank value to have a rank length of less than a maximum issue rank length. 7. The computer implemented method according to claim 1 , wherein the balancing process comprises sequentially performing balancing operations on all issues maintained. 8. The computer implemented method according to claim 1 , further comprising determining a direction of the balancing process. 9. The computer implemented method according to claim 8 , wherein the direction of the balancing process is determined with reference to relative rankings of the current bucket the issues are ranked in and the new bucket the issues are to be balanced into, and wherein if the new bucket has a higher rank than the current bucket a balance up process is determined, and wherein if the new bucket has a lower rank than the current bucket a balance down process is determined. 10. The computer implemented method according to claim 8 , wherein if the balancing process is determined to be a balance up process, the balancing process comprises performing balancing operations on higher ranked issues before lower ranked issues. 11. The computer implemented method according to claim 10 , wherein the balancing up process comprises first balancing a maximum marker, the maximum marker defining a maximum rank value. 12. The computer implemented method according to claim 8 , wherein if the balancing process is determined to be a balance down process, the balancing process comprises performing balancing operations on lower ranked issues before higher ranked issues. 13. The computer implemented method according to claim 12 , wherein the balancing down process comprises first balancing a minimum marker, the minimum marker defining a maximum rank value. 14. A system for performing an issue database balancing process, the system comprising: one or more processors; one or more non-transitory computer-readable storage media storing sequences of instructions which, when executed by the one or more processors, cause the one or more processors to: define an issue ranking scheme which defines allowable rank values and one or more issue buckets among which each issue record is assigned within a database; maintain a plurality of issue database records within the database, each issue database record having a rank value comprising a balancing component and a normal component which are read together as the rank value, wherein the balancing component identifies a current issue bucket of the one or more issue buckets, wherein the rank value defines the order of the issue record with respect to other issue records in the database; perform one or more database balancing operations, each database balancing operation being in respect of a given issue database record and comprising causing the one or more processors to: determine a new rank value for the given issue database record, the new rank value resulting in the given issue database record being moved from a current bucket to a new bucket and a new value for the normal component, and wherein the balancing operation does not affect the order of the given issue database record with respect to other issue database records independent of the issue bucket with which the other issue database records are associated; receive, while performing the one or more database balancing operations, a request to reorder an issue database record of the plurality of issue database records; and perform the request to reorder an issue database record of the plurality of issue database records with a second processing thread while the one or more database balancing operations are performed with the first processing thread. 15. The system according to claim 14 , wherein the issue buckets are defined by ranges of issue rank values. 16. The system according to claim 15 , wherein determining a new rank value in a balancing operation comprises determining a new rank value falling within the range of rank values defining the new bucket. 17. The system according to claim 14 , wherein the balancing component is of a greater significance than the normal component from an order determination perspective. 18. The system according to claim 14 , wherein determining a new rank value in a balancing operation comprises determining a new balancing component rank value defining the new bucket and determining a new normal component rank value defining a rank within the new bucket. 19. The system according to claim 14 , wherein determining a new rank value comprises determining the new rank value to have a rank length of less than a maximum issue rank length. 20. The system according to claim 14 , wherein the balancing proces
Needs-based resource requirements planning or analysis · CPC title
Schedule adjustment for a person or group · CPC title
Sequencing of tasks or work · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.