JP5111186B2 - Job processing system and job management method - Google Patents

Description

  The present invention relates to information processing technology, and more particularly to a job processing system that performs batch processing according to user registration and a job management method applied to the system.

  With the recent development of information processing technology and the enhancement of the network environment, various information has been transferred to the network, and it has been input to organizations that manage and manage individual data input to terminals such as companies and internal departments. Technology that strictly manages huge amounts of data and systems is indispensable. Processing for managing data such as data backup and calculation of various numerical values, system maintenance, and the like are routine processing that is generally performed regularly such as daily or monthly. Therefore, it is often performed automatically at night by setting a plurality of jobs specified in advance to be processed in batches.

When batch processing jobs, the processing order of the jobs is determined in advance based on the processing capability, efficiency, dependency between jobs, priority order, and the like. By registering the processing contents of each job, that is, the job flow and the job execution order in the system, the desired processing is basically automatically completed at a desired time. As a result, it is possible to improve the efficiency of various processes while reducing labor costs (for example, Patent Document 1).
JP-A-5-012037

  In a system in which jobs are batch-processed at night outside business hours, there are cases where a job that hinders business start is included if it is not completed by the business start time. In general, it is desirable to complete batch processing efficiently in a short period of time. However, since batch processing only executes jobs in the order and order of processing registered in advance, whether or not the batch processing is being performed "Efficiently" even if the person in charge of the operation monitors it. It is difficult to judge. Even if the developer decides the processing order in the system development environment and considers it “efficient”, if the amount of data handled is different from the expected amount when operating on the actual machine, the efficiency It is also possible that will decrease.

  In particular, when the system is open on the Internet, the number of accesses is likely to fluctuate, so such a change in efficiency is likely to occur. However, it is not easy to frequently review the batch processing environment according to such changes, and it is difficult to realize it in consideration of labor costs and time required for review. Similarly, when adding a new job to a batch processing sequence in an existing system or deleting an existing job, it is difficult to reconfigure the job execution order in consideration of efficiency. It is.

  The present invention has been made in view of such circumstances, and an object thereof is to provide a job processing technique that can assist a user to perform batch processing of jobs in an always optimal execution environment.

  One embodiment of the present invention relates to a job processing system. This job processing system is a job processing system that batch-processes jobs whose processing contents are registered in the registered processing order. The job processing unit executes batch processing while recording the end time of each job, and a reference Time from the processing end time of the job that ended processing at the time of batch processing to the processing end time of the job that ended processing immediately before among jobs registered to be processed before processing The waiting time of each job is obtained as a waiting time of the reference job, and a waiting time determination unit that detects a waiting job whose waiting time exceeds a predetermined threshold and a waiting job are detected. And an output unit for giving a warning to that effect to the user.

  When a long-waiting job is detected, this job processing system determines whether or not there is a dependency between the waiting cause job that causes the job to wait and the processing contents of the long-waiting job. A constraint condition determination unit that is determined based on the contents may be further provided, and the output unit may notify whether or not there is a dependency when performing a warning. Here, “dependency” refers to a relationship in which the processing result of one job affects the processing of another job, that is, the job processed later will not be processed normally unless the job processed earlier is completed. Say relationship. Generally, such a relationship occurs when a file to be processed by a previously processed job refers to or operates a file or resource to be processed later.

  Another aspect of the present invention relates to a job management method. This job management method batch-processes a plurality of jobs in the registered order, records the end time of each job in a memory, and processes one job based on the end time of each job recorded in the memory. When there is no dependency of processing contents between the step of detecting a job that does not start processing for a time longer than a predetermined threshold after waiting for the end, and the job that has been waiting for the processing to end And a step of creating a new processing order in which the setting of the context of those jobs is canceled in the registered processing order, and a step of presenting the created processing order to the user.

  It should be noted that any combination of the above-described constituent elements and a representation of the present invention converted between a method, an apparatus, a system, etc. are also effective as an aspect of the present invention.

  According to the present invention, it is possible to easily realize an optimal execution environment according to the situation in a system that performs batch processing.

  FIG. 1 shows a configuration example of a system to which this embodiment can be applied. In FIG. 1, the job processing system 10 includes four servers: a first server 12, a second server 14, a third server 16, and a fourth server 18. The first server 12 is connected to the database 20. A user operates a terminal of each server, and performs setting and registration to process a desired job at a desired time. The number of servers, databases, and database connection destinations are not limited to those shown in FIG. 1, and the present embodiment can be applied to any configuration as long as the system can process jobs. Further, a client terminal or the like may be connected to each server.

  Each of the first server 12, the second server 14, the third server 16, and the fourth server 18 generally includes one or more CPUs and memories, storage devices, input / output devices, display devices, or any combination thereof. As long as it is a typical information processing apparatus, the scale of a personal computer, general-purpose large computer, etc. is not limited. In the figure, as an example, the first server 12 has a hard disk 13 and the second server 14 has a hard disk 15. The first server 12, the second server 14, the third server 16, and the fourth server 18 are connected to the network 22 and can transmit and receive data to and from each other.

  The user performs job processing by setting the job flow, the processing order at the time of batch processing, the processing start time, etc. for any of the first server 12, the second server 14, the third server 16, and the fourth server 18. Cause the system 10 to process the job. Here, the “job flow” is specific processing content for each job. Each job may be processed by any one of the first server 12, the second server 14, the third server 16, and the fourth server 18, or may be processed by a plurality of servers. In what order the job is processed on which server, whether to process multiple jobs in parallel, such as available resources such as CPU processing capacity and network bandwidth, and the order of access to the database The user makes settings in view of the processing contents. These procedures can use general techniques used in batch processing of jobs.

  Furthermore, in this embodiment, the job processing system 10 itself evaluates the efficiency of job processing based on the results of batch processing in the job processing order set by the user, and warns the user as necessary. Or suggest new processing order candidates. The user can reset the job processing order based on the warning or suggestion.

  FIG. 2 schematically shows an example of the processing order of jobs batch-processed by the job processing system 10. The job processing order is set by the user as described above, and is stored by the job processing system 10 in the form of a job net diagram as shown in FIG. 2, for example. In the figure, each rectangle represents one job, and the processing order is indicated by arrows. In other words, in the example of the job net diagram 90 in FIG. 9, “job A” and “job B” are processed in parallel, and then “job C” and “job D” are processed in this order.

  The user sets the job flow of each job separately from the job net diagram 90. At this time, the job processing system 10 advances the batch processing by calling the job flow of each job with reference to the job net diagram, for example. In the case of FIG. 2, that is, in the batch processing of a job in which the processing order is set as shown in the job net FIG. 90, the processing of “job C” is completed unless both “job A” and “job B” are completed. Not started. For example, when the processing time of “Job B” is longer than the processing time of “Job A”, the processing of “Job B” is started after the processing of “Job A” is completed. You need to wait for the end.

  After that, among the jobs registered to be processed before the reference job is processed, the difference between the processing end time of the job that has been processed last and the end time of the job that has just ended processing is calculated. The “waiting time” of the reference job is set. When “job C” is used as a reference in the example of FIG. 2, the waiting time is the time from the end of “job A” to the end of “job B”. In such an example, when “Job C” has a long waiting time, that is, when it takes a long time from “Job A” to “Job B”, there is room for improvement from the viewpoint of processing efficiency. More cases.

  For example, the case where “job C” is a job that does not need to wait for the end of processing of “job B”. That is, when there is no dependency on the processing contents, such as “job C” using the result output by “job B”, no constraint condition occurs in the processing order of these jobs. In this case, the efficiency of batch processing is improved by changing the processing order setting so that the processing of “job C” is started without waiting for the completion of the processing of “job B”. On the other hand, when the output result of one preceding job in the processing contents of a job is used in some form by one subsequent job, it is necessary to maintain the job context. Hereinafter, in such a case, the preceding job is referred to as the “prerequisite job” of the succeeding job.

  The job processing system 10 according to the present embodiment reviews the processing order of jobs involved in the occurrence of waiting time while considering the preconditions of processing contents. Specifically, a “waiting time” actually generated for each job processed in a batch is acquired, and a job having a waiting time exceeding a predetermined threshold (hereinafter referred to as “long waiting job”) Then, the dependency relationship with the job causing the waiting time, that is, the waiting job (hereinafter referred to as “waiting cause job”) is confirmed, and the room for improvement in the processing order is searched. Then, a warning is given about the occurrence of the waiting time, or the candidate processing order obtained as a result of adjusting the processing order is presented to the user.

  FIG. 3 shows the configuration of the first server 12 in more detail. The second server 14, the third server 16, and the fourth server 18 may have the same configuration. The first server 12 includes a job registration unit 32 that creates data having information necessary for subsequent processing from the job flow and processing order registered by the user, in addition to the hard disk 13 that is appropriately accessed during job processing. Job information storage unit 44 that stores data relating to flow and processing order, job processing unit 34 that processes registered jobs, execution status storage unit 46 that records the actual end time and processing time of a job, and waiting time threshold The waiting time determination unit 36 for detecting the presence / absence of a job exceeding the value, the constraint condition determination unit 38 for checking the constraint condition of the job processing order such as the presence / absence of the premise job of each job, and the job processing order are switched as much as possible. It includes a processing order adjustment unit 40 that performs adjustment, and an output unit 42 that presents a warning about the occurrence of a waiting time to the user and candidates for processing order.

  In FIG. 3, each element described as a functional block for performing various processes can be configured by a CPU, a memory, and other LSIs in terms of hardware, and in terms of software, operations, file operations, databases This is realized by a program that performs access to. Therefore, it is understood by those skilled in the art that these functional blocks can be realized in various forms by hardware only, software only, or a combination thereof, and is not limited to any one.

  The job registration unit 32 is an interface for the user to register information necessary for job processing, such as job flow and job processing order. The job registration unit 32 may be a combination of a display device that displays a registration screen and an input device that performs input on the registration screen, such as a keyboard and a pointing device, and is a device used in a general system that processes jobs. Can be applied. The registered information is stored in the job information storage unit 44 in a predetermined format such as a script code or a job net diagram.

  When the job registration unit 32 receives registration of a job flow, the job registration unit 32 extracts a resource used by each job from the job flow and creates a table of used resource information. The used resource information table is a table in which the name of each job processed in a batch is associated with the resource used by the job, the server, the characteristics of processing contents, and the like. The job registration unit 32 extracts, for each predetermined item, information such as the hard disk to be input / output, the server to be accessed, and the name of the file to be created from the job flow data input by the user, and creates a table of used resource information To do.

  In general, a job net diagram representing the job processing order can be displayed as a drawing, so that it can be easily confirmed by an operator or the like. However, the information obtained therefrom is the context of the set job processing, not the dependency on the processing content such as operating the same file. Since the job processing content may be provided by a program or script code, it is difficult to confirm such dependency without grasping the processing content in detail. Therefore, in the present embodiment, the relationship between the processing contents of jobs is linked from the viewpoint of resources used. A specific example of the table of used resource information will be described later.

  In the present embodiment, the efficiency of the processing order as a whole is evaluated based on the resources used by each job, regardless of which server is processing the job. Therefore, the used resource information includes information on all jobs batch-processed by the job processing system 10 regardless of which server is processing which job, and the first server 12, the second server 14, and the third server. 16 and the fourth server 18 may be shared. In that case, whenever the table of used resource information is updated on a certain server, the updated information is transmitted to another server to update the used resource information table held by each server. Alternatively, the same resource information table is referenced by making the job information storage unit 44 of a certain server accessible from another server.

  The job processing unit 34 reads information such as a job flow and a job net diagram registered by the user from the job information storage unit 44 and executes it. For this, a method used in a general system for processing jobs can be applied. Further, each time a job is processed, the job processing unit 34 records the end time of each job and the processing time from the start to the end in the execution status storage unit 46.

  The waiting time determination unit 36 refers to the end time of each job recorded in the execution status storage unit 46 by the job processing unit 34 and calculates the above-described waiting time for each job. Then, by comparing with a preset threshold value, a job whose waiting time exceeds the threshold value is detected. As the threshold value, a standard value may be obtained by experiments or the like, or the user may be able to set the job registration unit 32. Alternatively, the standard deviation may be calculated from the actual value of the waiting time of a job executed in the system, and a job in which the waiting time has deviated from a predetermined range based on the standard deviation and is generated for a long time may be extracted. . As a result, it is possible to derive a correction plan having a higher improvement effect in consideration of the actual operation status.

  Here, each time a job is batch processed once, the waiting time determination unit 36 may calculate a waiting time from the end time of each job in the one processing and compare it with a threshold value. When batch processing is performed for the number of times, an average value of the waiting time of each job corresponding to the number of times may be calculated and compared with a threshold value. Alternatively, the average waiting time may be calculated for each preset situation according to the system-specific operation mode. For example, in a deposit / withdrawal management system, it is conceivable that the data will increase and the processing time will increase at the accounting closing date or at the end of the fiscal year. In addition, as the number of jobs being processed in parallel increases, the processing time may increase due to exclusive control of access to resources.

  Since the waiting time also changes depending on the processing time of each job, the waiting time may periodically change depending on the operation mode of the system. Therefore, for example, in a system where the average processing time fluctuates periodically in one month, the average value of the waiting time on the same day of each month may be calculated. If the user can accurately grasp the tendency of the waiting time fluctuation such that the waiting time is increased only at the end of the month, it becomes a basis for determining whether or not the processing order should be actually changed. In some cases, it may be possible to find improvements that are more efficient than changing the processing order.

  When there is a job whose waiting time exceeds the threshold value, the processing order adjustment unit 40 detects a portion where the processing order can be adjusted, and creates a new processing order candidate. Specifically, when the waiting cause job is not included in the prerequisite jobs of the long waiting job, the setting of the context of the waiting cause job and the long waiting job is canceled. Further, of the subsequent jobs, the presence / absence of a job having a standby cause job as a prerequisite job is confirmed. If there is such a job, a processing order candidate for processing the job after the standby cause job is created.

  In the example of FIG. 2, the long-waiting job is “Job C”, the waiting cause job is “Job B”, and “Job B” is not the premise job of “Job C” but the premise job of “Job D”. In such a case, processing of “job C” is started after completion of processing of “job A”, and processing order candidates are created so that processing of “job D” is started after completion of processing of “job B”. . In this way, even if “Job B” has an unexpectedly long process, the process of “Job C” can be started without waiting for the end of the process without meaning. And the overall batch processing time is expected to be shortened.

  However, the restriction that the long-waiting job is processed after the waiting cause job is removed, so that the long-waiting job becomes a new waiting cause job and causes a waiting time for the subsequent job. It is not always the case that the waiting time of all jobs is eliminated or the processing time is shortened by performing the above process once. For this reason, the processing order adjustment unit 40 temporarily returns the temporarily created processing order candidates to the waiting time determination unit 36 and causes the waiting time to be evaluated again. When a job whose waiting time exceeds the threshold is detected again, the same adjustment is performed to create a new processing order candidate. This operation is repeated until there are no jobs having a waiting time exceeding the threshold value.

  Further, the processing order adjustment unit 40 evaluates the processing time for the processing order candidates created in this way. At this time, the processing order adjustment unit 40 applies the actual processing time of each job recorded in the execution status storage unit 46 to each job in the created processing order candidate, and predicts the total processing time of batch processing. Is calculated. The processing time of each job used for calculation may be an average value for a certain period, or may be an average value for that period when waiting time is evaluated for each period as described above. Then, the predicted value of the total processing time is compared with the actual value, and it is determined whether or not the processing time is expected to be shortened by reviewing the processing order. When it is determined that it can be shortened, the processing order is determined as a final candidate.

  When the processing order adjustment unit 40 adjusts the job processing order, the constraint condition determination unit 38 determines whether or not the standby cause job is a prerequisite job for a long standby job, and uses the standby cause job as a prerequisite job. Detect subsequent jobs. For the determination, a table of used resource information stored in the job information storage unit 44 is referred to. The constraint condition determination unit 38 further determines whether there is a violation in the processing order candidates created by the processing order adjustment unit 40 based on the constraint conditions related to the processing order of jobs set other than the prerequisite job. As a constraint condition, for example, the maximum number of jobs to be processed in parallel can be cited.

  The processing order adjustment unit 40 appropriately disconnects and connects the job context with a policy of shortening the waiting time. As a result, the processing order adjustment unit 40 processes a number of jobs exceeding the processing capacity of the system at one time. Even so, it will be difficult to achieve this. Therefore, the constraint condition determination unit 38 determines whether the process order is right or wrong so that the process order can be adjusted within the range of the constraint conditions. Restrictions are more detailed such as the maximum number of jobs that access resources such as the same database or hard disk that can be processed in parallel, or whether jobs that use a resource at the same time are executed in parallel, such as updating the same database at the same time. It may be a constraint. Such information can be acquired from the table of used resource information. In addition, the policy may be determined appropriately depending on the user's preference, such as whether the flow is too complicated, as well as what is determined based on whether it is impossible or impossible in terms of ability.

  Predetermined conditions may be stored in the job information storage unit 44, or those input by the user may be stored in the job information storage unit 44 by the job registration unit 32. . The constraint condition determination unit 38 reads the constraint condition from the job information storage unit 44, and when there is a violation in the processing order candidate created by the processing order adjustment unit 40, notifies the processing order adjustment unit 40 of the notification. Do.

  The output unit 42 outputs a final candidate for the processing order created by the processing order adjustment unit 40 and makes a proposal to the user. If the waiting cause job is a prerequisite job for a long-waiting job, or if the job whose waiting time exceeds the threshold is not resolved even if the processing order is adjusted, or the processing time is not improved, select the processing order candidate. The user may be warned without outputting a warning about the existence of a long-waiting job or information indicating that the long-waiting job is a prerequisite job of the waiting-causing job. Alternatively, a provisional processing order candidate created in the middle of adjustment may be presented, and problems such as further adjustment being a violation of constraints may be presented. This can give the user a clue when determining the optimum solution. The output unit 42 may be a general display device or an output device such as a printer, or may further include a communication device such as an electronic mail or a facsimile.

  Next, a table of used resource information generated by the job registration unit 32 will be described. Prior to this, an example of a job flow processed by the job processing system 10 is shown. FIG. 4 shows an example of a job flow registered by the user in the job registration unit 32. The job flow in this example is configured by two-stage processing of a first step 50 and a second step 52. The first step 50 is a process for saving the file stored in the drive D of the hard disk 13 of the first server 12 under the same name in the drive D by the shell 54. In the example shown in the figure, the deposit / withdrawal statement file “aaa.txt” created on the previous day is saved as a file having a file name “aaa.txt. . That is, a backup file of deposit / withdrawal details is created.

  The second step 52 creates a new deposit / withdrawal file by referring to the data stored in the database 20 connected to the first server 12 by a separately created program 56 and stores it in the drive D as the file “aaa.txt”. It is a process to store. By processing the job including the above processing at a predetermined time every day, for example, the backup data of the daily deposit / withdrawal details is stored in the drive D of the hard disk 13 in a form including the date in the file name.

  The shell 54 for saving the deposit / withdrawal details file “aaa.txt” as the backup file “aaa.txt.yyyymmdd” in the first step 50 is created by the user himself and registered in the job information storage unit 44. Alternatively, the job registration unit 32 may automatically create and store in the job information storage unit 44 using an interactive registration unit. The program 56 for creating a new deposit / withdrawal detail file in the second step may store a previously created program file in the job information storage unit 44 or load it by calling from another storage device (not shown). You may make it do.

  The user registers the job flow as shown in FIG. 4 together with the job name in the job registration unit 32 interactively or by creating a script file. The job registration unit 32 stores each job flow in the job information storage unit 44 using the name of the registered job as a file name. Further, a table of used resource information described below is created and stored in the job information storage unit 44.

  FIG. 5 shows an example of the data structure of a table of used resource information created by the job registration unit 32 for the job flow input by the user. In the use resource information table 100, a predetermined unit of processing included in one job is data for one line. In the example of FIG. 5, access to a resource, for example, reading (referring) or writing (updating) a file is described as one unit. The used resource information table 100 includes a job name column 102, a used server column 104, a used resource type column 106, a resource detail column 108, a processing content column 110, a reference destination file column 112, an update destination file column 114, and a prerequisite job column 116. Including. As described above, each time a new job flow is registered, the job registration unit 32 extracts necessary information from the job flow and adds an entry to the use resource information table 100.

  The job name column 102 describes the name of the job registered by the user. The use server column 104 describes the name of the server to which the resource used by each job belongs. In the used resource type column 106, information for identifying the type of resource to be used, for example, a hard disk, a database, a LAN card, and the like is described. The resource detail column 108 describes specific resource identification information. In the processing content column 110, specific processing content performed using the resource described in the resource detail column 108 is described. Here, as described above, since a row is provided for each access to a resource, “reference” and “update” are described. Here, “update” includes a process of creating a new file. When a pair of processes consisting of reference and update is a file copy for the purpose of backup or the like, the processes are described so that they can be distinguished from others. In the example of FIG. 5, the notations “reference (copy)” and “update (copy)” correspond to this. In the processing content column 110, “transfer”, “output” and the like indicating the access content to the resource are described as appropriate.

  The reference destination file column 112 describes the name of the file to be referred to in the file reference process. In the update destination file column 114, the name of a file to be updated or newly created by the file update process is described. The prerequisite job column 116 describes the job name of the prerequisite job for each job.

  The prerequisite job is obtained by extracting a job having the previous processing order from among jobs that update a file with the same name in the same resource as a reference file of each job. Alternatively, it may be set by the user when registering a job net diagram. FIG. 5 shows an example in which the job registration unit 32 describes the premise job in the premise job column 116, but the use resource information table 100 may not include the premise job column 116. In this case, upon receiving a request from the processing order adjustment unit 40, the constraint condition determination unit 38 refers to the reference destination file column 112, the update destination file column 114, and the like of the usage resource information table 100, and the prerequisite job of the target job is described above. You may make it extract suitably by the method of this. Similarly, in the present embodiment, it is only necessary to acquire the information on the premise job from the job flow at any stage, and the use resource information table 100 is not limited to the data structure of FIG.

  The job “job B” in the used resource information table 100 shown in FIG. 5 corresponds to the job shown in FIG. 4. That is, in the first step 50, since the drive D of the hard disk 13 of the first server 12 is accessed and the backup file “aaa.txt.yyyymmdd” of the deposit / withdrawal specification file “aaa.txt” is created, FIG. In the 4th and 5th lines of the used resource information table 100 shown, the used server column 104 is “first server”, the used resource type column 106 is “DISK” indicating a hard disk, and the resource detail column 108 is “drive D”. ”,“ Reference (copy) ”and“ update (copy) ”in the processing content column 110,“ aaa.txt ”in the reference destination file column 112, and“ aaa.txt.yyyymmdd ”in the update destination file column 114. Are listed.

  In addition, since “job B” has created a new file “aaa.txt” with reference to the database 20 connected to the first server 12 in the second step 52, 6 and 7 in the use resource information table 100. In the line, the used server column 104 is “first server”, the used resource type column 106 is “DBMS” indicating access to the database, the hard disk “DISK”, and the resource detail column 108 is “database”. And “drive D”, “reference” and “update” in the processing content column 110, “accounting DB” that is the database name to be referenced in the reference destination file column 112, and “aaa.txt” in the update destination file column 111. It is described.

  Further, it is assumed that “job B” has no prerequisite job, and the prerequisite job column 116 is blank. “Job A”, “Job C”, and “Job D” are similarly described. In particular, “Job C” indicates that the prerequisite job is “Job A”, and “Job D” indicates that the prerequisite job is “Job B”. They are described in the prerequisite job column 116, respectively.

  Next, the operation of the job processing system 10 that can be realized with the above-described configuration will be described. FIG. 6 is a flowchart showing a procedure of processing related to adjustment of the order of job processing performed by the job processing system 10. First, the job processing unit 34 reads a job net diagram and a job flow from the job information storage unit 44, and performs batch processing of jobs according to user settings (S10). At this time, the processing end time and processing time of each job are recorded in the execution status storage unit 46.

  The waiting time determination unit 36 calculates the waiting time or the average value for each job from the end time of each job recorded in the execution status storage unit 46 every time batch processing is performed or at a predetermined cycle. The threshold value is compared (S12). If a job having a waiting time exceeding the threshold is detected (Y in S12), the processing order adjustment unit 40 is provided with information on the detected long waiting job and the waiting cause job causing the waiting time, and the processing order is adjusted. The adjustment unit 40 makes adjustments to create provisional candidates for the processing order (S14). On the other hand, if a job having a waiting time exceeding the threshold is not detected, the processing is terminated as it is (N in S12).

  When the processing order adjustment unit 40 creates a processing order candidate (Y in S12, S14), the waiting time determination unit 36 reads each job read from the execution status storage unit 46 as the created processing order candidate. The processing time or the average value thereof is applied, and a predicted value of the waiting time of each job is calculated and compared with a threshold value (S18). If there is a job whose predicted waiting time exceeds the threshold value (N in S18), the processing order adjustment unit 40 is provided with the information as in the case where an actual long waiting job is detected, and the processing order is adjusted. A new processing order candidate is created by the adjustment by the unit 40 (S14). Thereafter, the calculation of the predicted value of the waiting time, the evaluation by comparison with the threshold value, and the creation of the processing order candidate are repeated until there is no job whose predicted value of the waiting time exceeds the threshold value (N in S16, S18, S14). .

  When there is no job whose predicted waiting time exceeds the threshold (Y in S18), the processing order adjustment unit 40 applies the processing time of each job or its average value to the created processing order candidates, and in that order. A predicted value of the total processing time when batch processing is performed is calculated and compared with the actual value read from the execution status storage unit 46 (S20). When the predicted value of the total processing time is less than the actual value, that is, when the total processing time is expected to be shortened (Y in S20), the processing order is output to the output unit 42 as a final candidate (S22).

  On the other hand, if the predicted value of the total processing time is equal to or greater than the actual value (N in S20), there is a long waiting job whose waiting time exceeds the threshold, and the long waiting job and the waiting cause job A warning is issued by outputting the job information such as the job name and the position on the job net diagram in the output unit 42 (S24). As described above, a provisional processing order candidate created in the middle of adjustment may be output to present a problem that further adjustment is a constraint violation or the processing time is not shortened.

  FIG. 7 is a flowchart illustrating a processing procedure in which the processing order adjustment unit 40 creates a new processing order candidate based on the determination by the constraint condition determination unit 38 in S14 of FIG. First, the processing order adjustment unit 40 makes an inquiry to the constraint condition determination unit 38 to confirm whether or not the standby cause job is a precondition job of a long standby job (S30). If the waiting cause job is a premise job of the long waiting job (N in S30), it is necessary to maintain the context of the waiting cause job and the long waiting job, so that the processing order cannot be further adjusted. As in S24 of FIG. 6, the output unit 42 is warned about the presence of the long-waiting job (S34).

   On the other hand, if the standby cause job is not a precondition job for the long standby job (Y in S30), the setting of the context of the standby cause job and the long standby job is canceled (S32). Specifically, if the job set to be processed before the long-waiting job is other than the waiting cause job, the context with the waiting cause job is simply canceled. If the job set to be processed before the long-waiting job is the only job causing the standby, the long-waiting job is set to be processed next to the job that has been processed immediately before the standby-causing job. At this time, a job that is set to be processed after a long-waiting job temporarily retains its context. Also, the constraint condition determination unit 38 is checked for constraint conditions such as the maximum number of jobs that can be processed in parallel. If a constraint violation occurs, a warning similar to S34 is performed without further adjustment (not shown). ) In accordance with a predetermined rule, a setting is made so that processing is performed next to another job that does not violate the constraint condition.

  Next, the processing order adjustment unit 40 makes an inquiry to the constraint condition determination unit 38 again, so that a job having a waiting cause job as a premise job is selected from jobs set to be processed next to a long waiting job. Extract (S36). If there is such a job (Y in S36), the job is set to be processed next to the waiting cause job (S38). This is to prevent such job processing from starting without waiting for the completion of the waiting cause job, which is a prerequisite job. Thereafter, the process of extracting the jobs having the waiting cause job as a prerequisite job one after another and adding it to the succeeding job of the waiting cause job is repeated (Y in S36, S38), and the processing is performed when such a job disappears. The process ends (N in S36). By such processing, within the range of constraints such as dependency on processing contents and the maximum number of jobs that can be processed in parallel, the relationship between long-waiting jobs and waiting-causing jobs is canceled and the threshold is exceeded. Processing order candidates that can eliminate waiting time can be created.

  FIG. 8 shows a specific example of job processing order candidates generated by the processing described so far. In the drawing, the right direction is the time axis, and the width of the rectangle representing each job represents the processing time. The arrows between the rectangles indicate that the context is set in the processing order. First, in the processing order as shown in FIG. 8A, that is, after “job a” is processed, “job b”, “job c”, and “job d” are processed in parallel. Assume that the processing order in which “job e” is processed after processing is set by the user. Here, when the time t1 from the end time of “job c” to the end time of “job d” is larger than the threshold value, the waiting time determination unit 36 sets “job d” as the waiting cause job and “job e”. Detect as a long waiting job.

  Here, when the restriction condition determination unit 38 determines that “job d” is not a prerequisite job of “job e”, the processing order adjustment unit 40 processes “job e” after “job d”. Cancel the setting (line 120). As a result, “job e” is a job whose processing is started after completion of processing of “job c” whose processing ends immediately before “job d”. In the case of FIG. 7, since there is no job other than “job e” that is set to be processed after “job d” that is a standby cause job, a job to be processed next to “job d” as shown in S38 of FIG. Do not extract. Therefore, (b) in FIG. 8 is a provisional processing order candidate.

  Subsequently, the waiting time determination unit 36 again detects a job having a waiting time exceeding the threshold for the processing order candidate. At this time, the estimated value of the waiting time of each job can be calculated by applying the actual value or the average value of the processing time of each job to the provisional processing order candidate in FIG. In the case of the figure, since “job b” and “job c” are started approximately at the same time, the time t2 of the difference between the processing time of “job b” and the processing time of “job c” is “job e”. It becomes waiting time. When the time t2 is larger than the threshold value, the waiting time determination unit 36 detects “job c” as the job causing the waiting of “job e”.

  As described above, when the restriction condition determination unit 38 determines that “job c” is not a prerequisite job of “job e”, the processing order adjustment unit 40 processes “job e” after “job c”. Release the relationship setting (line 122). As a result, “job e” becomes a job whose processing is started after completion of processing of “job b” whose processing ends immediately before “job c”, and the provisional processing as shown in FIG. The order candidate is determined again.

  Next, the waiting time determination unit 36 calculates the waiting time for the provisional processing order candidate. In this case, the difference between the end time of “job a” and the end time of “job b”, that is, approximately “ The time t3 that is the processing time of “job b” is set as the waiting time of “job e”. When the time t3 is larger than the threshold value, “job b” is detected as a standby cause job of “job e”. If “job b” is not a prerequisite job of “job e”, the processing order adjustment unit 40 cancels the setting of the context of the jobs (line 124). Further, the job to be processed before “job e” is set to “job a” that ends before “job b”, and the context (line 126) of “job a” and “job e” is set. As a result, a new processing order candidate is set.

  If the constraint condition determination unit 38 confirms that such a processing order candidate does not violate the constraint condition and no more jobs whose waiting time exceeds the threshold value are detected, the processing of each job is performed on the processing order candidate. The predicted value of the total processing time is calculated by applying the actual time value. When the predicted value of the total processing time falls below the actual value, this processing order is output from the output unit 42 as the final processing order candidate. On the other hand, for example, when the maximum number of jobs to be processed in parallel is set as “3”, the number of jobs to be processed after “job a” cannot be increased beyond the initial setting. Adds a context of “job a” and “job e” as a constraint condition violation.

  In this case, the processing order adjustment unit 40 may output a warning related to the waiting time to the output unit 42 without making any further adjustments, or a provisional processing order candidate as shown in FIG. It may be output. Alternatively, the range in which the adjustment can be automatically performed may be increased by defining a more detailed adjustment rule according to the actual operation mode, processing content, or the like. For example, after adjusting to the situation shown in FIG. 8C, the maximum number of jobs to be processed in parallel is set to “3”, and the processing of “job e” cannot be set after the processing of “job a”. In this case, it may be further attempted to adjust whether “job e” can be processed before “job a”. In this case, it is confirmed whether or not “job a” is a prerequisite job of “job e”, and if it is not a prerequisite job, it can be determined as a final processing order candidate.

  If at any stage shown in FIG. 8 the waiting cause job is a precondition job for a long waiting job and the context of those jobs cannot be canceled, the waiting time is set as described above. Can be output, and processing order candidates created up to that point can be output.

  According to the embodiment described above, every time a job is processed, the end time of the job is recorded, and the waiting time of each job or an average value thereof is calculated. Then, when there is a job causing a waiting time exceeding the threshold, the context of job processing for that portion is adjusted. As a result, it is possible to easily detect a portion that is difficult to grasp at the operation stage and has a problem in processing efficiency. Previously, it was not easy to adjust the processing order once determined. However, even if the number of accesses changes during operation or a new job is added, the situation changes depending on the situation. Therefore, operation in the optimum processing order becomes possible. Even when the processing order is first determined, such as before the system is installed, even if the initial settings are made without worrying about the processing efficiency, the system autonomously identifies the problem location and adjusts the processing order. The burden can be reduced.

  When adjusting the processing order, check the dependency on the processing details of the job, which is difficult to grasp on the job net diagram etc., from the resource information used, etc. In addition, the constraints on the processing order such as the maximum number of jobs that can be processed in parallel In light of the policies desired by the user and the user, adjustments are made as far as those conditions allow. Therefore, it becomes possible to adjust the processing order safely and quickly, and the system can be maintained and improved without knowing the details of the processing contents. This is particularly effective in a large-scale system that executes a large number of jobs, in which it is difficult to grasp the entire processing contents of each job.

  Further, it is possible to make detailed settings such as periodically calculating the waiting time according to the operation mode. This makes it easier for users to understand trends such as a limited increase in waiting time in a certain period of time, and an inadvertent warning in an unimportant scene, or an increase in waiting time in an important scene. It can be prevented that the average value is adjusted and no warning or adjustment is made.

  The present invention has been described based on the embodiments. This embodiment is an exemplification, and it will be understood by those skilled in the art that various modifications can be made to combinations of the respective constituent elements and processing processes, and such modifications are also within the scope of the present invention. is there.

  For example, in the present embodiment, the processing order adjustment unit 40 adjusts the processing order and performs batch processing with the processing order candidates created by the processing order adjustment unit 40. Calculation and evaluation were performed based on the actual value of the processing time. On the other hand, the processing order adjustment unit 40 may similarly calculate predicted values of the waiting time and the total processing time when the user inputs processing order candidates and batch processing is performed in the processing order. For example, if the processing order adjustment unit 40 has adjusted the processing order, but has not been able to narrow down the final processing order candidates in violation of the constraint condition in the middle, before the user violates the constraint condition, The obtained provisional processing order candidates are presented, and the final determination of the processing order candidates is performed by the user.

  In such a case, the system evaluates how much waiting time is generated in the processing order candidates determined by the user and whether efficiency is improved. In this way, it is possible to evaluate processing order candidates in accordance with the priority order requested by the user from among processing time and various constraints, and more complex adjustments can be made by the user based on the evaluation indicated by the system. It can be carried out. As a result, adjustment that partially reflects the user's will can be performed efficiently.

  Further, in a predetermined case, the waiting time determination unit 36 may perform the waiting time determination from the relationship with a job other than the job that has been processed last, among jobs processed before the reference job. . For example, when a plurality of jobs such as “job b”, “job c”, and “job d” in FIG. 8 are executed in parallel, “job d” at which processing ends last and processing ends before that. Even when there is no difference in the end time of “job c”, if the difference between the end times of “job b” and “job c”, which ends processing immediately before that, exceeds a threshold value, a waiting time occurs. It is determined that In this case, if both “job c” and “job d” are not prerequisite jobs for “job e”, the context of “job c”, “job d”, and “job e” may be resolved together. it can. In this way, when multiple jobs are processed in parallel before the reference job, the waiting time is determined from the relationship with the job other than the job that has finished processing last, and multiple contexts can be resolved. You may make it carry out with respect to this job collectively.

It is a figure which shows the structural example of the system which can apply this Embodiment. It is a figure which shows typically the example of the processing order of the job batch-processed by a job processing system. It is a figure which shows the structure of the server in this Embodiment in detail. It is a figure which shows an example of the job flow registered in this Embodiment. It is a figure which shows the example of a data structure of the utilization resource information which a job registration part produces in this Embodiment. 4 is a flowchart illustrating a processing procedure related to adjustment of the order of job processing performed by the job processing system according to the present embodiment. It is a flowchart which shows the process sequence in which a process order adjustment part produces a new process order candidate based on determination of a constraint condition determination part in S14 of FIG. It is a figure which shows the specific example of the process order candidate of the job produced in this Embodiment.

Explanation of symbols

  DESCRIPTION OF SYMBOLS 1 Job processing system, 12 1st server, 13 Hard disk, 14 2nd server, 20 Database, 32 Job registration part, 34 Job processing part, 36 Wait time determination part, 38 Restriction condition determination part, 40 Processing order adjustment part, 42 Output unit, 44 job information storage unit, 46 execution status storage unit, 100 use resource information table.

Claims (12)

A job processing system that batch processes multiple jobs,
A job registration unit that accepts registration of processing details of each job and registration of job processing order from the user, and stores each in a job information storage unit;
A job processing unit that reads out the processing contents of each job from the job information storage unit and executes batch processing while referring to the processing order of the jobs stored in the job information storage unit, and records the end time of each job; ,
Of the jobs registered to be processed before the start of the reference job processing , the job that has been processed immediately before the processing end time of the job that was last processed during batch processing in the job processing unit The waiting time determination unit that acquires the waiting time of each job as the waiting time of the reference job as the time until the processing end time of, and detects a long waiting job in which the waiting time exceeds a predetermined threshold When,
When the long standby job is detected, an output unit for giving a warning to that effect to the user,
A job processing system comprising: When the long-waiting job is detected, a determination is made based on the registered job processing contents as to whether there is a dependency relationship between the waiting-causing job that causes the job to wait and the processing contents of the long-waiting job. A constraint condition determination unit;
The job processing system according to claim 1, wherein the output unit also notifies the presence / absence of the dependency when performing the warning. The constraint determination unit, when the job registration unit receives the registration processing content of the job, from the processing contents of each job registered, extracts and stores the information relating to the resource and file operations each job to use The information stored in an apparatus and the presence / absence of the dependency relationship is specified with reference to information on resources and file operations used by the long-waiting job and the waiting cause job, respectively. Job processing system. When the constraint condition determination unit determines that there is no dependency between processing contents, processing order candidates adjusted by canceling the setting of the context of the waiting cause job and the long waiting job in the registered processing order Further comprising a processing order adjustment unit to be created,
The job processing system according to claim 2, wherein the output unit presents the processing order candidates to a user. The job processing unit records the processing time of each job when executing batch processing,
The waiting time determination unit occurs in each job when batch processing is performed in accordance with the processing order candidates generated by the processing order adjustment unit based on the actual processing time value of each job recorded by the job processing unit. Calculate the expected waiting time, and further detect long waiting jobs where the predicted waiting time exceeds a predetermined threshold,
The processing order adjustment unit creates a new processing order candidate in which the processing order is further adjusted when a long waiting job whose predicted waiting time exceeds a predetermined threshold is detected. The job processing system according to claim 4. The constraint condition determination unit extracts a job having a dependency relationship between the waiting cause job and the processing content from jobs registered to be processed after completion of the waiting cause job,
The processing order adjustment unit creates the processing order candidate so that a job having a dependency relationship between the waiting cause job and the processing content is processed after the waiting cause job is completed. The job processing system described in 1. The processing order adjustment unit predicts the total processing time when the batch processing is performed according to the processing order candidates based on the actual processing time value of each job recorded by the batch processing unit,
The output unit presents the processing order candidates to the user when the total processing time predicted by the processing order adjustment unit is shorter than the actual value of the total processing time. The job processing system according to any one of the above.   8. The constraint condition determination unit further determines whether or not the processing order candidate created by the processing order adjustment unit violates a constraint condition related to a processing order set by a user. The job processing system according to any one of the above. The actual value of the processing time for each job, the one of the processing time for each job the job processing unit is recorded, according to claim 5 or 7, characterized in that a value obtained by averaging the processing time extracted at a predetermined period The job processing system described in 1. The waiting time determination unit further calculates an average value of the waiting times acquired on the same day of each month, compares the average value with the threshold value, and detects the long waiting job for the day. A job processing system according to any one of claims 1 to 9. In a job processing system that batch processes multiple jobs,
Receiving registration of processing contents of each job from a user and storing it in a storage device;
Accepting registration of job processing order from a user and storing it in the storage device;
Referring to the processing order of the jobs stored in the storage device, reading the processing contents of each job from the storage device, executing batch processing, and recording the end time of each job in a memory;
A step of waiting for the end of processing of one job based on the end time of each job recorded in the memory and detecting a job whose processing is not started for a time longer than a predetermined threshold;
If there is no dependency relationship between the detected job and the job waiting for the end of processing, a new processing order in which the setting of the context of those jobs is canceled in the registered processing order A step to create,
Presenting the created processing order to the user;
Including a job management method. When batch processing a plurality of jobs, recording the processing time of each job in a memory;
Calculating a total processing time predicted when batch processing is performed in the new processing order created based on the processing time of each job recorded in the memory; and
A step of comparing the actual value of the total processing time when batch processing is performed in the registered order and the predicted total processing time;
The job management method according to claim 11 , further comprising:

Images