Abstract: 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.

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.

Abstract: 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.

Abstract: Techniques for improving server-side execution of script code include in one embodiment: receiving, at a server computer, a request from a client computer to provide a service of an application that the server computer hosts; acquiring a particular runtime from among a plurality of pre-computed runtimes in a runtime pool, each of the pre-computed runtimes in the runtime pool comprising an executable combination of computer program script code and context data that is programmed to create and use one or more data items having global scope; using the server computer, providing the request to the particular runtime and executing the particular runtime to cause generating a response to the request; transmitting the response to the client computer; cleaning up the one or more data items having global scope and returning the particular runtime to the runtime pool after completing the cleaning up.

Abstract: Techniques for improving server-side execution of script code include in one embodiment: receiving, at a server computer, a request from a client computer to provide a service of an application that the server computer hosts; acquiring a particular runtime from among a plurality of pre-computed runtimes in a runtime pool, each of the pre-computed runtimes in the runtime pool comprising an executable combination of computer program script code and context data that is programmed to create and use one or more data items having global scope; using the server computer, providing the request to the particular runtime and executing the particular runtime to cause generating a response to the request; transmitting the response to the client computer; cleaning up the one or more data items having global scope and returning the particular runtime to the runtime pool after completing the cleaning up.

Abstract: 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.

Abstract: 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.

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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.