USPatent applicationPatented

Distributed job integrated management system and method

Granted 20 Aug 2002 · no office action yet

Current assignee: NEC Electronics Corporation · originally AT&T Company

Law firm: Law firm · Log in to unlock

Attorney: Attorney · Log in to unlock

Inventors: Kazuo Yamada · Examiner: Frantz Coby · AU 2171 · TC 2100

Application· this page
9472901
filed 28 Dec 1999
Publication
Not published
not published
Patent
US 6,438,553
granted 20 Aug 2002

Life of the application

6 dated events
⤢ drag to zoom20002002200420062008201020122014201620182020ProsecutionOwnershipTerm & fees
ProsecutionOwnershipTerm & feeshover for detail · click to open

Abstract

A distributed job integrated management system used in a networked computer system comprising a plurality of host computer systems coupled to a common network, and a plurality of heterogeneous distributed job management systems each processes inputted jobs by using the host computer systems. One of the distributed job management systems is used as a master distributed job management system and the rest of the plurality of distributed job management systems are used as slave distributed job management systems. The master distributed job management system determines allocation of resources of the host computer systems to the master distributed job management system and to said slave distributed job management systems, based on the condition of usage of the resources.

Description

8 parts
›FIELD OF THE INVENTION

The present invention relates generally to a distributed job integrated management system which manages a plurality of distributed job management systems and a method thereof. More particularly, the present invention relates to an integrated management system and a method thereof which do not require dividing network resources for different distributed job management systems and in which network resources are efficiently utilized to realize high speed data processing.

›BACKGROUND OF THE INVENTION

FIG. 12 shows a structure of a conventional job processing system in which two different distributed job management systems are operating on a network. Network resources 23 are composed of a plurality of host systems, for example, a host system A and a host system B. Also, network resources 24 are composed of a plurality of host systems, for example, a host system C and a host system D. Each of the host systems comprise two CPU's. There are two different distributed job management systems utilizing these host systems. The network resources 23 having the host system A and the host system B are managed or administered by the distributed job management system 21 . The network resources 24 having the host system C and the host system D are managed or administered by the distributed job management system 22 .

A distributed job management system is a system which allocates a CPU_A 1 to a job “a”, when the job “a” is to be performed, and allocates a CPU_A 2 to a job “b”, when the job “b” is to be performed, thereby having both jobs processed in parallel. That is, the job “a” and the job “b” are processed by using the CPU_A 1 and the CPU_A 2 , respectively. In this case, when processing of the job “b”, for example, is finished earlier, the CPU_A 2 becomes an idle condition. Therefore, it becomes possible to allocate the CPU_A 2 to a new job “c” to perform it. Thereby, the distributed job management system enables a whole processing to be performed quickly.

Concretely, the distributed job management system itself monitors the rate of operation of each CPU of the host systems which the distributed job management system administrates, and grasps the condition of execution of each job. Also, the distributed job management system grasps which job is allocated to which CPU, the condition of processing, the condition of execution of jobs, and the like. That is, the distributed job management system performs administration, monitoring, processing and analysis on the resources. By performing the analysis, it is possible for the distributed job management system itself to intelligently manage or administrate the CPU's of the host systems, i.e., the resources, such that, for example, when any CPU is idle or when processing load of any CPU is light, the distributed job management system makes the processing load of that CPU full.

An example of a distributed job management system is described in Japanese patent laid-open publication No. 2-224169. The Japanese patent laid-open publication No. 2-224169 discloses an invention of a processing distributing system having a plurality of computer systems connected to a network. In the processing distributing system, a task management control portion divides a job injected to the system into tasks. The tasks are transferred to other computer systems to perform processing thereof according to parameters of the divided jobs, and processing result of the tasks processed by the other computer systems are integrated with the processing result of the tasks processed by its own computer system. By distributing the load within the network, resources in the network can be effectively utilized, processing load of each resource can be decreased, and waiting time of each job for processing can be shortened. Thereby, a turn around time (TAT) can be reduced.

However, in any of the above-mentioned conventional technique, the distributed job management systems respectively perform mutually different processing and are independent of each other. Therefore, it is impossible to administrate and monitor all the jobs which are inputted from one distributed job management system, from the other distributed job management system. Also, resources such as hardware and the like are completely separated every distributed job management system. As a result, even when, for example, the CPU_C 2 of the distributed job management system 22 is not so fully utilized but the distributed job management system 21 is fully utilizing the CPU_A 1 , the CPU_A 2 , the CPU_B 1 and the CPU_B 2 and there is always no idle time in these CPUs, the distributed job management system 21 can not utilize the CPU_C 2 , because the CPU's are completely separated every system.

As mentioned above, in case there are a plurality of different distributed job management systems on a network, since the distributed job management systems respectively use different job management method, it is impossible to administrate and monitor all the jobs given by one distributed job management system, from the other distributed job management system. It is necessary to statically separate the network resources every distributed job management system. Therefore, in the conventional technique, there is a disadvantage that jobs introduced or injected from every distributed job management systems can not share all the network resources.

Also, since the jobs injected can not share all the network resources, even when load of jobs injected from one distributed job management system is low, the turnaround time (TAT) of jobs introduced from any other distributed job management system is not shortened.

›SUMMARY OF THE INVENTION · 1 of 2

Therefore, it is an object of the present invention to obviate the disadvantages of a conventional job management system.

It is another object of the present invention to provide a distributed job integrated management system in which it is not necessary to separate network resources every different distributed job management system and, thereby, the network resources can be effectively utilized.

It is still another object of the present invention to provide a distributed job integrated management system in which jobs can be efficiently processed at high speed.

According to an aspect of the present invention, there is provided a distributed job integrated management system used in a networked computer system which comprises a plurality of host computer systems coupled to a common network, and a plurality of heterogeneous distributed job management systems each processes inputted jobs by using the host computer systems, wherein one of the distributed job management systems is used as a master distributed job management system and the rest of the plurality of distributed job management systems are used as slave distributed job management systems, and the master distributed job management system determines allocation of resources of the host computer systems to the master distributed job management system and to the slave distributed job management systems, based on the condition of usage of the resources of the host computer systems.

In this case, it is preferable that inputted jobs are allocated to the slave distributed job management systems or to the master distributed job management system via the master distributed job management system.

It is also preferable that the master distributed job management system has a master job queue for jobs to be processed by the master distributed job management system and a slave job queue for jobs to be processed by the slave distributed job management system, and inputted jobs are queued into the master job queue or into the slave job queue via the master distributed job management system.

It is advantageous that jobs are inputted from each of the plurality of host computer systems.

It is also advantageous that jobs can be inputted from each of the host computer systems with a command designating whether the jobs are to be processed by the slave distributed job management system or by the master distributed job management system.

It is further advantageous that jobs can be inputted from each of the host computer systems with a command designating a quantity of resources required for processing the jobs.

It is preferable that, when there are a plurality of the slave distributed job management systems, the master distributed job management system determine which of the slave distributed job management systems processes the jobs according to the condition of usage of network resources, so that jobs are uniformly distributed among the resources or among the slave distributed job management systems.

It is also preferable that the distributed job integrated management system further comprises: a resource reservation portion which gives information on a number of CPUs in the host computer systems required for jobs of the slave distributed job management system to the master distributed job management system; a resource allocation portion which allocates resources for the jobs of the slave distributed job management system by using a host name list corresponding to the number of CPU's required for jobs of the slave distributed job management system; a slave main command injection portion which inputs a slave main command for processing jobs of the slave distributed job management system into the master distributed job management system; a slave main command monitoring portion which monitors execution of the slave main command; and a resource releasing portion which releases resources used for processing the jobs of the slave distributed job management system.

It is also preferable that the resource reservation portion issues dummy jobs to reserve resources used for processing jobs of the slave distributed job management system based on the number of CPU's required for jobs of the slave distributed job management system.

According to another aspect of the present invention there is provided a method of distributed job integrated management system in a networked computer system comprising a plurality of host computer systems coupled to a common network, and a plurality of heterogeneous distributed job management systems each processes inputted jobs by using the host computer systems. In the method of distributed job integrated management, one of the distributed job management systems is used as a master distributed job management system and the rest of the plurality of distributed job management systems are used as slave distributed job management systems, and the master distributed job management system determines allocation of resources of the host computer systems to the master distributed job management system and to the slave distributed job management systems, based on the condition of usage of the resources of the host computer systems.

It is preferable that inputted jobs are allocated to the slave distributed job management systems or to the master distributed job management system via the master distributed job management system.

It is also preferable that the master distributed job management system has a master job queue for jobs to be processed by the master distributed job management system and a slave job queue for jobs to be processed by the slave distributed job management system, and inputted jobs are queued into the master job queue or into the slave job queue via the master distributed job management system.

In this case, it is possible to input jobs from each of the plurality of host computer systems.

It is also possible to input jobs from each of the host computer systems with a command designating whether the jobs are to be processed by the slave distributed job management system or by the master distributed job management system.

›SUMMARY OF THE INVENTION · 2 of 2

It is further possible to input jobs from each of the host computer systems with a command designating a quantity of resources required for processing the jobs.

It is preferable that, when there are a plurality of the slave distributed job management systems, the master distributed job management system determine which of the slave distributed job management systems processes the jobs according to the condition of usage of network resources, so that jobs are uniformly distributed among the resources or among the slave distributed job management systems.

It is also preferable that the method further comprises: providing information on a number of CPU's in the host computer systems required for jobs of the slave distributed job management system to the master distributed job management system; allocating resources for the jobs of the slave distributed job management system by using a host name list corresponding to the number of CPU's required for jobs of the slave distributed job management system; inputting a slave main command for processing jobs of the slave distributed job management system into the master distributed job management system; monitoring execution of the slave main command; and releasing resources used for processing the jobs of the slave distributed job management system.

It is also preferable that the providing information on a number of CPU's comprises issuing dummy jobs corresponding to the number of CPU's required for jobs of the slave distributed job management system to reserve resources used for processing jobs of the slave distributed job management.

According to still another aspect of the present invention, there is provided a storage medium storing a computer program for configuring a distributed job integrated management system used in a networked computer system which comprises a plurality of host computer systems coupled to a common network, and a plurality of heterogeneous distributed job management systems each processes inputted jobs by using the host computer systems, wherein one of the distributed job management systems is used as a master distributed job management system and the rest of the plurality of distributed job management systems are used as slave distributed job management systems, and the master distributed job management system determines allocation of resources of the host computer systems to the master distributed job management system and to the slave distributed job management systems, based on the condition of usage of the resources of the host computer systems.

›BRIEF DESCRIPTION OF THE DRAWINGS

These and other features, and advantages, of the present invention will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings, in which like reference numerals designate identical or corresponding parts throughout the figures, and in which:

FIG. 1 is a block diagram illustrating a system structure of a distributed job integrated management system as an embodiment of the present invention;

FIG. 2 is a flowchart illustrating detailed operation of the distributed job integrated management system of FIG. 1;

FIG. 3 is a flowchart illustrating detailed operation of the distributed job integrated management system of FIG. 1 performed after the operation of FIG. 2;

FIG. 4 is an illustration showing host load information of an LSF distributed job management system;

FIG. 5 is a block diagram illustrating a portion of hosts managed by the LSF distributed job management system;

FIG. 6 is an illustration showing an example of a command for activating a program;

FIG. 7 is an illustration showing a condition of reservation of resources in the LSF distributed job management system;

FIG. 8 is an illustration showing host names informed from the LSF distributed job management system;

FIG. 9 is an illustration showing information of resource allocation for Quickturn distributed job management system and showing a condition in which processing is allocated to each job;

FIG. 10 is an illustration showing a condition of resource release in the LSF distributed job management system;

FIG. 11 is a flowchart illustrating a flow of processing until the issuance of dummy jobs in the LSF distributed job management system according to another embodiment of the present invention; and

FIG. 12 is a block diagram showing a conventional system in which two different distributed job management systems are operating on a network.

›DESCRIPTION OF A PREFERRED EMBODIMENT · 1 of 3

With reference to the drawings, embodiments of the present invention will now be described in detail.

FIG. 1 illustrates a configuration of a networked computer system including a distributed job integrated management system according to an embodiment of the present invention. FIG. 1 shows a system configuration in which, for example, two different distributed job management systems are operating on a network. One of the distributed job management systems functions as a master distributed job management system 2 and the other distributed job management system functions as a slave distributed job management system 3 . These master and slave distributed job management systems 2 and 3 , respectively, are integrally managed or administrated by a distributed job integrated management system 1 .

In FIG. 1, there are shown network resources 4 . Among these network resources 4 , some of them are temporarily allocated to the master distributed job management system 2 and the others are temporarily allocated to the slave distributed job management system 3 . However, in the present invention, the master distributed job management system 2 can allocate any of the network resources 4 to the jobs for its own, i.e., the master distributed job management system 2 , and to the jobs for the slave distributed job management system 3 , taking the condition of usage of the whole network resources 4 into consideration.

Network resources 4 comprises a plurality of host systems, for example, a host system A, a host system B and a host system C connected to a common network not shown in the drawing. Each of the host systems is, for example, a workstation and the like. These host systems A through C are administrated by the master distributed job management system 2 . In FIG. 1, each of the host systems comprise two CPU's (central processing units), that is, the host system A comprises a CPU_A 1 and a CPU_A 2 the host system B comprises a CPU_B 1 and a CPU_B 2 , and the host system C comprises a CPU_C 1 and a CPU_C 2 .

The distributed job integrated management system 1 comprises a resource reserving portion 5 , a resource allocating portion 6 , a slave main command injecting portion 7 , a slave main command monitoring portion 8 , and a resource releasing portion 9 .

The resource reserving portion 5 has a function of determining from a command for injecting or inputting jobs and the like whether an inputted job or jobs are to be processed by the master distributed job management system 2 or by the slave distributed job management system 3 . When the jobs are to be processed by the slave distributed job management system 3 , the resource reserving portion 5 provides information on the number of CPU's necessary for processing jobs of the slave distributed job management system 3 to the master distributed job management system 2 .

The resource allocating portion 6 allocates resources for the slave distributed job management system 3 from host name lists corresponding to the number of the CPU's. The slave main command injecting portion 7 injects or gives a slave main command to the master distributed job management system 2 . The slave main command monitoring portion 8 is a portion which monitors execution of the slave main command. The resource releasing portion 9 is a portion which releases the resources reserved for the master distributed job management system 2 at a point in time when execution of the slave main command is finished.

Here, operation of the system of FIG. 1 will be described briefly.

First, when a job or jobs are to be processed in the system of FIG. 1, a predetermined command is inputted from any of the host systems. The command includes information on a number of CPU's necessary for the jobs and information on the distributed job management system which should process the jobs, that is, information on whether the master distributed job management system 2 or the slave distributed job management system 3 should process the jobs.

The inputted command is interpreted in the resource reserving portion 5 of the distributed job integrated management system 1 to determine whether the jobs are to be processed by the master distributed job management system 2 or the slave distributed job management system 3 . In the master distributed job management system 2 , there are provided a master job queue for inputting jobs to be processed on the master side, and a slave job queue for inputting jobs to be processed on the slave side, both not shown in the drawing. When it is determined by the resource reserving portion 5 that the inputted command indicates jobs to be processed by the master distributed job management system 2 , the jobs are inputted to the master job queue. The master distributed job management system 2 performs processing of the jobs sequentially outputted from the master job queue, as usual by using available CPU's.

When the inputted command is a slave main command and indicates jobs to be processed by the slave distributed job management system 3 , the jobs are inputted to the slave job queue and processing is performed as follows.

The resource reserving portion 5 provides the number of CPU's necessary for the jobs of the slave distributed job management system 3 to the master distributed job management system 2 , and dummy jobs are issued from the resource reserving portion 5 , thereby reserving the resources, for example, CPU_B 2 , CPU_C 1 , and CPU_C 2 . In FIG. 1, dotted lines illustrate issuance of dummy jobs.

In the resource allocating portion 6 , from a host name list corresponding to the number of CPU's, resource data of the slave distributed job management system 3 is obtained, and the resources (CPU_B 2 , CPU_C 1 , and CPU_C 2 ) are allocated.

The slave main command injecting portion 7 injects the slave main command into the master distributed job management system 2 .

From the slave distributed job management system 3 , children distributed jobs whose parent is the slave main command are issued.

In the slave main command monitoring portion 8 , completion of an execution of the slave main command is monitored. When the execution of the slave main command is finished, the resource releasing portion 9 kills dummy jobs to the master distributed job management system 2 , and releases the reserved resources (CPU_B 2 , CPU_C 1 , and CPU_C 2 ).

›DESCRIPTION OF A PREFERRED EMBODIMENT · 2 of 3

Now, with reference to FIG. 2 and FIG. 3, operation of the system according to the present invention will be explained further in detail based on a more concrete example. FIG. 2 and FIG. 3 are flow charts showing operation of the distributed job integrated management system in further detail. For convenience of description, components of the system in FIG. 2 and FIG. 3 are designated by using reference symbols different from those of FIG. 1 .

In this example, as the master distributed job management system 12 , LSF (Load Sharing Facility) system provided by Platform Computing Corporation, in Canada, is utilized. The LSF can perform administration, monitoring and analysis on loads on a network to which heterogeneous computers are coupled, and supervises a plurality of computers as one system to effectively utilize network resources. By using the LSF, it is possible to use a network having different kinds of computers coupled thereto as one system. Hereafter, the master distributed job management system 12 is called an LSF distributed job management system 12 .

As the slave distributed job management system 13 , a distributed job management system provided by Quickturn Design Systems Corporation, in the U.S.A., is utilized in this embodiment. Hereafter, the slave distributed job management system 13 is called a Quickturn distributed job management system 13 .

FIG. 4 shows information on host load of the LSF distributed job management system 12 . In FIG. 4, an item “status” indicates a status of a host system and, in this item, “ok” shows usable and “unavail” shows unavailable or unusable. An item “r15s” shows a length of CPU execution averaged by 15 seconds index, “r1m” shows a length of CPU execution averaged by 1 minute index, “r1Sm” shows a length of CPU execution averaged by 15 minutes index. Also, an item “ut” shows a CPU utilization rate, an item “pg” shows a memory paging rate, an item “ls” shows number of log in users, an item “it” shows an idle time in minutes, an item “tmp” shows a temporary free capacity of a disk storage, an item “swp” shows a capacity of free swap area, and an item “mem” shows a free memory capacity.

FIG. 5 illustrates a structure of a portion of host systems managed by the LSF distributed job management system 12 . In FIG. 5, it is shown that host 74 , host 72 , host 64 , host 81 , host 71 , host 56 , host 67 and host 57 are coupled by a network.

In operation, first, in any of the host computer systems in the LSF distributed job management system 12 , a program for configuring the distributed job integrated management system according to the present invention is activated together with the indication the number of required CPU's (step S 100 ). The program may be stored, for example, in any storage medium, such as a hard disk and the like of a host computer system, for example, a workstation. FIG. 6 shows an example of a command for activating the program. In this command, the head item “qjob” is a command name of the program for constructing the distributed job integrated management system according to the present invention. The first argument “4” shows the number of CPU's required. The second argument “qtmain. sh” shows a slave main command name provided to the Quickturn distributed job management system 13 . The third argument “parallel. template” shows a parallel template file name for making a parallel host file used in the Quickturn distributed job management system 13 .

Then, in the resource reservation portion 15 , it is determined if dummy jobs for the number of necessary CPU's are issued (step S 110 ). If the dummy jobs are not issued, dummy jobs are issued to the LSF distributed job management system 12 and, reserves the resources for the Quickturn distributed job management system 13 (step S 120 ).

FIG. 7 illustrates a condition of reservation of resources in the LSF distributed job management system 12 . In FIG. 7, an item “STAT” indicates a condition of job execution in which “RUN” shows a condition in which a job is being executed, and “PEND” shows a condition in which a job is pending. An item “FROM_HOST” shows a host computer system into which the command shown in FIG. 6 is injected, and an item “EXEC_HOST_” shows a host computer system which executes processing of jobs.

As mentioned above, in the resource reservation portion 15 , when a dummy job is issued, the LSF distributed job management system 12 issues the dummy jobs (step S 130 ), and informs names of host computer systems into which the dummy jobs are injected (step S 140 ) to the distributed job integrated management system. The resource reservation portion 15 receives the host names of the reserved CPU and add the names to a host name list 30 (step S 150 ).

FIG. 8 illustrates an example of the host names informed from the LSF distributed job management system 12 . In FIG. 8, an example is shown in which host names “host67”, “host71”, “host56” and “host67” are informed, that is, four CPU's and three hosts are informed. In the host 67 , two CPU's are reserved.

After receiving the host names of the reserved CPU's from the LSF distributed job management system and adding the names to the host name list 30 , the resource allocating portion 16 makes a parallel host file 32 for the Quickturn distributed job management system 13 from the host name list 30 and a parallel template file 31 (step S 160 ).

The parallel template file 31 is a template file which is used when resources are allocated in the Quickturn distributed job management system 13 , and is a file for making a parallel host file for allocating actual resources according to the number of CPU's.

Jobs in the Quickturn distributed job management system 13 is distributed according to the parallel host file. The parallel host file must be made in accordance with the number of used CPU's. The parallel template file mentioned above is a file which is previously made independent of the number of CPU's, and is prepared commonly to its jobs.

FIG. 9 shows resource allocation information for the Quickturn distributed job management system 13 , and shows a condition in which processing is allocated to each host. In the parallel host file 32 , the resource information shown in FIG. 9 is included. In FIG. 9, “host71”, “host56” and “host67” are host names added to the host name list 30 . To the host 71 , three processing top_LM_ 1 , top_LM_ 5 , top_LM_ 9 are allocated. To the host 56 , three processing top_LM_ 2 , top_LM_ 6 , top_LM_ 10 are allocated. Since there are two CPU's, six processing top_LM_ 3 , top_LM_ 4 , top_LM_ 7 , top_LM_ 8 , top_LM_ 11 , top_LM_ 12 are allocated to the host 67 .

›DESCRIPTION OF A PREFERRED EMBODIMENT · 3 of 3

Then, in the slave main command injecting portion 17 , a slave main command is injected (step S 170 ), and the slave main command is executed in the Quickturn distributed job management system 13 (step S 180 ).

Thereafter, in the slave main command monitoring portion 18 , an inquiry on the execution of the slave main command is made to the LSF distributed job management system 12 every predetermined time (step S 190 through step S 220 ). After execution of the slave main command is finished, in the resource releasing portion 19 , all the dummy jobs are killed by using the host name list 30 (step S 230 ), and the dummy jobs are finished (step S 240 ).

FIG. 10 shows a condition of resource release in the LSF distributed job management system 12 , and shows a condition before releasing the resources and after releasing the resources.

In this way, according to this example, network resources required for the jobs on the side of the Quickturn distributed job management system 13 are dynamically allocated between the LSF distributed job management system 12 and the Quickturn distributed job management system 13 . During a time when jobs are not executed in the Quickturn distributed job management system 13 , other jobs injected from the LSF distributed job management system 12 can occupy the network resources.

Another embodiment of the present invention will now be described.

FIG. 11 is a flowchart illustrating a flow of processing until the issuance of dummy jobs in the LSF distributed job management system (master) in a distributed job integrated management system according to another embodiment of the present invention.

In this embodiment, a plurality of batch job queues, for example, a batch job queue A and a batch job queue B in FIG. 11, are provided in the LSF distributed job management system (master). When a job or jobs are to be processed in the Quickturn distributed job management system (slave), a command is inputted to the distributed job integrated management system which command includes information specifying the number of CPU's required by the job or jobs processed by the Quickturn distributed job management system (slave) (step S 300 ). Then, a batch job queue is selected depending on the number of CPU's required (step S 310 ), and thereafter dummy jobs are issued (step S 320 ).

For example, a job or jobs whose number of CPU's required is equal to or smaller than 5 are injected into the batch job queue A, and a job or jobs whose number of CPU's required is equal to or larger than 6 are injected into the batch job queue B. It is possible to apportion jobs such that a job or jobs whose data scale, for example, number of gates of an LSI, is small are processed by the batch job queue A, and a job or jobs whose data scale is large are processed by the batch job queue B.

In this way, according to jobs to be processed, it is possible to apportion the jobs into any of different batch job queues, and thereby to decrease average scheduled waiting time of all the jobs.

As mentioned above, according to the present invention, it is not necessary to divide network resources every different distributed job management systems and, therefore, it is possible to effectively utilize the network resources. Also, between the master distributed job management system and the slave distributed job management system, the network resources required for the jobs of the slave side can be dynamically allocated. Therefore, if any of the network resources is available, it is possible to execute jobs of the slave side in a short time.

Also, according to the present invention, it is possible to share the same network resources between the different kinds of or heterogeneous distributed job management systems and to dynamically apportion the network resources between the master distributed job management system and the slave distributed job management system. Therefore, during a time when any job is not executed in the slave distributed job management system, other jobs injected from the master distributed job management system can occupy the network resources. As a result, the network resources are effectively utilized and a high speed processing can be realized.

In the foregoing specification, the invention has been described with reference to specific embodiments. However, one of ordinary skill in the art appreciates that various modifications and changes can be made without departing from the scope of the present invention as set forth in the claims below.

When there are a plurality of slave distributed job management systems, the master distributed job management system can determine which of the slave distributed job management systems will process the jobs according to the condition of usage of network resources, so that jobs or loads are uniformly distributed among the network resources or among the slave distributed job management systems.

Accordingly, the specification and figures are to be regarded in an illustrative sense rather than a restrictive sense, and all such modifications are to be included within the scope of the present invention. Therefore, it is intended that this invention encompasses all of the variations and modifications as fall within the scope of the appended claims.

Claims as granted

19 claims

Log in to read the claims of this application.

Log in to unlock

Classifications

10 codes
IPC · International Patent Classification
Section G — Physics
  • G06F9/46
  • G06F9/50
  • G06F15/177
Section H — Electricity
  • H04L29/06
  • H04L29/08
USPC · US Patent Classification
707/10709/203707/103709/201707/104

Claim changes

Soon
Coming soonHow the claims changed between publication and grant

See which claims were amended, added or cancelled during examination, with every added and removed word marked.

AmendedAddedCancelledUnchanged

The published claims of this application are not paired with the granted ones in what we hold.

File wrapper

⤢ drag to zoomJan 2000Apr 2000Jul 2000Oct 2000Jan 2001Apr 2001Jul 2001Oct 2001Jan 2002Apr 2002Jul 2002Oct 2002USPTOApplicantNotice of allowance
USPTOApplicanthover for detail · click to open
Pendency
2.6 y
966 days filing → grant
Office actions
0
none on record
Examiner
Frantz Coby
art unit 2171 · TC 2100
Citations: 21 back · 62 forward

See the full prosecution history — every USPTO and applicant action on this file, in order.

Log in to unlock

Documents

Log in to open the documents of this file: the application as filed, every office action and response, the notice of allowance.

Log in to unlock

Chain of title

⤢ drag to zoom20002002200420062008201020122014201620182020Owner 1Owner 2
Titlehover for detail · click to open

See the full assignment history — every owner this patent has passed through, with recordation dates and reel/frame numbers.

Log in to unlock