JP5255796B2 - Operation management support system, program - Google Patents

Description

  The present invention relates to a computer system operation simulation system.

  In many industries such as securities and finance, computer systems (hereinafter simply referred to as “systems”) are used for various operations including transactions with customers and business partners. A business system generally has many types of business to be handled, a large amount of information processing, and the like, and is often formed as an aggregate of a large number of jobs (the minimum unit of processing; the same applies in this specification). In addition, the size of the system is often large because one job is executed using the execution result of another job, and another job uses the execution result. As it becomes larger, the number of related jobs increases and the execution time increases. In addition, if some jobs are abnormally terminated or the time for supplying data (trading information etc.) that should be supplied from customers or business partners is delayed, the entire system is affected and the entire processing of the system In many cases, a delay occurs. However, this delay must avoid the situation where the system reduces the services provided to customers and business partners, so it is necessary to predict the system execution time, the degree of delay, etc. It is important to stand.

Based on such a problem, conventionally, an operation management support system that performs simulation on the execution status of the system has been proposed (see, for example, Patent Document 1). In this system, the execution paths (hereinafter referred to as “paths”) of a plurality of jobs in the system and the execution times of the individual jobs are acquired, and a plurality of jobs are detected during normal operation and when a delay occurs. The time required from the start of execution to the end of execution is calculated.
JP 2001-222439 A

  However, in the invention described in Patent Document 1, all jobs in which paths are formed are targeted for calculation. When a simulation is performed on a large-scale system (for example, a system in which tens of thousands of jobs are linked to each other), the amount of processing becomes enormous, and the simulation system is required to have a high processing capacity and the cost is increased. This causes a problem that the time required for the simulation becomes long.

  The present invention has been made in view of such problems, and can be formed at a low cost, performs simulation in a short time with a small amount of processing even for a large-scale system, and starts a plurality of jobs. The objective is to provide an operation management support system that can accurately calculate the time required for execution from start to finish.

In order to achieve the above object, the invention according to claim 1 is an operation management support system for simulating an execution time in a computer system having a plurality of jobs, and each job in the computer system to be managed. but the definition information that defines whether the particular job to Noto also capable of forming a critical path, and, linkage information as path information as information indicating the route of the processing of the plurality of jobs, the accumulation and databases, and definition means for setting and changing the definition information, said definition information, the route specifying means for specifying the execution path as information for specifying the path of the processing before Symbol particular job using said linkage information And the execution time as the sum of the execution times of all the specific jobs for which the execution path is specified. Includes an execution required time calculation means, in said definition information, wherein the may form a critical path is the definition of indicating that said specific job specific job and running unexecuted, the computer system comprising a current or execution result information obtaining means for obtaining an actual execution result information in a specific time in the past of each of the jobs in the previous SL route specifying means, input by the user, by the job including the specific job Information on the important job that is formed and set as the job for which the required execution time is calculated, and the start job that is the specific job at the search start point among the plurality of jobs that form the important job based on the information, by following the previous SL execution path along the execution order of the previous SL particular job, identified by the execution path, Identifying a forward search to identify the path of the process of serial specific job, the path before Symbol treatment of the specific job identified by the execution path follows the previous SL execution path in the direction opposite to the execution order of the specific job run a reverse search, in the forward search, the route specifying means, of the specific job from the start job designated as a search starting point by the input of the user, input by the user The processing order of the specific job specified by the execution path to the end point job that is the specific job at the search end point that exists at the end of the execution order among the jobs forming the important job is the execution order. The execution time calculation means calculates the execution time of each specific job traced from the start job to the end job. And confirming the execution time as a sum of the execution times, and the path specifying means specifies the processing path of the specific job having the longest execution time as the critical path , and the reverse direction In the search, in the backward search, in the execution result information acquired by the execution result information acquiring unit from the start point job specified as the search start point by the user input, The processing path of the specific job specified by the execution path is reversed to the execution order of the specific job up to the end-point job as the first execution order of the job being executed or the job being executed. Each of the specific times traced in the direction from the start job to the end job by the execution time calculation means. Confirming the execution time of the job, and calculating the required execution time of the processing path of the specific job based on the execution time, and the path specifying means detects the specific job having the longest execution time. In the case where the processing path is specified as the critical path and the forward search and the backward search are performed, in the forward search, the path specifying unit is configured to input the user's input among the specific jobs. From the start job of the forward search specified as the search start point to the end job of the forward search that exists at the end of the execution order among the jobs that form the important job input by the user The execution time calculation unit that traces the processing path of the specific job specified by the execution path along the execution order. The execution time of each specific job traced from the start job of the forward search to the end job of the forward search is confirmed, and the processing path of the specific job is determined based on the execution time. The execution required time is calculated, and in the backward search, the route specifying means is the specific job whose execution order is the last among the jobs forming the important job input by the user. From the start point job of the backward search to the end point job of the backward search as the first execution order of the unexecuted job or the running job based on the recording of the execution result information The processing path of the specific job specified by the execution path is traced in the reverse direction of the execution order of the specific job, and the required execution time calculation The stage confirms the execution time of each specific job traced from the start job of the backward search to the end job of the backward search, and is in the processing path based on the execution time. The execution required time as a sum of the execution times of the specific job is calculated, and the path specifying means searches the critical path of the backward search for the processing path of the specific job having the longest execution required time. And when the critical path of the forward search and the critical path of the backward search are different, the route specifying means selects the longer execution time as the regular critical path. It is characterized by.

According to a second aspect of the present invention, in addition to the configuration according to the first aspect, the path specifying unit is not executing the specific job or currently being executed at the time of starting the forward search and / or reverse search. characterized in that the said specific job perform particular the execution path and the critical path as the starting job and the end point job.

In the invention according to claim 3 , in addition to the configuration according to claim 1 or 2 , in the definition information of the database, job nets as a plurality of highly related job groups are recorded, and the route specifying means, using the job net to a particular the execution path and the critical path, the required execution time calculation means, when calculating the execution time required, constituting the job net execution time of the job net It is calculated as the sum total of the execution times of the individual jobs.

Invention according to claim 4, in addition to the configuration according to any one of claims 1 to 3, the execution of the search results obtained critical path information and the critical path of the route specifying means Result storage means for storing information on the result of calculation of the required time, and when specifying the critical path from one start job to one end job, the specific job from the start job to the end job When there are a plurality of processing paths specified by the execution path, the path specifying means traces each execution path only once and passes each processing path from the start job to the end job. And information on the calculated execution time is stored in the result storage means, and the calculated information on the required execution time is stored in the result storage means. And the execution time calculation means stores the execution time of the process in the result storage means when calculating the execution time of the processing path from any start job to any end job. When the information on the required execution time of the route is stored, instead of the actual calculation of the required execution time, the stored information on the required execution time is used as the required execution time of the route of the processing. When the path specifying unit specifies the critical path from the start point job to the end point job, information on the critical path from any start point job to any end point job is stored in the result storage unit. Is stored in place of the process for specifying the critical path, the stored critical path information is stored in the start point job. It is characterized by using as the critical path to the end point job.

The invention according to claim 5, in addition to the configuration according to any one of claims 1 to 4, in the prior SL database, the execution result information for each acquisition date and time of the execution result information acquisition unit acquires The execution required time calculating means is recorded, and the execution required time is calculated using the execution result information acquired at a specific date and time by the execution result information acquiring means.

The invention described in claim 6 constitutes an important job for an important job constituted by a plurality of the jobs in addition to the configuration described in any one of claims 1 to 5. each significant job definition information as information including the ID assigned to the job to, and the confirm the job mutual collaboration information constitute an important business, that records the contents of the check in the database characterized by comprising a collection confirmation means such as job definition information.

Invention according to claim 7, in addition to the configuration according to any one of claims 1 to 6, wherein the job definition information such as collection confirmation means constitutes the important operations, the path of the plurality of jobs In this case, an important business association table in which information of combinations of the start point job and the end point job is tabulated is created and recorded in the database.

According to an eighth aspect of the invention, in addition to the configuration according to any one of the first to seventh aspects, execution schedule information for acquiring future execution schedule information of each job in the computer system from the computer system. An acquisition unit is provided, and the execution schedule information acquired by the execution schedule information acquisition unit is recorded for each scheduled execution date and time in the database.

The invention described in claim 9 is a program, which causes a computer to function as the operation management support system described in any one of claims 1 to 8 .

According to the first aspect of the present invention, the route specifying means searches for a path in accordance with the execution order of a plurality of specific jobs and specifies the execution path in a reverse direction to the execution direction of the plurality of specific jobs. By executing at least one of reverse search and path search and specifying execution path, it is possible to use simple search and high-accuracy search according to the purpose, and simulation according to the actual situation Can be realized. Also, the forward search, and in the backward search, linked in the execution path formed between the end point job designated as the search end point from the specified start job as a search start point of the specific job The path of the specific job is traced, the execution time of each specific job forming the path of the specific job is confirmed, and the execution time of the path of the specific job is calculated based on the execution time. When the path of the specific job with the longest time in the total of the required time is specified as a critical path, and the start job and end job can be specified, the time required for execution from the start job to the end job can be quickly Ru can be calculated. Furthermore, by using this forward search and reverse search in combination, the required execution time can be accurately obtained. Further, the execution time calculation means can calculate the execution time with high accuracy with a small amount of processing by calculating the execution time based on the execution time of all the jobs existing on the critical path. This makes it possible to form an operation management support system at low cost, perform simulations in a short time with a small amount of processing, even for large-scale systems, and accurately execute the execution time from the start to the end of multiple jobs. It can be calculated.

According to the first aspect of the present invention, the route specifying unit performs forward search and reverse search, and the critical path specified in the forward search and the searched critical path specified in the reverse search. May be able to calculate more accurate execution time by selecting the longer execution time calculated by the job that exists on each critical path as the regular critical path. A high critical path can be identified. As a result, the required execution time from the start to the end of a plurality of jobs can be calculated with higher accuracy.

According to the second aspect of the present invention, the path specifying unit specifies the execution path and the critical path using either one of the unexecuted job and the currently executing job as the start job and the end job, The time required for execution can be calculated using a job executed after the present, which has great significance for the simulation. Thereby, a more useful simulation can be performed.

According to the third aspect of the present invention, in the definition information of the database, job nets as a plurality of highly related job groups are recorded, and the route specifying means uses the job nets as execution paths and critical paths. The required execution time calculation means is used for forming the job group having high relevance by calculating the execution time of the job net as the sum of the execution times of the individual jobs constituting the job net when calculating the required execution time. Can be realized in a mode close to the configuration mode of the job group. As a result, the usefulness of the simulation is improved and the execution time required from the start to the end of a plurality of jobs can be calculated with higher accuracy.

According to the fourth aspect of the present invention, the path specifying unit includes a result storage unit that stores the critical path acquired as a result of the search by the path specifying unit and the calculation result of the time required to execute the critical path. When the critical path is specified, when the path once searched is included in the search target again, the path searched once is excluded from the search target and the path is searched from the result storage means. The required critical path is acquired, and the execution time calculation means uses the result of calculation of the required execution time of the critical path acquired from the result storage means as the calculation result, so that the path once searched can be obtained many times. By avoiding repeated searches, it is possible to suppress the situation where the computer load during simulation is excessive and to speed up the processing time.

According to the invention described in claim 5 , the execution result information acquisition means for acquiring the actual execution result information of each job in the computer system from the computer system is provided, and the execution result acquired by the execution result information acquisition means is stored in the database. The result information is recorded for each acquisition date and time, and the execution time calculation means calculates the execution time using the execution result information acquired at the specific date and time by the execution result information acquisition means, so that the past actual execution time is calculated. It is possible to perform simulation in a state set based on the above. As a result, the required execution time from the start to the end of a plurality of jobs can be calculated with higher accuracy based on the past performance at a specific date and time.

According to the sixth aspect of the present invention, information such as definition information and linkage information of each job in the computer system is acquired from the computer system and predetermined contents of the acquired definition information and linkage information are confirmed. If there are multiple paths with paths that connect multiple specific jobs, select a path that forms a path related to a predetermined important job, and record the path status after selection in the database as path information. A simulation that reflects the latest computer system status by sequentially acquiring information when job definitions and path corrections are performed in a computer system by providing a collection confirmation function for job definition information, etc. To improve the usefulness of simulation and It is possible to prevent the operational disruption of a computer system to discover the matters which can be a hindrance of the operation of the beam at an early stage.

According to the seventh aspect of the present invention, the defining means defines an important business that is an object of searching for an execution path in calculating the required execution time, and the job definition information collection confirmation means includes the acquired job Select a job that corresponds to an important job, and select the selected job as an end job. Also, in the acquired job, an important job association that tabulates information related to a specific job that reaches the job as the end job by the execution path. By creating a table and recording it in the database, it is possible to reduce the amount of processing at the time of identification and calculation by using information in the important business association table when the path identification means identifies the critical path. Therefore, it is possible to suppress the situation where the computer load during simulation is excessive and to speed up the processing time.

According to the eighth aspect of the present invention, the computer system includes execution schedule information acquisition means for acquiring future execution schedule information of each job in the computer system from the computer system, and the database includes the execution schedule acquired by the execution schedule information acquisition means. By recording the schedule information for each scheduled execution date and time, it becomes possible to grasp the future execution status of the business being simulated. Thereby, the usefulness of the system can be further enhanced.

According to the ninth aspect of the present invention, the present invention can be realized on various computer hardware by programming the present invention.

  Embodiments of the present invention will be described below with reference to the drawings.

  First, the configuration will be described. As shown in FIG. 1, the operation management support system 1A according to the embodiment of the present invention is formed by executing a program installed in the client terminal 1. The client terminal 1 is communicably connected to the manager server 2 of the business server system 2A as a “computer system” to be managed through a network (not shown) such as a LAN.

  The client terminal 1 is a personal computer, and includes at least one CPU. Although not shown, a storage unit that forms a storage area for programs and data, a work area for arithmetic processing of the CPU, such as a RAM, a ROM, and a hard disk, and a communication Is provided with a communication interface unit for performing processing necessary for the above. In addition, the client terminal 1 includes an operation unit 11 such as a mouse and a keyboard, and a display unit 12 including an LCD and the like.

  The operation management support system 1A includes a definition unit 13 as a “definition unit”, a path identification unit 14 as a “path identification unit”, and an “execution required time calculation unit” as functional units as a result of arithmetic processing of a program in the CPU. Execution time calculation unit 15 as an execution result information acquisition unit 16 as an “execution result information acquisition unit”, execution schedule information acquisition unit 17 as an “execution plan information acquisition unit”, “collection confirmation unit for job definition information” A job confirmation information collection confirmation unit 18 is formed. A database 19 is formed in the storage unit (not shown).

  The definition unit 13 sets and changes definition information (described later) recorded in the database 19 based on an operation by the operation unit 11.

  The route specifying unit 14 specifies an execution path (described later) using definition information (described later), linkage information (described later), and the like recorded in the database 19.

  The required execution time calculation unit 15 calculates the required execution time as the sum of the execution times of all the specific jobs (described later) for which the execution paths are specified.

  The execution result information acquisition unit 16 acquires from the business server system 2A actual execution result information on the current or past specific date and time of each job in the business server system 2A.

  The execution schedule information acquisition unit 17 acquires the future execution schedule information of each job in the business server system 2A from the business server system 2A.

  The job definition information collection confirmation unit 18 performs predetermined confirmation on job definition information acquired from the business server system 2A, that is, definition information (described later), linkage information (described later), and the like.

  A plurality of tables are formed in the database 19 and various information acquired by the operation management support system 1A is accumulated. FIG. 2 is an image diagram showing details of the database 19. As shown in the figure, the database 19 includes a definition information table 191, a job linkage information table 192, an important business association table 193, an execution schedule information management table 194, an execution schedule information table 195, an execution result generation management table 196, and an execution result. Tables such as an information table 197 and a search result table 198 are provided. The definition information table 191 includes definition information (for example, job type, critical path (to be described later), and a job net (hereinafter simply referred to as “job net”) as a plurality of highly related job groups. And a specific job that satisfies a predetermined condition (hereinafter simply referred to as “specific job”) such as a condition for becoming a configuration requirement of an execution path (described later) or the like. The job linkage information table 192 stores linkage information indicating execution order relationships, which is information on paths formed between jobs and job nets. The important job association table 193 stores association information between a job net to which an important job belongs and a job net positioned in front of the job net. The execution schedule information management table 194 stores a schedule (execution scheduled date and time) of future execution schedule information for jobs and job nets in the business server system 2A. The execution schedule information table 195 stores execution schedule information for jobs and job nets. The execution result generation management table 196 stores the generation information of the current or past actual execution result information of the job or job net, and the execution result information table 197 stores the execution result information of the job or job net. The search result table 198 stores search result information of execution paths (hereinafter simply referred to as “execution paths”) as execution paths of a plurality of specific jobs.

Next, the operation procedure of this embodiment will be described.
<Execution path search, execution time calculation>
FIG. 3 is a flowchart showing a procedure of execution path search and calculation of required execution time in the operation management support system 1A. The procedure will be described below with reference to FIG.

  The user of the operation management support system 1A operates the operation unit 11 of the client terminal 1 to activate the operation management support system 1A, displays a setting screen on the display unit 12, and sets search conditions (step S1).

FIG. 4 shows an image diagram of the setting screen 121 displayed on the display unit 12. In the setting screen 121 shown in the figure, the user causes the schedule date setting field 1211 to display the date and time for which the execution required time is to be calculated. Further, when it is desired to use the actual execution time of a specific job in the past business server system 2A for calculating the required execution time, a desired date and time is displayed in the generation execution date display field 1212 (execution result information table 197, execution schedule information). It is desirable to set the date and time when data is not stored in the table 195 so that it cannot be displayed. The search start job name display field 1213 displays the name of the job designated by the user as the search start point in calculating the required execution time. The search start point, the forward search (described later), reverse search (described later), forward + backward search starting job as a search starting point (see below) (described later) is displayed.

  In the registered important task display field 1214 of the setting screen 121, the task names set as “important tasks” are listed. This “important business” is a real business in the business server system 2A, which is set by the user as a calculation target of the required execution time, and is composed of a plurality of jobs. Detailed data is an important business association table. 193.

  The “important work” can be set by the user using the important work registration screen. FIG. 5 is an image diagram of the important job registration screen 126 displayed on the display unit 12. As shown in the figure, the important job registration screen 126 has a job name and a name rule (a code notation shown in the registered important job display field 1214 in FIG. 4) of a job set as candidates for important jobs in advance. An enumerated important business list display field 1261 is displayed. When the user selects a desired job from the tasks displayed in the important job list display column 1261 in the important job registration column 1262 and clicks the registration button 1263, the job selected in the important job registration column 1262 is important. Defined as business.

When the user selects an important task whose execution time is to be calculated from the important tasks displayed in the registered important task display field 1214 shown in FIG. 4 and clicks the add button 1216, the selected important task is selected as the selected important task display field. 1215 is displayed. The job name displayed in the search start job name display column 1213 is the forward search, the reverse search, the forward + of the plurality of jobs constituting the important job displayed in the selected important job display column 1215. it is those that have been designated as the search start location point of the backward search.

  In the option selection field 1217 of the setting screen 121, a user who desires a forward search (hereinafter simply referred to as “forward search”) for searching for a path in accordance with the execution order of a specific job and specifying the execution path is selected. The user who desires the forward search selection field to search and the reverse search (hereinafter simply referred to as “reverse search”) that searches the path in the reverse direction of the execution order of the plurality of specific jobs and specifies the execution path is selected. Forward direction + reverse direction search selected by a user who desires a forward direction + reverse direction search (hereinafter simply referred to as “forward direction + reverse direction search”) using a reverse direction search selection field and forward direction search and reverse direction search together. A selection field (shown as “not specified” in FIG. 4) is provided.

  When the user clicks a display button 1218 after making necessary selections and displays, the operation management support system 1A is stored in each table 191 to 198 of the database 19 based on the conditions set on the setting screen 121. Necessary information is acquired from the selected information, and based on the content selected in the option selection field 1217 (step S2), forward search (step S3), backward search (step S4), forward direction + reverse Any one of the direction searches (step S5) is searched. Specifically, the search is performed as follows (a) to (c).

<(A). For forward search>
FIG. 6 is an image diagram of a display image 122 that is displayed on the display unit 12 and schematically shows a job group constituting an important job. In the figure, JOB-A to JOB-M are jobs that constitute an important job, each job between JOB-A to JOB-E, each job between JOB-F to JOB-E, and JOB-J to Each job of JOB-E is linked by a path based on information in the job cooperation information table 192. Each job is assigned a unique ID. This ID is displayed by “display name” as character information (job name) that is easy for the user to visually recognize such as JOB-A, JOB-B,... When displayed on the screen as shown in FIG. In the management support system 1A, it is converted into “processing name” as numerical information of several bits to several bytes, processed and recorded, and the processing is simplified and speeded up (“display name”) And “Process Name” (see FIG. 14).

  Here, the job displayed in the search start job name display field 1213 (FIG. 4) (that is, the start job) is JOB-B1221, and the end job of the important job is JOB-E1222, and the forward search is performed. In this case, the path specifying unit 14 specifies JOB-B → JOB-C → JOB-E as an execution path (the reason why JOB-D is excluded will be described later), and specifies this execution path as a critical path.

  Here, the “critical path” is a path having the latest execution time (the same applies in this specification). If there is only one execution path such as JOB-B → JOB-C → JOB-E in FIG. 6, the path inevitably becomes a critical path. However, from JOB-B shown in FIG. If there are two or more execution path routes to JOB-E, the longest execution time (that is, the maximum total execution time of specific jobs on the execution path) is critical. It becomes a pass.

In this embodiment, the definition information table 191 defines that a critical path and an execution path can be formed by at least one of an unexecuted specific job and a specific job currently in progress. Based on the definition in the definition information table 191, the path specifying unit 14 executes either the unexecuted specific job or the currently executing specific job as the start job and the end job as the search end point. And the critical path is specified.

  That is, the path specifying unit 14 specifies an execution path and a critical path using either one of an unexecuted job or a currently executing job as a start job and an end job, which is meaningful in performing a simulation. The required execution time can be calculated using a large job that is executed after the present time.

  In this embodiment, the definition of the definition information table 191 is used to monitor a job net and a specific job (for example, arrival of a file transmitted from a customer) (hereinafter simply referred to as “monitoring job”). .) Also forms a critical path and an execution path. The calculation of the execution time for job nets and monitoring jobs will be described later.

  On the other hand, in this embodiment, according to the definition in the definition information table 191, a job that has been normally completed (for example, JOB-A 1223), an unplanned job (for example, JOB-I 1224), or an unexecuted job is excluded from the specific job. For a job (for example, JOB-D1225) in which the effect is defined, the execution time of the job itself (even if it is in the middle of the critical path and execution path) is not subject to addition of the execution time even when calculating the required execution time described later. Excluded.

<(B). For backward search>
When the job (that is, the start job) displayed in the search start job name display field 1213 (FIG. 4) is JOB-E1222 shown in FIG. 6 and the reverse search is performed, the path specifying unit 14 specifies the specified start job JOB. -A critical path is specified from all execution paths starting from E1222. Specifically, the execution path includes the path of JOB-E → JOB-C → JOB-B, the path of JOB-E → JOB-H → JOB-G, and the path of JOB-E → JOB-M → JOB-L. Further, the execution time of each specific job on the specified execution path is determined from the end point job to the start point job direction (that is, the direction of JOB-B → JOB-C → JOB-E, JOB-G → JOB-H → JOB). -E direction, JOB-L.fwdarw.JOB-M.fwdarw.JOB-E), among these execution paths, the slowest path (that is, the sum of execution times of specific jobs on the execution path is maximized). Is identified as a critical path. The reason for adding the execution time of each specific job in the direction from the end point job to the start point job is to easily and appropriately calculate the required time of the monitoring job described later.

<(C). For forward + reverse search>
If the search start job name display column 1213 displays jobs in (FIG. 4) (i.e. starting point job) a job- B 122 1 shown in FIG. 6 performs forward + backward search, the route specifying section 14 The procedure (a) is performed, and then the procedure (b) is performed.

In the procedure (c), the route specified as the critical path in the procedure (a) is excluded from the search target when the procedure (b) is performed to prevent duplicate processing. However, a job (for example, JOB-A 1223 positioned immediately before JOB-B 1221 in FIG. 6) that is before the start job JOB-B 1221 of the procedure (a) and is connected to the start job JOB-B 1221 is defined as a specific job. In such a case, the route of JOB-B1221 to JOBA1223, which is a critical path of the forward route, is not searched, but the route of JOB-E1222 to JOBA1223 is searched. When the critical path specified in the procedure (a) is different from the critical path specified in the procedure (b), the route specifying unit 14 specifies the longer execution time as the regular critical path. (If both run times are the same, both are legitimate critical paths.)

  In the procedure of (c), by selecting the longer execution time calculated by the job existing on the critical path specified by each of the forward search and the reverse search as the regular critical path, the accuracy is improved. It is possible to identify a critical path that has a high possibility of calculating a high execution time.

<Rules for route specification>
When specifying the critical path in the above (a) to (c), the route specifying unit 14 specifies based on the following rules (Rule A) and (Rule B).
(Rule A) The route specifying unit 14 always searches (pass scan) all execution paths once. Further, the route specifying unit 14 stores the result of calculating the critical path and the required time for executing the critical path obtained as a result of the search once, in the result storage unit 141 as “result storage unit”. The result storage unit 141 is formed of a RAM or the like, and has a function of storing various data formed during the processing period.
(Rule B) The route specifying unit 14 excludes the execution path once searched from the search target when the search path once searched is included in the search target again. In addition, when the path specifying unit 14 searches the execution path once searched, the path specifying unit 14 acquires information on the critical path specified when searching the execution path from the result storage unit 141. Information obtained from the result storage unit 141 is used for calculation of the required execution time by the execution result calculation unit described later.

FIGS. 7A and 7B are diagrams schematically showing the above (Rule B).
FIG. 7A schematically shows a case where a search is performed in a plurality of jobs. As shown in the figure, in JOB-AA to JOB-AE, each of which is a specific job, the route of JOB-AC to JOB-AE is
(Route 1) JOB-AC → JOB-AD → JOB-AE
(Route 2) JOB-AC → JOB-AF → JOB-AG → JOB-AE
2 routes (required execution time of route 1)> (required execution time of route 2)
If
(Procedure 1): The path from the start point job 1 (JOB-AA) to the end point job (JOB-AE) through (path 1) and the required execution time are obtained.
(Procedure 2): The path from the start point job 1 (JOB-AA) to the end point job (JOB-AE) via (path 2) and the required execution time are obtained.
Consider a case where a critical path is obtained by performing the following two procedures. At this time, the path specifying unit 14 searches for JOB-AA → JOB-AB → JOB-AC → JOB-AD → JOB-AE in (Procedure 1), and the result storage unit 141 stores the path and the execution time of each job. Remember me. Next, when the route specifying unit 14 performs (Procedure 2),
(Procedure 2-1): Information stored in the result storage unit 141 is used for JOB-AA → JOB-AB → JOB-AC that has already been searched in (Procedure 1).
(Procedure 2-2): The actual search is performed only for JOB-AC → JOB-AF → JOB-AG → JOB-AE in (Route 2).
(Procedure 2-3): The result of (Procedure 2-1) and the result of (Procedure 2-2) are stored in the result storage unit 141 as the route and the time required for execution.
3 steps are performed. That is, in (Procedure 2), the process proceeds without repeating the process performed in (Procedure 1). The route specifying unit 14 obtains a critical path by comparing the result of (Procedure 1) and the result of (Procedure 2).

FIG. 7B schematically shows a case where a search is performed in a plurality of job nets. As shown in the figure, each of the three job nets N1, N2, and N3 has 10 paths inside a specific job (for example, in the case of job net N1, JOB-BA → JOB-BB ₁ → JOB-BC, JOB-BA). → JOB-BB ₂ → JOB-BC,..., JOB-BA → JOB-BB ₁₀ → 10 paths of JOB-BC (the time required to execute each path is different). N2 and job net N3 are also the same). At this time, when obtaining the critical path from the job nets N1 to N3,
(Procedure 11) A critical path inside the job net N1 is obtained.
(Procedure 12) The critical paths of the job nets N1 to N2 are obtained, and further the critical path inside the job net N2 is obtained.
(Procedure 13) The critical paths of the job nets N2 to N3 are obtained, and the critical path inside the job net N3 is further obtained.
The procedure will be taken. At this time, the route specifying unit 14 searches all 10 routes in the job net N1 in (procedure 11), obtains one critical path from the 10 routes, and stores the result in the result storage unit 141. Next, when performing (Procedure 12), the route specifying unit 14 acquires and uses the search result of (Procedure 11) stored in the result storage unit 141 for the critical path of the job net N1, and also within the job net N2. All the 10 routes are searched, one critical path is obtained from the 10 routes, and the result is stored in the result storage unit 141. Furthermore, when performing (Procedure 13), the route specifying unit 14 acquires and uses the search results of (Procedure 11) and (Procedure 12) in which the critical paths of the job nets N1 and N2 are stored in the result storage unit 141. All 10 routes in the job net N3 are searched, one critical path is obtained from the 10 routes, and the result is stored in the result storage unit 141.

  As a result, in FIG. 7B, the critical path is searched by 10 searches (of procedure 11) +10 searches of (procedure 12) +10 searches of (procedure 13) = 30 searches. can do. In other words, the amount of processing is much smaller than when the critical path is determined as a brute force (10 routes × 10 routes × 10 routes = 1000 ways).

  Then, as shown in FIGS. 7A and 7B, in this embodiment, a situation in which a path that has been searched once is repeatedly searched is avoided, and the computer load during simulation becomes excessive. The situation can be suppressed and the processing time can be increased.

  When a critical path is specified based on the rule of (d) in any of the procedures (a) to (c), the execution time calculation unit 15 executes all jobs existing on the critical path. The required execution time is calculated based on the time (step S6). Further, the required execution time is added to the current time, and an expected end time is calculated as an expected time at which the end-point job ends (step S6).

The execution time is calculated based on the following (reference A) to (reference E).
(Criteria A) All the execution times of each specific job existing on the critical path are added to obtain the critical path execution time. For example, in FIG. 6, when JOB-B1221 → JOB-C1226 → JOB-E1222 is a critical path, the total execution time of each of JOB-B1221, JOB-C1226, and JOB-E1222 is set as the required time for executing the critical path. The execution time of JOB-D 1225 between JOB-C 1225 and JOB-E 1222 but not forming a critical path is not used to calculate the required execution time.

  (Criteria B) When there is a specific job currently being executed on the critical path, the execution time of the specific job is calculated by subtracting the execution time up to the current time from the execution time at the time of non-execution. For example, when a specific job having an execution time of 60 minutes when not executed has passed 30 minutes from the start of execution, the execution time of the specific job is set to 30 minutes at (60-30 = 30).

  (Criteria C) When a job net exists on the critical path and a specific job is formed, the sum of all jobs constituting this job net is set as the execution time of this job net. For example, when a job net having a job with an execution time of 10 minutes and a job with an execution time of 20 minutes forms a critical path, the execution time of this job net is (10 + 20 = 30) and is 30 minutes.

  That is, when calculating the required execution time, the required execution time calculation unit 15 calculates the execution time of the job net as the sum of the execution times of the individual jobs that make up the job net, so that highly relevant job groups can be obtained. It is possible to realize a simulation used in a mode close to the configuration mode of the job group.

  (Reference D) When a monitoring job exists on the critical path and a specific job is formed, a value obtained by subtracting the estimated start time from the scheduled end time of the monitoring job is set as the execution time of the monitoring job. FIG. 8 is an image diagram of a display image 123 that is displayed on the display unit 12 and schematically shows a job group constituting an important job. As shown in the figure, the execution time of JOB-A1231 and JOB-B1232 which are normal jobs is 10 minutes each, and the end of FILE-X1233 which is a monitoring job (monitors the transmission status of a file from a customer) When the scheduled time (scheduled time when the file is transmitted) is 4:00 and the calculated time (the time when the search is started; the same applies in this specification) is 3:00, the monitoring job FILE-X1233 The execution time is 40 minutes, which is a value obtained by subtracting the estimated start time (3: 00 + 10 + 10 = 3: 20) from the scheduled end time (4:00).

  (Criteria E) When there is a timer job that executes a job at a predetermined time on the critical path and a specific job is formed, a value obtained by subtracting the estimated start time from the scheduled start time of this timer job is Job execution time. FIG. 9 shows an image diagram of the display image 123 a displayed on the display unit 12. In this figure, JOB-Y1234 as a timer job exists instead of FILE-X1233 as a monitoring job shown in FIG. 8, and the scheduled start time of this timer job JOB-Y1234 (set to start job execution) Time) is 4:00, and the calculation time is 3:00. In this case, the execution time of the timer job JOB-Y1234 is 50 minutes, which is obtained by subtracting the estimated start time (3: 00 + 10 + 10 = 3: 20) from the estimated start time (4:00) and the unit required time (10 minutes). It becomes.

<Add jobs / Change the time required for each job>
Here, when calculating the required execution time in step S6, the execution time of each specific job is the measured value of the past actual execution time of each specific job (the “job definition information collection confirmation unit” described later). Is acquired from the business server system 2A), but the actual measured value of the execution time is changed to the time set by the user, or the user newly sets the job and the time required for the job. You can also

  FIG. 10 is an image diagram of a required time change screen 127 displayed on the display unit 12 for the user to add / change the required time. As shown in the figure, the required time change screen 127 displays detailed information of individual jobs that can form a specific job in the change information list display field 1271 (each row shows detailed information of one job). The user selects (or) a desired job from the jobs displayed in the change information list display field 1271 in the required time addition / change field 1272, and the preset start time and file arrival time of the selected job. The required time is input to change to a desired time and time in the start time change field 1273, the file arrival time change field 1274, and the required time change field 1275, and when the add / change button 1276 is clicked, the required time etc. are added and changed. Information added / changed in the field 1272 is registered, and thereafter, the required execution time is calculated based on the added / changed job and the required time of the job.

<Display execution time and scheduled end time>
The required execution time calculation unit 15 displays the calculated required execution time and the scheduled end time on the display unit 12 (step S7).

  FIG. 11 is an image diagram of the search result display screen 124 displayed on the display unit 12 for displaying the required execution time and the scheduled end time. This figure shows the results of execution under the conditions shown in FIG. 4 (however, in the option selection field 1217, the forward direction + reverse direction search selection field is selected instead of the forward direction search shown in FIG. 4). Has been. In FIG. 11, each of the lines 1241, 1242, 1243,... Indicates one “important task” (including “JPRS” indicated by the “selected important task display column 1215” in FIG. As a result of selecting “business” as a search target, a plurality of results are displayed.) In the figure, for example, the result of the first row 1241 is “2 hours displayed in the required time display column 1244 for the execution required time. 30 minutes ”, and the scheduled end time is“ 17:30 (calculated by the critical path of the forward search) ”displayed in the latest time display column 1245. The result of the third row 1243 is that the execution required time is “1 hour 0 minutes” displayed in the required time display column 1244 and the scheduled end time is displayed in the latest time display column 1245 (reverse search 16:00 (calculated by the critical path) ”.

  When a specific line is designated in the state shown in FIG. 11 and the file output button 1246 is clicked, a diagram showing the critical path as an image is displayed on the display unit 12, and the user can visually grasp the job mode.

<Recording results>
The required execution time calculation unit 15 stores the calculated required execution time and the estimated end time in the execution result information table 197 and the execution result generation management table 196 of the database 19 (step S8).

  That is, an execution result information acquisition unit 16 that acquires actual execution result information of each job in the business server system 2A from the business server system 2A is provided, and the execution result information acquisition unit 16 in the execution result information table 197 of the database 19 includes. Is obtained for each acquisition date and time, and the required execution time calculation unit 15 calculates the required execution time using the execution result information acquired at the specific date and time by the execution result information acquisition unit 16. It becomes possible to perform a simulation in a state set based on past actual execution times.

<Collecting and checking job definition information>
For example, in the business server system 2A, an “important business” is added or an existing “important business” is corrected (displayed on the display unit of the client terminal 1 by the operation management support system 1A) on the important business registration screen 126 of FIG. The user of the operation management support system 1A is in the “important business” to which the addition / modification is applied, and job definition information, that is, addition / modification is performed. It is possible to collect and confirm definition information and linkage information of “important work” that has been applied.

  FIG. 12 is a flowchart showing a procedure for collecting and checking job definition information and the like in the operation management support system 1A. The procedure will be described below with reference to FIG.

  First, the user of the operation management support system 1A displays a definition screen (not shown) on the display unit 12, and acquires definition information / cooperation information of “important work” that has been added or modified (step S11). ). The job definition information collection confirmation unit 18 confirms predetermined contents of the acquired information. As the predetermined contents, “detection of duplicate jobs”, “detection of loops”, and “deletion of unnecessary related lines” are defined.

  <Duplicate job detection>

  When the same ID is assigned to a plurality of jobs in the acquired definition information, that is, when the existence of a duplicate job is detected (“Yes” in step S12), the job confirmation information collection confirmation unit 18 performs confirmation work. And the character information and image information for notifying the existence of the duplicate job are displayed on the display unit 12 (step S17). As a result, it is possible to prevent an operational failure of the business server system 2A, and to improve the safety of the business server system.

<Detection of loops between jobs>
Existence of duplicate jobs is not detected ("No" in step S12), and in the obtained linkage information, as shown in the image of FIG. If this is the case ("Yes" in step S13), the job definition information collection confirmation unit 18 stops the confirmation operation and causes the display unit 12 to display character information and image information for notifying the presence of a loop (step S17). As a result, it is possible to prevent an operational failure of the business server system 2A, and to improve the safety of the business server system.

<Deleting "Unnecessary related lines">
On the other hand, if no loop is found in the path connecting the jobs (“No” in step S13), the job definition information collection confirmation unit 18 searches for “unnecessary related lines” and is unnecessary. If a path forming a related line is found, the path is deleted (step S13). Note that “deletion” in this case means that a path other than a path related to a predetermined “important business” is excluded from the processing target, and a path other than the “excluded” path is a selected path. Are treated as Although the “deleted” path is removed from the RAM or the like, it is desirable to store it in an external storage area such as a hard disk so that it can be applied to other processes.

  FIG. 13B1 shows an image diagram in a state where there is a path that forms an “unnecessary related line”. In the same figure, the path of job J4 → job J5 → job J6 and the path of job J4 → job J6 coexist, but if job J5 is a specific “important job”, job J4 → job that does not pass through job J5 The path P1 of J6 is an “unnecessary related line”, and the job definition information collection confirmation unit 18 deletes the path P1 to form a state as shown in FIG. 13B2. The path of job J4 → job J5 → job J6 shown in (b2) of FIG.

  That is, information such as definition information and linkage information of each job in the business server system 2A is acquired from the business server system 2A, and predetermined contents of the acquired definition information and linkage information are confirmed, and a plurality of specific information When there are a plurality of paths based on paths connecting the jobs, a path that forms a path related to a predetermined important job is selected, and the state of the path after selection is recorded in the database 19 as path information, so that the time required for execution It is possible to prevent a search from being performed on a path having a relatively low importance in the calculation, and to suppress an increase in computer load in the simulation of the operation management support system 1A.

<Detection of loops between job nets>
Also, as shown in the image of FIG. 13C, when a loop is found in a path connecting job nets (“Yes” in step S15), the job definition information collection confirmation unit 18 Cancels the confirmation operation and causes the display unit 12 to display character information and image information for notifying the presence of the loop (step S17).

  If no loop is found between the job nets (“No” in step S15), the definition information is stored in the definition information table 191 of the database 19, the link information is stored in the job link information table 192, the job net association information, etc. Each is stored in the important business association table 193 (step S16).

  <Create important business association table>

  14A shows an image diagram of the important business association table 193 formed in the database 19 in step S16, and FIG. 14B shows an image diagram of the name association table 193a formed in the database 19. Each table 193, 193a in the figure is formed based on the job displayed in the display image 122 in FIG. 6 and the path between jobs. In the name association table 193 a, “1” used for processing and recording “display names” such as “JOB-A” and “JOB-B” displayed on the display image 122 in the operation management support system 1 A. ”“ 2 ”and the like are associated with“ processing name ”as numerical information (each line indicates a correspondence between names), and in the important business association table 193, a start job (can be formed) Correspondences between specific jobs) and end-point jobs (specific jobs that can be formed) are recorded by “processing names” (each row indicates a correspondence between names). The information in the important business association table 193 is used in place of performing an actual search (scanning of path information) when the route specifying unit 14 performs a forward search (however, the important business association table in the reverse search is used). 193 information may be used.)

Specifically, for example, when performing the search in steps S3 and S5, the route specifying unit 14 first searches for information in the important business association table 193, and if the desired information does not exist in the important business association table 193, it is actual. It is conceivable that the search of the important business association table 193 and the actual search (scanning of the path information) are properly used by processing such as searching (scanning of the path information).

  This makes it possible to reduce the amount of processing at the time of the identification or the calculation by using the information of the important business association table when the path identification unit 14 identifies the critical path, and the computer load at the time of simulation is reduced. Suppressing an excessive situation and speeding up the processing time.

As described above, the job definition information collection confirmation unit 18 performs the processing from step S11 to S17, so that when the job server system 2A performs job definition, path correction, etc., information is sequentially acquired. A simulation that reflects the state of the latest business server system 2A can be realized, and the usefulness of the simulation can be improved, and items that may hinder the operation of the business server system 2A are discovered at an early stage. Operational troubles can be prevented.

  If a change occurs in the execution status of the “important business” in the business server system 2A in accordance with the procedures in steps S11 to S16 (“Yes” in step S18), a job can be obtained by operating the operation unit 11 of the user. The definition information collection confirmation unit 18 updates the execution schedule information (step S19), and stores the updated execution schedule information in the execution schedule information management table 194 and the execution schedule information table 195 of the database 19 (step S20). If there is no change in the execution status of “important business” (“No” in step S18), the processing in steps S19 and S20 is not performed.

<Obtain execution schedule information>
When the user of the operation management support system 1A wants to know the future execution schedule of the “important business” in the business server system 2A, the user can acquire the future execution schedule information of the “important business”.

  Specifically, by the operation of the operation unit 11 performed by the user, the execution schedule information acquisition unit 17 acquires, from the business server system 2A, the future execution schedule information of the job forming the “important business” in the business server system 2A. The acquired information is stored in the execution schedule information management table 194 and the execution schedule information table 195. Further, the execution schedule information acquisition unit 17 displays the execution schedule information of the “specific job” at the future specific date and time desired by the user on the display unit 12 as image information.

  FIG. 15 shows an image diagram of the execution schedule information displayed on the display unit 12. As shown in the figure, the execution schedule information 125 displays a job net job of “important work” scheduled to be executed at a specific date and time. Thereby, it becomes possible to grasp the future execution state of the business of the business server system 2A that is the object of the simulation.

  As described above, in this embodiment, the path specifying unit 14 searches for a path in accordance with the execution order of a plurality of specific jobs and specifies an execution path, and performs a path in the reverse direction of the execution order of the plurality of specific jobs. By executing at least one of the reverse search and searching for the execution path, it is possible to use a simple search and a high-accuracy search according to the purpose, and a simulation that matches the actual situation. realizable. In forward search, by specifying a critical path from execution paths formed between a start job specified as a search start point and an end job specified as a search end point among specific jobs. When the start point job and the end point job can be identified, the time required for execution from the start point job to the end point job can be quickly calculated. In the reverse search, when the critical path is identified from all the execution paths leading to the specified end point job, the end point job can be identified, and the time required to execute this end point job is quickly calculated. it can. Furthermore, by using this forward search and reverse search in combination, the required execution time can be accurately obtained. Further, the required execution time calculation unit 15 can calculate the required execution time with a small amount of processing with high accuracy by calculating the required execution time based on the execution time of all the jobs existing on the critical path. This makes it possible to form an operation management support system at low cost, perform simulations in a short time with a small amount of processing, even for large-scale systems, and accurately execute the execution time from the start to the end of multiple jobs. It can be calculated.

  In the above embodiment, the operation management support system 1A is formed in the client terminal 1 connected to the business server system 2A over the network. However, the operation management support system of the present invention can be provided in the business server system 2A. .

  It is needless to say that the above embodiment is merely an example and does not indicate that the present invention is limited to the above embodiment.

1 is a system configuration diagram and a functional block diagram of an operation management support system according to an embodiment of the present invention. It is an image figure which shows the detail of the database of an operation management support system same as the above. It is a flowchart which shows the procedure of calculation of the execution path search and execution required time in an operation management support system same as the above. It is an image figure of the setting screen displayed on the display part of the operation management support system same as the above. It is an image figure of the important work registration screen displayed on the display part of the operation management support system same as the above. It is an image figure of the display image which shows typically the job group which comprises important work displayed on the display part of the operation management support system same as the above. (A) The figure which showed typically the case where it searches in a some job in the operation management support system same as the above, (b) The figure which showed typically the case where it searches in a some job net. It is an image figure of the display image which shows typically the job group which comprises important work displayed on the display part of the operation management support system same as the above. It is an image figure of the display image which shows typically the job group which comprises important work displayed on the display part of the operation management support system same as the above. It is an image figure of the required time change screen for a user to add / change required time displayed on the display part of the operation management support system same as the above. It is an image figure of the search result display screen which displays the execution required time and the scheduled end time displayed on the display unit of the operation management support system. It is a flowchart which shows the procedure of collection / confirmation of job definition information etc. in an operation management support system same as the above. In the operation management support system as described above, (a) an image diagram in a state where a loop exists between paths connecting jobs, (b1) an image diagram in a state where a path forming an “unnecessary relation line” exists, (b2) “ It is an image diagram in a state in which a path forming an “unnecessary relation line” is deleted, and (c) an image diagram when a loop exists in a path connecting job nets. In the operation management support system same as above, (a) an image diagram of an important business association table formed in a database, (b) an image diagram of a name association table formed in a database. It is an image figure of the execution schedule information displayed on the display part of the operation management support system same as the above.

Explanation of symbols

1A: Operation management support system 2A: Business server system (computer)
13 ... Definition part (definition means)
14: Route specifying unit (route specifying means)
15... Execution required time calculation unit (execution required time calculation means)
16... Execution result information acquisition unit (execution result information acquisition means)
17... Execution schedule information acquisition unit (execution schedule information acquisition means)
18 ... Collection confirmation section for job definition information, etc. (collection confirmation means for job definition information, etc.)
19 ... Database 193 ... Important business association table 1221, 1222, 1226, 1231, 1232, 1233 ... Specific job 1223, 1224, 1225 ... Job

Claims (9)

An operation management support system for simulating execution time in a computer system having a plurality of jobs,
Definition information each of the jobs in the computer system to be managed is, to define whether a particular job and Noto also capable of forming a critical path,
And, linkage information as path information as information indicating the route of the processing of the plurality of jobs,
A database but accumulated,
Definition means for setting and changing the definition information;
Route specifying means for specifying an execution path as information for specifying the processing route of the specific job using the definition information and the linkage information;
A required execution time calculating means for calculating a required execution time as a sum of execution times of all the specific jobs for which the execution path is specified ;
Equipped with a,
In the definition information, it is defined that it is the unexecuted specific job and the specific job being executed that can form the critical path.
Execution result information acquisition means for acquiring actual execution result information at a specific date and time in the computer system at each current or past,
Before Symbol path specifying means,
Information on important work that is input by a user and that is formed by the job including the specific job and that is set as a work that is subject to calculation of the required execution time, and a plurality of the jobs that form the important work Of these, based on the information of the start job that is the specific job at the search start point,
By following the previous SL execution path along the execution order of the previous SL particular job, identified by the execution path, a forward search to identify the path of the processing of the specific job, reverse execution order of the specific job by following the previous SL execution path to perform a reverse search to identify the path of the processing of the specific job identified by the execution path,
In the forward search,
The route specifying means, from the start job specified as the search start point by the user input of the specified job, to the end of the execution order of the jobs that form the important job input by the user present, until the end point job is a specific job search end point, follows the path of the processing of the particular job that is specified by the execution path along said execution sequence,
The required execution time calculating means confirms the execution time of each of the specific jobs traced from the start point job to the end point job, calculates the execution required time as a sum of the execution times,
The route specifying means specifies the processing route of the specific job having the longest execution time as the critical path;
In the reverse search,
In the execution result information acquired by the execution result information acquisition unit from the start point job specified as a search start point by the user input, the route specifying unit includes the unexecuted job or the job being executed. The processing path of the specific job specified by the execution path is traced in the reverse direction of the execution order of the specific job to the end point job as the first execution order.
The required execution time calculation means confirms the execution time of each of the specific jobs traced from the start job to the end job, and based on the execution time, the execution required of the processing path of the specific job Calculate the time,
The route specifying means specifies the processing route of the specific job having the longest execution time as the critical path;
In the case of performing the forward search and the backward search,
In the forward search,
Among the jobs that form the important job input by the user from the starting point job of the forward search specified as a search start point by the user input, the route specifying means The processing path of the specific job specified by the execution path is traced along the execution order to the end point job of the forward search existing at the end of the execution order,
The execution time calculation means confirms the execution time of each specific job traced from the start job of the forward search to the end job of the forward search, and based on the execution time, Calculate the time required for execution of a specific job processing route,
In the reverse search,
The path specifying means, from the starting job of the backward search that is the specific job whose execution order is the last among the jobs that form the important job input by the user, of the execution result information Based on the record, the processing of the specific job specified by the execution path until the end point job of the backward search as the first execution order among the unexecuted job or the running job Follow the path in the reverse direction of the execution order of the specific job,
The execution time calculation means confirms the execution time of each specific job traced from the start job of the backward search to the end job of the backward search, and based on the execution time, Calculating the execution required time as a sum of the execution times of the specific job in the processing path;
The path specifying means specifies the processing path of the specific job having the longest execution time as the critical path of the backward search;
The path specifying unit selects the longer execution time as the normal critical path when the critical path of the forward search and the critical path of the backward search are different. Operation management support system. The path specifying means uses the specific job that has not been executed or the specific job that is currently being executed at the time of starting the forward search and / or reverse search as the start job and the end job as the execution path and the critical job. The operation management support system according to claim 1, wherein a path is specified . In the definition information of the database, job nets as a plurality of highly related job groups are recorded,
The route specifying means uses the job net to specify the execution path and the critical path,
2. The execution time calculation means calculates the execution time of the job net as a sum of execution times of the individual jobs constituting the job net when calculating the execution time. Or the operation management support system of 2. Comprising a result storage means for storing the result of the information of the calculation of the execution time required for information and said the critical path of the search results obtained critical path of the route specifying means,
When specifying the critical path from one start job to one end job, when there are a plurality of processing paths specified by the execution path from the start job to the end job ,
The route specifying means specifies each processing route from the start job to the end job by tracing each execution path only once,
The execution required time calculating means sequentially calculates the execution required time for each path of the processing from the start point job to the end point job,
Storing the calculated information on the required execution time in the result storage means;
The required execution time calculating means calculates the required execution time of the process path in the result storage means when calculating the required execution time of the process path from any start job to any end job. If the information is stored, the route specifying means uses the stored information on the required execution time as the required execution time of the processing path instead of the actual calculation of the required execution time. When the critical path from the start point job to the end point job is specified, information on the critical path from any start point job to any end point job is stored in the result storage unit Replaces the process for specifying the critical path with the stored critical path information from the start job to the end job. The management support system according to any one of claims 1 to 3, characterized in that used as the critical path. In the database, the execution result information acquired by the execution result information acquisition unit is recorded for each acquisition date and time,
The time required for execution calculation means any one of claims 1 to 4, characterized in that to calculate the execution time required by using the execution result information obtained in a specific time by the execution result information acquiring means The operation management support system described in 1. For important business that constitutes an actual business and is composed of a plurality of the jobs, the definition information of the important business as information including an ID assigned to each job that constitutes the important business, and the important business 6. The apparatus according to claim 1 , further comprising: a job confirmation information collection confirmation unit configured to confirm cooperation information between the jobs constituting the job and record the confirmation contents in the database. Operation management support system. The collection confirmation means such as job definition information creates an important job association table that tabulates the combination information of the start job and the end job in the route of the plurality of jobs constituting the important job. The operation management support system according to claim 6 , wherein the operation management support system is recorded in the database . Execution schedule information acquisition means for acquiring future execution schedule information of each of the jobs in the computer system from the computer system;
The operation management support system according to any one of claims 1 to 7 , wherein the execution schedule information acquired by the execution schedule information acquisition unit is recorded in the database for each scheduled execution date and time . A program that causes a computer to function as the operation management support system according to any one of claims 1 to 8.

Images