JPS63228262A - Allocation decision support system - Google Patents

Abstract

PURPOSE:To reduce the burden of a processing and to shorten a time required for a processing by changing between an already assigned and decided job or resource and a line impasse generated job or resource. CONSTITUTION:An assignment change part 9 refers to an assignment result data base 8 at the time of generating the line impasse in the decision of the assignment to obtain the already assigned and decided resource, this resource is changed to the resource to be assigned to the line impasse generated job and the assignment of the resource to the job is changed. Then, when the line impasse is cancelled according this switching, an instruction is applied to a job taking out part 3 to activate the assignment processing of the resource to a next job. Thereby, a processing burden assigned to a computer is remarkably reduced and the processing time can be shortened and an assignment decision processing can be efficiently progressed.

Description

DETAILED DESCRIPTION OF THE INVENTION [Object of the Invention] (Industrial Application Field) The present invention relates to an allocation decision support method that can effectively allocate a plurality of resources to a plurality of jobs.

(Prior Art) Conventionally, it has been common practice to allocate combinations of a plurality of jobs and a plurality of resources under various constraint conditions. For example, when considering staffing for one month at an event venue, schedule information (date, time, content) for one month's worth of events (jobs).

The staff for each of the above events will be assigned based on information on the staff (resources) to be assigned (individual circumstances, holidays, qualifications for the location, restrictions on working hours, etc.). .

Conventionally, such allocation decisions have been made solely by humans, but proceeding with the allocation process unnecessarily only increases the amount of processing; It required experience. Moreover, this process becomes increasingly difficult as the number of jobs and resources increases.

In addition, in the process of proceeding with the allocation decision, for example, because the resources that can be allocated to a certain job have already been allocated to another job, conflicts tend to occur, such as there being no more resources to be allocated to that job, resulting in a deadlock in the allocation decision process. There are many cases. In this case, it becomes necessary to repeat the allocation decision procedure.

As described above, in the past, the assignment of jobs and resources was determined by trial and error, and it was undeniable that a large amount of time was required to determine the assignment.

Therefore, recently, it has been considered to process this type of allocation decision using a computer. However, when using a computer to allocate resources to jobs, the armor
It is undeniable that the above-mentioned problem of deadlock in the allocation procedure similarly occurs depending on which job is allocated resources first. If a deadlock occurs, it becomes necessary to restart the allocation procedure from the beginning. Therefore, even if a computer were used, it was not possible to avoid the above-mentioned problems in determining the allocation decision policy.

Moreover, even for a total of v1 machines, there were problems such as the allocation determination process was burdensome and required a large amount of processing time. Particularly when a deadlock occurs, if an attempt is made to mechanically examine all combinations of multiple jobs and multiple resources, there is a problem in that the load and processing time will increase dramatically.

(Problems to be Solved by the Invention) In the past, even if computers were introduced to allocate resources to multiple jobs, the allocation decision process required a great deal of burden and processing time. In particular, if an impasse occurs during the allocation process,
It is extremely difficult to avoid this, and there is a problem in that it is not possible to efficiently determine allocation.

The present invention has been made in consideration of these circumstances, and its purpose is to effectively deal with and eliminate deadlocks in the process of allocation procedures, and to It is an object of the present invention to provide an allocation decision support system that can reduce the burden on resource allocators@processing and shorten the processing time.

[Configuration of the Invention] (Means for Solving the Problems) The present invention allocates a plurality of jobs and a plurality of resources.
When determining the allocation of the jobs and resources according to the allocation constraint conditions, for example, when a deadlock occurs in the combination of jobs and resources to be allocated while sequentially extracting the jobs or resources in a predetermined order, Alternatively, the system is characterized in that the resource is replaced with a job or resource for which the allocation has already been determined in accordance with a predetermined replacement algorithm to resolve the deadlock and proceed with the allocation determination procedure.

(Operation) According to the present invention, when a deadlock occurs in the process of the allocation determination procedure, the job or resource for which the allocation has already been determined is replaced with the job and resource in which the deadlock has occurred. Since this replacement process has a very high possibility of resolving the above-mentioned deadlock, the above-mentioned deadlock can be resolved by only the above-mentioned replacement process, without examining all combinations of jobs and resources each time. The probability of proceeding with the allocation determination procedure becomes extremely high.

As a result, it becomes possible to significantly reduce the processing load imposed on the total machine and shorten the processing time. In addition, great practical effects can be achieved, such as making it possible to proceed with the allocation determination process efficiently.

(Embodiment) Hereinafter, one embodiment of the present invention will be described with reference to the drawings.

FIG. 1 is a schematic diagram of an information processing system constructed by applying an embodiment of the present invention. A plurality of jobs to be subjected to allocation determination are stored in a job database 1, and a plurality of resources to be allocated to these jobs are stored in a resource database 2.

The plurality of jobs stored in the job database 1 are, for example, as shown in FIG. This is given as a job that requires being on board.

On the other hand, a plurality of pieces of resource information stored in the resource database 2 include, for example, as shown in FIG. Person C: Given as a person who does not hold any license.

The job retrieval section 3 is for selectively retrieving jobs from the job database 1 described above, and the resource retrieval section 4 is for selectively retrieving resources from the resource database 2.

Therefore, the constraint condition check unit 5 determines whether or not a combination of the job extracted by the job extraction unit 3 and the resource extracted by the resource extraction unit 4 is possible. This is to check according to the constraints on the combination with resources.

The allocatable resource storage unit 6 stores, as candidate resources, resources that are determined to be allocatable after the above-mentioned constraint check and correspond to the job being retrieved at that time. The allocation determination unit 7 determines the resource to be allocated to the job from among the candidate resources stored in the allocatable resource storage unit 6.

This allocation result (a set of job and resource) is registered in the allocation result database 8 in order.

After the resource allocation for the job is determined in this manner, the allocation determining unit 7 issues an instruction to the job retrieving unit 3, and the resource allocation process for the next job is activated.

Incidentally, when a resource that can be allocated to a job is not found, that is, when a deadlock occurs in the allocation decision, the allocation change unit 9 refers to the allocation result database 8 and determines whether the allocation has already been decided. This method finds the resource currently being allocated, replaces this resource with the resource that is to be allocated to the stalled job, and changes the resource allocation to the job. And when the above deadlock is resolved by this replacement,
An instruction is given to the job retrieval unit 3 to start resource allocation processing for the next job.

Next, the flow of the processing procedure for determining allocation in the information processing system configured as described above will be explained.

FIG. 4 is a diagram showing the flow of the overall processing procedure.

This processing procedure is performed by first retrieving one job from the job database 1 (step a1).

To retrieve a job from this job database 1,
For example, this is done by sequentially extracting the jobs registered at the top of the job database 1.

Then, resources are sequentially extracted from the resource database 2 for the job extracted from the job database 1 (step a2). This retrieval of resources from the resource database 2 involves, each time one job is given, all the resources that have not yet been allocated among the multiple resources registered in the resource database 2, for example, in the order in which they were registered. This is done by sequential extraction.

The constraint checking section 5 checks the constraint conditions of the combination of the jobs and resources selectively extracted from the respective databases 1 and 2 in this way (step a3). If the combination satisfies the above-mentioned constraint conditions, the resource information is sequentially stored in the allocatable resource storage unit 6 as a candidate resource that can be allocated to the job (step a).
4).

All of the resources remaining in the resource database 2 are checked for such constraints and stored as candidate resources obtained through the checks. At this time, it goes without saying that resources that do not satisfy the above-mentioned constraint conditions are not selected as candidate resources to be stored in the allocatable resource storage section 6.

Thereafter, the allocation determining unit 7 is activated, and resources to be allocated to the job are determined (step a5).
). This allocation decision is made by selecting one of the candidate resources stored in the allocatable resource storage section 6.

The resources allocated based on this selection are
It is registered in the allocation determination database 8 corresponding to the job, and the allocation determination procedure for the next job is started.

Here, if a candidate resource is not requested in the allocatable resource storage unit 6, that is, there is no resource that can be allocated to the job, and an impasse occurs in the allocation procedure, an allocation change process is activated (step a6). ).

This assignment change procedure is performed, for example, as shown in FIG.

That is, first, the job that has stalled is taken out (step bl). After that, the resources whose allocation has already been decided are taken out in order (step b2), and the allocation constraint conditions for the resource for the job are checked (step b2).
3). This process <step b2. b3) is repeatedly executed in order until a resource that can be allocated to the job (the job that has stalled) is found.

If an allocatable resource is found, the resource is released from the job to which it has already been allocated (step 1) 4).

Then, this resource is allocated to the job that has caused the deadlock (step b5).

After that, the job whose assignment has been canceled is retrieved (step b6). Then, take out the remaining resources in order (step b7), and check whether they can be allocated to the above job based on the υl reduction conditions (step b8)
. This process is repeatedly executed for the remaining resources in order, and if a resource that can be allocated to the above job (job that has been deallocated) is found, this resource is decided to be allocated to the above job. (step b9
),.

Through such processing, resources are exchanged between a job for which resource allocation has already been determined and a job for which an impasse has occurred in the allocation determination. Then, the resources replaced as described above are allocated to these jobs, respectively, and the deadlock is resolved.

Note that if an allocatable resource is not required for the deallocated job, the deallocated job is treated as the job that caused the new blockage, and step bo) is followed from step b1 as described above. Repeat the process.

In addition to the algorithm for resource replacement processing shown in Figure 5, multiple replacement processing algorithms are prepared, and these algorithms can be used to resolve the deadlock as shown in Figure 6, for example. Processing may also be performed.

That is, first, algorithm A is used to perform resource replacement processing (step C1), and if the deadlock is not resolved even after this algorithm A replacement processing is performed (step C2), then algorithm B is used to perform resource replacement processing. Resource replacement processing is performed (step c3). If the deadlock is not resolved by the replacement process using algorithm B, the process proceeds to step C4), and then the resource replacement process is performed using algorithm C (step c5).

In this way, there is a high probability that the deadlock will be resolved by one of the plurality of prepared replacement algorithms, and the deadlock can be effectively resolved.

According to this system, which is equipped with a function for processing allocation changes by replacing resources, for example, taking the jobs and resources shown in FIGS. 2 and 3 mentioned above as an example, The allocation decision procedure will proceed.

That is, first, take out the first job j1, and then
, c, all of these resources, b, and c become candidate resources. Then, the first resource a found is allocated to the job j1.

After that, take out the next job j2 and use the remaining resource b
, c, resource b
, c are both candidate resources, so resource b, which is found first, is allocated to job j2 in the same manner as the allocation of resource a to job j1.

After that, when the remaining job j3 is extracted and the constraint conditions between it and the remaining resource C are checked, it is found that resource C cannot be allocated to job j3,
There will be an impasse in the allocation.

In the past, when this deadlock occurred, it was necessary to recheck the combinations of all jobs and all resources, but in this system, the combinations of all jobs and all resources have already been determined, and the job that has caused the deadlock. An attempt is made to swap resources between the two.

That is, the first job j1 is selected, and it is checked whether the resource a allocated thereto can be allocated to the stalled job j3. In this case, since resource a can be allocated, resource a is allocated to job j3, and allocation to job j1 is cancelled.

Then, it is checked whether the remaining resource C can be allocated to the job j1 that has been deallocated, and since it is possible to allocate, the resource C is allocated to the job j1.

In this way, resources are transferred between job j1 and job j3.
The ink and C are replaced, and the above-mentioned deadlock is resolved.

This example is very simple, but in general, as the number of jobs and resources increases, it becomes more difficult to process allocation changes, so simply replacing resources like this can resolve the logjam. This means that the processing load can be significantly reduced.

Note that here, the allocation decision has already been completed and a one-to-one resource swap is performed between job j1 and the stalled job j3, but as described above, multiple types of replacement algorithms can be prepared. It is something.

Specifically, if resource a is allocated to job j1 and resource b is allocated to job j2, and resource C fails to be allocated to job j3, resource b is allocated to job j3, and resource b is allocated to job j3. Resources may be cyclically exchanged between three or more jobs, such as assigning resource a to job j2 to which resource a has been assigned, and resource C to job j1 to which resource a has been assigned.

When replacing resources for another job,
It is also possible to exchange resources between multiple sets of jobs at once, such as exchanging resources for jobs that are related to that job.

Furthermore, it is of course possible to exchange jobs between the same resources based on resources.

As explained above, according to this method, if a deadlock occurs in the process of determining the allocation of jobs and resources,
Resources are exchanged between the job for which allocation has already been determined and the job that has caused a deadlock, and it is very likely that the deadlock can be resolved by this exchange alone. As a result, there is no need to redo the allocation determination process from the beginning or recheck all combinations of jobs and resources as in the past, making it possible to significantly reduce the processing load. Also, since there is a high possibility that the deadlock can be resolved simply by replacing the process,
Great practical effects can be achieved, such as improving the processing efficiency and shortening the time required for processing.

Note that the present invention is not limited to the embodiments described above. Although an example of sequentially allocating resources to jobs has been described here, the present invention can be similarly applied to a case where jobs are sequentially allocated to resources. Furthermore, if a deadlock occurs, it may be ignored and the allocation processing for the next job proceeds, and resource replacement processing may be performed for the jobs in which the deadlock has occurred at once.

In addition, the present invention can be implemented with various modifications without departing from the gist thereof.

[Effects of the Invention] As explained above, according to the present invention, when a deadlock occurs in determining the allocation of jobs and resources, the job or resource for which the allocation has already been determined and the job or resource in which the deadlock has occurred are It is assumed that the exchange process will be performed between

Since this replacement process has a very high possibility of resolving the deadlock mentioned above, it is possible to easily and effectively resolve the deadlock, and it is possible to effectively support the allocation decision procedure. Become.

In addition, great practical effects can be achieved, such as reducing the processing burden and rapidly shortening the processing time.

[Brief explanation of the drawing]

The figures show one embodiment of the present invention. Fig. 1 is a schematic configuration diagram of an information processing system for allocation determination processing configured by applying the method of the embodiment, and Fig. 2 shows an example of a job. figure,
Figure 3 is a diagram showing an example of resources, Figure 4 is a diagram showing the overall processing flow of allocation determination processing, Figure 5 is a diagram showing the flow of the allocation change procedure (resource extraction), and Figure 6 is a diagram showing the flow of the allocation change procedure (resource extraction). FIG. 2 is a diagram showing the flow of processing procedures when a plurality of allocation change algorithms are used. DESCRIPTION OF SYMBOLS 1... Job database, 2... Resource database, 3... Job retrieval section, 4... Resource retrieval section, 5... Allocation constraint condition check section, 6.
... Allocable resource storage unit, 7... Allocation determining unit, 8... Allocation result database, 9... Allocation changing unit. Applicant's Representative Patent Attorney Takehiko Suzue Figure 1 Figure 2 Figure 3 Figure 4 Figure 6

Claims (3)

[Claims] (1) When determining the allocation of multiple jobs and multiple resources according to the allocation constraint conditions for the above jobs and resources, if a deadlock occurs in the combinations of jobs and resources that are sequentially allocated, the job Alternatively, an allocation determination support method is characterized in that a resource is replaced with a job or resource for which allocation has already been determined. (2) The allocation determination support system according to claim 1, wherein the allocation determination between jobs and resources is performed while sequentially extracting the jobs or resources in a predetermined order. (3) The allocation decision support system according to claim 1, wherein a plurality of job or resource replacement algorithms are prepared and used selectively.