Computer system and method for service load distributing

• US 7,668,935 B2
• Filed: 08/26/2004
• Issued: 02/23/2010
• Est. Priority Date: 08/29/2003
• Status: Active Grant

• Current Assignee: Kabushiki Kaisha Toshiba (Toshiba Corporation), Toshiba Digital Solutions Corporation (Toshiba Corporation)
• Original Assignee: Kabushiki Kaisha Toshiba (Toshiba Corporation)
• Inventors: Mizoguchi, Kenichi
• Primary Examiner(s): Vaughn, Jr.; William C
• Assistant Examiner(s): Cloud; Joiya M
• Application Number:
  US10/926,310
• Publication Number:
  US 20050050198A1
• Time in Patent Office: 2,007 Days
• Field of Search: 709/218
• US Class Current: 709/218
• CPC Class Codes: G06F 9/5083 Techniques for rebalancing the load in a distributed system

Abstract

In a computer system executing a plurality of types of services, a service load monitor measures a load required to execute services in each of the computers. A node load monitor measures a load on each of the computers. A service optimal allocation machine determines an optimal computer and a service to be reallocated to the optimal computer, based on the measurement results of the service load monitor and the node load monitor, and reallocates the determined service to the optimal computer.

Claims

1. A computer system comprising a plurality of computers and executing a plurality of types of services further comprising:

service load monitor means for measuring, as a service load, a load required to execute services in each of the computers,

wherein the service load monitor means includes means for calculating, as the service load, dynamic service ticket values based on an amount of resources used when each of the computers executes services, the dynamic service ticket values indicating dynamic loads of the services;

node load monitor means for measuring, as a node load, a load on each of the computers,

wherein the node load monitor means includes;

means for calculating a total service ticket value indicating the node load of each of the computers, based on the dynamic service ticket values of the services executed in each of the computers; and

means for calculating a dynamic node ticket value as a new ticket value usable in each of the computers, based on the total service ticket value of each of the computers and a static node ticket value indicating a preset processing capacity of each of the computers;

parallel-execution-type service executing means for making at least two of the computers to execute same parallel-execution-type services in parallel; and

service optimal allocation means for determining an optimal computer included in the computers to execute services, and a service to be reallocated to the optimal computer, based on measurement results of the service load monitor means and the node load monitor means, the service optimal allocation means reallocating the determined service to the determined optimal computer,

wherein the service optimal allocation means includes;

means for selecting a service to be reallocated to the optimal computer, from the services under execution in at least one of the computers in which the dynamic node ticket value is not more than a preset value;

means for calculating an optimal number of computers used to execute the same parallel-execution-type services in parallel in the system, based on dynamic service ticket values of the same parallel-execution-type services executed by the computers, and static service ticket values indicating resource amounts pre-estimated to be needed for executing the same parallel-execution-type services in the computers; and

means for adjusting a current number of computers which are used to currently execute the same parallel-execution-type services in parallel in the system, in accordance with a difference between the current number and the optimal number.

2. The computer system according to claim 1, wherein the service optimal allocation means further includes means for searching for the optimal computer, to which the service selected by the selecting means is to be reallocated, based on the dynamic node ticket value of each of the computers.

3. The computer system according to claim 1, wherein the adjusting means includes means for selecting, if the optimal number is larger than the current number, a computer to be controlled by the parallel-execution-type service executing means to execute one of the same parallel-execution-type services, from those of the computers which can newly execute the same parallel-execution-type services, in order beginning from a largest difference between the static node ticket value and the dynamic node ticket value.

4. The computer system according to claim 3, wherein the adjusting means includes means for selecting, if the optimal number is smaller than the current number, a computer in which execution of one of the same parallel-execution-type services is to be stopped, from those of the computers in which executions of the same parallel-execution-type services can be stopped, in order beginning from a smallest difference between the static node ticket value and the dynamic node ticket value.

5. The computer system according to claim 1, wherein the adjusting means includes means for selecting, if the optimal number is smaller than the current number, a computer in which execution of one of the same parallel-execution-type services is to be stopped, from those of the computers in which executions of the same parallel-execution-type services can be stopped, in order beginning from a smallest difference between the static node ticket value and the dynamic node ticket value.

6. A method of dynamically distributing services, for use in a computer system including a plurality of computers and executing a plurality of types of services, comprising:

acquiring service load information indicating loads of services executed in each of the computers,

wherein the acquiring the service load information includes calculating, as the service load information, dynamic service ticket values based on an amount of resources used when each of the computers executes services, the dynamic service ticket values indicating dynamic loads of the services;

acquiring node load information indicating a load on each of the computers,

wherein the acquiring the node load information includes;

calculating a total service ticket value indicating the node load information of each of the computers, based on the dynamic service ticket values of the services executed in each of the computers; and

calculating a dynamic node ticket value as a new ticket value usable in each of the computers, based on the total service ticket value of each of the computers and a static node ticket value indicating a preset processing capacity of each of the computers;

determining an optimal computer included in the computers to execute services, and a service to be reallocated to the optimal computer,

wherein the determining includes selecting a service to be reallocated to the optimal computer, from the services under execution in at least one of the computers in which the dynamic node ticket value is not more than a preset value;

reallocating the determined service to the determined optimal computer;

executing, in parallel, same parallel-execution-type services using at least two of the computers;

calculating an optimal number of computers used to execute the same parallel-execution-type services in parallel in the system, based on dynamic service ticket values of the same parallel-execution-type services executed by the computers, and static service ticket values indicating resource amounts pre-estimated to be needed for executing the same parallel-execution-type services in the computers; and

adjusting a current number of computers which are used to currently execute the same parallel-execution-type services in parallel in the system, in accordance with a difference between the current number and the optimal number.

7. A computer-readable storage medium which tangibly embodies a computer program product for enabling dynamic load distributing of services in a computer system executing a plurality of types of services, the computer system including a plurality of computers having a service load monitor and a node load monitor, comprising:

means for acquiring, from the service load monitor, service load information indicating loads of services executed in each of the computers, the service load information including dynamic service ticket values which are calculated based on an amount of resources used when each of the computers executes services, the dynamic service ticket values indicating dynamic loads of the services;

means for acquiring, from the node load monitor, a total service ticket value indicating a load on each of the computers, the total service ticket value being calculated by the node load monitor, based on the dynamic service ticket values of the services executed in each of the computers,

wherein the acquiring the total service ticket value includes acquiring from the node load monitor, a dynamic node ticket value which is calculated based on the total service ticket value of each of the computers and a static node ticket value indicating a preset processing capacity of each of the computers, the dynamic node ticket value being a new ticket value usable in each of the computers;

means for determining an optimal computer included in the computers to execute services, and a service to be reallocated to the optimal computer,

wherein the determining includes selecting a service to be reallocated to the optimal computer, from the services under execution in at least one of the computers in which the dynamic node ticket value is not more than a preset value;

means for reallocating the determined service to the determined optimal computer;

means for executing, in parallel, same parallel-execution-type services using at least two of the computers;

means for calculating an optimal number of computers used to execute the same parallel-execution-type services in parallel in the system, based on dynamic service ticket values of the same parallel-execution-type services executed by the computers, and static service ticket values indicating resource amounts pre-estimated to be needed for executing the same parallel-execution-type services in the computers; and

means for adjusting a current number of computers which are used to currently execute the same parallel-execution-type services in parallel in the system, in accordance with a difference between the current number and the optimal number.