Calculation of the degree of participation of a server in a cluster using half-life decay

• US 7,716,328 B2
• Filed: 11/19/2007
• Issued: 05/11/2010
• Est. Priority Date: 11/19/2007
• Status: Active Grant

• Current Assignee: Red Hat, Inc. (International Business Machines Corporation)
• Original Assignee: Red Hat, Inc. (International Business Machines Corporation)
• Inventors: Surtani, Manik Ram, Greene, Jason Thomas
• Primary Examiner(s): Srivastava; Vivek
• Assistant Examiner(s): ELFERVIG, TAYLOR A
• Application Number:
  US11/986,249
• Publication Number:
  US 20090132695A1
• Time in Patent Office: 904 Days
• Field of Search: 709/224
• US Class Current: 709/224
• CPC Class Codes: H04L 43/106 using time related information in packets, e.g. by adding timestamps
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/1029 using data related to the state of servers by a load balancer
• CPC Class Codes: H04L 67/535 Tracking the activity of the user network monitoring arrangements H04L43/00; recording of computer activity G06F11/34
• CPC Class Codes: H04L 67/56 Provisioning of proxy services store-and-forward switching systems in data switching networks H04L12/54
• CPC Class Codes: H04L 67/5682 Policies or rules for updating, deleting or replacing the stored data

Abstract

A method and apparatus for calculating a degree of participation of a server in a group of servers is disclosed. In one embodiment, a memory stores timestamps for each access to the server. A processor weights the timestamps to treat more recent accesses as more important than older accesses, wherein older accesses decay in importance exponentially using a half-life constant.

Claims

1. A computer-implemented method for calculating a degree of participation of a cache node of a cluster of cache nodes in a tree-based structure, the method comprising:

maintaining a log of timestamps for each access to the cache node;

weighting the timestamps to treat recent accesses with priority over older accesses, wherein older accesses decay in priority exponentially using a half-life constant;

storing, for each cache node in the cluster, a degree of participation (Dp), a timestamp of when the degree of participation was calculated (Dt), a list of timestamps when the group was accessed (At), a half-life decay constant (H), wherein Dp and Dt are calculated and stored to minimize the number of elements in At; and

computing the degree of participation (Dp) with Dp=Dp×

(½

^((Tc−

At)/H)), wherein Tc is the current time in milliseconds,

wherein the degree of participation is a function of a total number of accesses to the cache node.

2. The computer-implemented method of claim 1 further comprising:

emptying the list of At collected after computing the degree of participation Dp.

3. A computer-implemented method for calculating a degree of participation of a server in a group of servers, the method comprising:

maintaining a log of timestamps for each access to the server; and

weighting the timestamps to treat recent accesses with priority over older accesses, wherein older accesses decay in priority exponentially using a half-life constant;

storing, for each cache node in the group, a degree of participation (Dp), a timestamp of when the degree of participation was calculated (Dt), a list of timestamps when the group was accessed (At), a half-life decay constant (H), wherein Dp and Dt are calculated and stored to minimize the number of elements in At; and

computing the degree of participation (Dp) with Dp=Dp×

(½

^((Tc−

At)/H)), wherein Tc is the current time in milliseconds,

wherein the degree of participation is a function of a total number of accesses to the server.

4. The computer-implemented method of claim 3 further comprising:

emptying the list of At collected after computing the degree of participation Dp.

5. A computer-readable storage medium, having instructions stored therein, which when executed, cause a computer system to perform a method for calculating a degree of participation of a cache node of a cluster of cache nodes in a tree-based structure comprising:

maintaining a log of timestamps for each access to the cache node; and

weighting the timestamps to treat recent accesses with priority over older accesses, wherein older accesses decay in priority exponentially using a half-life constant;

storing, for each cache node in the cluster, a degree of participation (Dp), a timestamp of when the degree of participation was calculated (Dt), a list of timestamps when the group was accessed (At), a half-life decay constant (H), wherein Dp and Dt are calculated and stored to minimize the number of elements in At; and

computing the degree of participation (Dp) with Dp=Dp×

(½

^((Tc−

At)/H)), wherein Tc is the current time in milliseconds,

wherein the degree of participation is a function of a total number of accesses to the cache node.

6. The computer-readable storage medium of claim 5 wherein the method further comprises:

emptying the list of At collected after computing the degree of participation Dp.

7. A computer-readable storage medium, having instructions stored therein, which when executed, cause a computer system to perform a method for calculating a degree of participation of a server in a group of servers comprising:

maintaining a log of timestamps for each access to the server;

weighting the timestamps to treat recent accesses with priority over older accesses, wherein older accesses decay in priority exponentially using a half-life constant;

storing, for each cache node in the cluster, a degree of participation (Dp), a timestamp of when the degree of participation was calculated (Dt), a list of timestamps when the group was accessed (At), a half-life decay constant (H), wherein Dp and Dt are calculated and stored to minimize the number of elements in At; and

computing the degree of participation (Dp) with Dp=Dp×

(½

^((Tc−

At)/H)), wherein Tc is the current time in milliseconds,

wherein the degree of participation is a function of a total number of accesses to the server.

8. The computer-readable storage medium of claim 7 wherein the method further comprises:

emptying the list of at collected after computing the degree of participation Dp.

9. An apparatus for calculating a degree of participation of a cache node of a cluster of cache nodes in a tree-based structure, the apparatus comprising:

a memory configured to store a log of timestamps for each access to the cache node; and

a processor coupled to the memory, the processor configured to weight the timestamps to treat recent accesses with priority over older accesses, wherein older accesses decay in priority exponentially using a half-life constant,

wherein the memory is configured to store, for each cache node in the cluster, a degree of participation (Dp), a timestamp of when the degree of participation was calculated (Dt), a list of timestamps when the group was accessed (At), a half-life decay constant (H), Dp and Dt are calculated and stored to minimize the number of elements in At,

wherein the processor is configured to compute the degree of participation (Dp) with Dp=Dp×

(½

^((Tc−

At)/H)), wherein Tc is the current time in milliseconds, and to empty the list of At collected after computing the degree of participation Dp.

10. An apparatus for calculating a degree of participation of a server in a group of servers, the apparatus comprising:

a memory configured to store a log of timestamps for each access to the server; and

a processor coupled to the memory, the memory configured to weight the timestamps to treat recent accesses with priority over older accesses, wherein older accesses decay in priority exponentially using a half-life constant,

wherein the memory is configured to store, for each server in the group, a degree of participation (Dp), a timestamp of when the degree of participation was calculated (Dt), a list of timestamps when the group was accessed (At), a half-life decay constant (H), Dp and Dt are calculated and stored to minimize the number of elements in At,

wherein the processor is configured to compute the degree of participation (Dp) with Dp=Dp×

(½

^((Tc−

At)/H)), wherein Tc is the current time in milliseconds, and to empty the list of At collected after computing the degree of participation Dp.