Issue and trigger rebalancing in a ranked issue tracking system

Patent metadata

Field	Value
Publication number	US-11544650-B2
Application number	US-201916361789-A
Country	US
Kind code	B2
Filing date	Mar 22, 2019
Priority date	Feb 13, 2015
Publication date	Jan 3, 2023
Grant date	Jan 3, 2023

Abstract

A computer-implemented method is disclosed. The method comprises calculating a first new rank value in a rank address space for a first issue of a plurality of issues. The rank address space comprises unique, ordered values, and each of the plurality of issues has a rank value in the rank address space. The method further comprises determining whether a length of the first new rank value is greater than or equal to a first rebalancing trigger length. In addition, the method comprises, in response to determining that the length of the first new rank value is greater than or equal to the first rebalancing trigger length, identifying a first delay period that is to elapse before rebalancing the rank address space comprising updating at least one rank value of at least one of the plurality of issues to reduce a possibility of congestion in the rank address space. The method additionally comprises following the first delay period, rebalancing the rank address space.

First claim

What is claimed is:

1. A computer-implemented method of triggering an issue balancing process, comprising:
calculating, by one or more computing instances of a networked computing system, a first new rank value for a first issue of a plurality of issues being stored in a database, each issue of the plurality of issues having a rank value stored in a rank address space having a predetermined address space size corresponding to a maximum allowed rank length value that is based on a maximum byte limit for a field of a data structure being used to store each issue of the plurality of issues;
comparing, by the one or more computing instances of the networked computing system, a rank value length of the first new rank value with a first rebalancing trigger length, the first rebalancing trigger length is less than the maximum allowed rank length value;
in accordance with the rank value length of the first new rank value being greater than or equal to the first rebalancing trigger length:
identifying, by the one or more computing instances of the networked computing system, a subset of issues that are associated with a portion of the rank address space that is congested;
decongesting, by the one or more computing instances of the networked computing system, the portion of the rank address space by rebalancing the portion of the rank address space, the rebalancing the portion of the rank address space comprising:
updating, by the one or more computing instances of the networked computing system, a rank value of each issue of the subset of the plurality of issues, the rank value of each issue of the subset of the plurality of issues is updated such that:
a spacing between adjacent rank values in the portion of the rank address space is increased; and
a relative position of each issue of the subset of the plurality of issues in the portion of the rank address space with respect to other issues of the subset of the plurality of issues, before and after rebalancing the portion of the rank address space, remains unchanged.

2. The computer-implemented method of claim 1 , further comprising defining a plurality of rebalancing trigger lengths, including the first rebalancing trigger length and a second rebalancing trigger length, and an associated plurality of delay periods, including a first delay period and a second delay period,
wherein decongesting the portion of the rank address space is performed subsequent to the first delay period elapsing upon determining the rank value length of the first rank value is greater than or equal to the first rebalancing trigger length.

3. The computer-implemented method of claim 2 ,
the first rebalancing trigger length being shorter than the second rebalancing trigger length,
the first delay period being longer than the second delay period.

4. The computer-implemented method of claim 2 , the first rebalancing trigger length being a longest trigger length among the plurality of rebalancing trigger lengths that is less than or equal to the rank value length of the first new rank value.

5. The computer-implemented method of claim 1 , wherein the portion of the rank address space is a first portion of the rank address space, and
the method further comprising:
subsequent to decongesting the first portion of the rank address space, calculating, by the one or more computing instances of the networked computing system, a second new rank value for a second issue of the plurality of issues;

comparing, by the one or more computing instances of the networked computing system, a rank value length of the second new rank value with a second rebalancing trigger length;
in accordance with the rank value length of the second new rank value being greater than or equal to the second rebalancing trigger length:
identifying, by the one or more computing instances of the networked computing system, a second portion of the rank address space that is congested;
decongesting, by the one or more computing instances of the networked computing system, the second portion of the rank address space by rebalancing the second portion of the rank address space.

6. The computer-implemented method of claim 2 , wherein the first delay period being defined to cause the decongesting the portion of the rank address space to commence at a low activity time of the one or more computing instances of a networked computing system.

7. The computer-implemented method of claim 1 , further comprising:
determining that an attempt to re-rank a second issue of the plurality of issues has failed due to congestion of the portion of the rank address space;
rebalancing the portion of the rank address space without a delay.

8. The computer-implemented method of claim 7 , further comprising freezing user-initiated issue ranking operations for a certain amount of time.

9. The computer-implemented method of claim 1 , the rank value of each of the plurality of issues comprising a balancing component and a normal component, the balancing component identifying a current issue bucket of a plurality of issue buckets within the rank address space, the normal component comprising one or more characters.

10. One or more non-transitory storage media storing instructions which, when executed cause one or more processors to perform a method of triggering an issue balancing process, the method comprising:
calculating a first new rank value for a first issue of a plurality of issues being stored in a database, comprising each issue of the plurality of issues having a rank value stored in a rank address space having a predetermined address space size corresponding to a maximum allowed rank length value that is based on a maximum byte limit for a field of a data structure being used to store each issue of the plurality of issues;
comparing a rank value length of the first new rank value with a first rebalancing trigger length, the first rebalancing trigger length is less than the maximum allowed rank length value;
in accordance with the rank value length of the first new rank value being greater than or equal to the first rebalancing trigger length:
identifying, by the one or more computing instances of the networked computing system, a subset of issues that are associated with a portion of the rank address space that is congested;
decongesting, by the one or more computing instances of the networked computing system, the portion of the rank address space by rebalancing the portion of the rank address space, the rebalancing the portion of the rank address space comprising:
updating, by the one or more computing instances of the networked computing system, a rank value of each issue of the subset of the plurality of issues, the rank value of each issue of the subset of the plurality of issues is updated such that:
a spacing between adjacent rank values in the portion of the rank address space is increased; and
a relative position of each issue of the subset of the plurality of issues in the portion of the rank address space with respect to other issues of the subset of the plurality of issues, before and after rebalancing the portion of the rank address space, remains unchanged.

11. The one or more non-transitory storage media of claim 10 , the method further comprising defining a plurality of rebalancing trigger lengths, including the first rebalancing trigger length and a second rebalancing trigger length, and an associated plurality of delay periods, including a first delay period and a second delay period,
wherein decongesting the portion of the rank address space is performed subsequent to the first delay period elapsing upon determining the rank value length of the first rank value is greater than or equal to

Assignees

• Atlassian Pty Ltd

Inventors

• Lassau Mark
• Quail Matt
• Petrov Nikolay
• Bosticky Ivo
• Elias Michael

Classifications

• G06Q10/063116 Primary

  Schedule adjustment for a person or group · CPC title

• G06Q10/06316 Primary

  Sequencing of tasks or work · CPC title

• G06Q10/06315

  Needs-based resource requirements planning or analysis · CPC title