Distributed processing system, job distribution method and distribution program

• US 20030074387A1
• Filed: 09/16/2002
• Published: 04/17/2003
• Est. Priority Date: 09/18/2001
• Status: Abandoned Application

• Current Assignee: Matsushita Electric Industrial Company Limited (Panasonic Holdings Corporation)
• Original Assignee: Matsushita Electric Industrial Company Limited (Panasonic Holdings Corporation)
• Inventors: Tanaka, Katsuyoshi
• Application Number:
  US10/243,875
• Publication Number:
  US 20030074387A1
• Time in Patent Office: Days
• US Class Current: 718/103
• CPC Class Codes: G06F 2209/5021 Priority
• CPC Class Codes: G06F 2209/508 Monitor
• CPC Class Codes: G06F 9/5038 considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration scheduling strategies G06F9/4881 and subgroups

Abstract

A distributed computer system includes a job history saving function (102) for saving execution history data pertaining to a job processed by the system in a referable manner; a queued job completion time computation function (105) of predicting a completion time of a loaded job, from processing capacity and operating condition of the system and the execution history data; and a job execution priority management function (103) for adjusting a rate of decrease of priority of the loaded job in accordance with the predicted completion time of the job when the priority of the loaded job is lowered.

Claims

1. A distributed computer system including a plurality of computers linked together by way of a network, the system comprising:

an execution history saving unit for saving execution history data pertaining to a job processed by the system in a referable manner;

a queued job completion time computation unit for predicting a completion time of a loaded job, from processing capacity and operating condition of the system and the execution history data; and

a job execution priority management unit for adjusting a rate of decrease in priority of the loaded job in accordance with the completion time of the job predicted for a case where the priority of the loaded job is lowered.

2. The distributed processing system as claimed in claim 1, wherein, when the priority of a loaded job is lowered, the queued job completion time computation unit predicts a completion time of jobs under execution and jobs in queue having priorities higher than that of the loaded job.

3. The distributed processing system as claimed in claim 1, further comprising:

an analogous job selecting unit for selecting a job analogous to the job loaded by a user of the system from the execution history data, wherein the queued job completion time computation unit predicts a completion time of the job for a case where the priority of the loaded job is lowered, by reference to execution history data pertaining to the selected analogous job.

4. The distributed processing system as claimed in claim 1, further comprising:

an analogous job specifying unit for specifying a job number of the job analogous to the job loaded by a user of the system from among jobs executed in the past, wherein the queued job completion time computation unit predicts a completion time of the job for a case where the priority of the loaded job is lowered, by reference to execution history data pertaining to the job assigned the specified job number.

5. The distributed processing system as claimed in claim 1, further comprising:

a predicted execution time input unit for inputting a predicted execution time of a job loaded by a user of the system;

wherein, when a job analogous to the loaded job is not found in the jobs executed in the past, the queued job completion time computation unit predicts a completion time of the job for a case where the priority of the loaded job is lowered, by reference to the entered, predicted execution time.

6. The distributed processing system as claimed in claim 1, further comprising:

a first charging unit for increasing or decreasing a computer usage fee per unit time for a loaded job in accordance with a change in the priority of the job when the priority of the job has been changed by the job execution priority management unit.

7. The distributed processing system as claimed in claim 1, further comprising:

a second charging unit for increasing a computer usage fee per unit time for the loaded job when priorities of other jobs are lowered as a result of adjustment having been performed so as to increase the priority of the loaded job with use of the means for adjusting a rate of decrease in the priority of the loaded job and simultaneously lowering computer usage fees for the other jobs whose priorities have been lowered by an amount corresponding to the increase in the computer usage fee.

8. A distributed job processing method which uses a distributed computer system including a plurality of computers linked together by way of a network, the method comprising:

saving execution history data pertaining to a job processed by the system in a referable manner;

predicting a completion time of a loaded job, from processing capacity and operating condition of the system and the execution history data; and

adjusting a rate of decrease in priority of the loaded job in accordance with the completion time of the job predicted for a case where the priority of the loaded job is lowered.

9. The distributed processing method as claimed in claim 8, wherein, when the priority of a loaded job is lowered, a completion time of jobs under execution and jobs in queue having priorities higher than that of the loaded job is predicted in the step of predicting a completion time of a loaded job.

10. The distributed processing method as claimed in claim 8, further comprising:

selecting from the execution history data a job analogous to the job loaded by a user of the system; and

predicting a completion time of a loaded job for a case where the priority of the loaded job is lowered, by reference to execution history data pertaining to the selected analogous job.

11. The distributed processing method as claimed in claim 8, further comprising:

specifying a job number of the job from among jobs executed in the past that is analogous to the job loaded by a user of the system; and

predicting a completion time of a loaded job for a case where the priority of the loaded job is lowered, by reference to execution history data pertaining to the job assigned the specified job number.

12. The distributed processing method as claimed in claim 8, further comprising:

inputting a predicted execution time of a job loaded by a user of the system; and

predicting, with reference to the inputted predicted execution time, a completion time of a loaded job for a case where the priority of the loaded job is lowered, when a job analogous to the loaded job is not found among the jobs executed in the past.

13. The distributed processing method as claimed in claim 8, further comprising:

performing a charging operation by means of increasing or decreasing a computer usage fee per unit time for a loaded job in accordance with a change in the priority of the job when the priority of the job has been changed by the means for adjusting a rate of decrease in the priority of the loaded job.

14. The distributed processing method as claimed in claim 8, further comprising:

performing a charging operation by increasing a computer usage fee per unit time for the loaded job when priorities of other jobs are lowered as a result of adjustment having been performed so as to increase the priority of the loaded job by use of the means for adjusting a rate of decrease in the priority of the loaded job and simultaneously lowering computer usage fees for the other jobs whose priorities have been lowered by an amount corresponding to the increase in the computer usage fee.

15. A program having the distributed job processing method as claimed in claim 8 described therein.

16. A recording medium having recorded thereon the program having the distributed job processing method as claimed in claim 8 described therein.