JPH07262055A - Processing time predicting method for computer program and computer therefor - Google Patents

Abstract

PURPOSE:To provide a processing time predicting method for computer program which can estimate the accurate program processing time corresponding to the load and a computer therefor. CONSTITUTION:This method is provided with a program processing time measurement means 3, a reference program storing means 2, and a time ratio calculation means 4 which calculates the time ratio D=B'/C based on the net calculation time C of the reference program and the processing time B' of the reference program set for a data processing means 1 when the load is applied to the processor 1. Then, the time B' is measured while the load 6 is applied to the processor 1, and the ratio D=B'/C is calculated based on both times C and B', the calculation time XC of a program X12 similar to the reference program is calculated, and the estimated processing time XC of the program X12 is calculated based on the time ratio D and the time XC.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a computer program processing time prediction method and a computer therefor. In the processing of the computer system, one CPU rarely performs one calculation processing, and normally a large number of calculation processings are simultaneously performed using a plurality of CPUs. Therefore, when focusing on one calculation program, the time from the start to the end of the process depends on the number of programs processed by the computer,
It makes a big difference depending on the contents of the program.

The present invention predicts in advance the processing time of different programs depending on the congestion of computers.

[0003]

2. Description of the Related Art A conventional computer program processing time (time from the start to the end of program processing) is estimated by accumulating statistical data of computer load (utilization rate) Was calculated and stored, while the relation between the computer load and the computer program processing time was statistically accumulated, and the processing time was predicted based on the predicted computer load value and the statistical data of the load and processing time. .

[0004]

Although the prediction of the processing time of the conventional computer program is statistically based on the data, the actual computer state always changes, and therefore the statistical data always applies. However, the present invention, which has not necessarily predicted accurately, recognizes the load (complexity) of the computer that is executing the computer program, and processes the computer program that accurately predicts the processing time according to the load. An object is to provide a time prediction method and a computer therefor.

[0005]

According to the present invention, a processing time B'of a reference program when a computer is in a loaded state is obtained, and a net calculation time C ( CPU access time and CPU
Time ratio D = B ′ / C, which is a coefficient indicating the degree of congestion of the computer, based on the ratio of the sum of the calculation time in B) and the processing time B ′.
Then, based on the time ratio D, the processing time of the program that is actually executed is predicted. The net calculation time is used because the CPU time measured by the computer or the processing time B of the reference program when the computer is unloaded is approximately equal to the calculation time C of the reference program.

FIG. 1 shows the basic configuration of the present invention. In the following description, the processing time is the time from the start of processing of a computer program (hereinafter referred to as a program) to the end thereof. The computer time represents a net calculation time, which is the sum of the times when the CPU is accessed and actually processed by the CPU to process the program.

In FIG. 1, reference numeral 1 denotes a data processing means, which is provided with a CPU and performs data processing. Reference numeral 2 is a reference program holding means for holding a reference program 2'which is a reference for processing time prediction, and the above calculation time is C. The reference program has a small load on the data processing means 1, and is a program that becomes a unit of repetitive processing of the program X whose processing time is predicted.

Reference numeral 3 is a processing time measuring means for measuring the processing time required for processing the reference program 2'with the data processing means 1 (time from the start to the end of the processing). .

Reference numeral 4 denotes a time ratio calculation means, which calculates the reference program 2'and a load on the data processing means 1.
The temporal ratio D = B ′ / C is calculated based on the processing time B ′ required for processing in a certain state.

Reference numeral 5 is a measurement result holding means, which is a calculation time C, a processing time B ', and a temporal ratio D of the reference program 2'.
Is to hold. A load 6 is a program that is processed by the data processing means 1.

Reference numeral 7 is a program P. 8 is a program Q. 9 is a program R.

Numeral 10 is an output means, which is a time ratio D
(Or the estimated processing time of the program that actually performs the processing) is output. Reference numeral 11 is the output temporal ratio D (or predicted processing time X _B ).

12 is a program X, which has a calculation time X
It is a program of c, which is a target of processing time estimation. Reference numeral 13 is a predicted time calculation process, which is a predicted processing time X _B =
The program X (12) is processed by the data processing means 1 by Xc × D.
This is to calculate the predicted processing time in the case of processing in.

[0014]

Before explaining the operation of the basic structure of the present invention shown in FIG. 1, the principle of the present invention will be described with reference to FIG.

FIG. 3A shows the case where the reference program 2'is processed by the CPU when there is no load. In FIG. 3 (a), 20 is a memory for holding the reference program 2 '.

Reference numeral 21 denotes a CPU, which is in an unloaded state (basic
(When processing other than the quasi program 2'is not performed).
Time T₀Processing of the reference program 2'starts at
T₁It is assumed that the processing ends with. Standard program step
CPU21 is accessed to process the program 1 and arithmetic processing is performed.
Net time (C
PU time) t ₀And Similarly, step n
The time it takes to access the data, calculate it with the CPU, and return it
t_nAnd

The calculation time C of the reference program A is C = t ₁ + ... + t _n .

The processing time B of the reference program 2'without a load is B = T ₁ -T ₀ .

In the case of no load, the reference program 2'has almost no time to wait for processing, so C≈B.

FIG. 3B shows when there is a load. 20 '
Is a memory for holding the reference program 2'and the general program P (7).

Reference numeral 21 is a CPU. Standard program 2 '
Starts at time T ₀ 'and ends at time T ₁ '. CP in step 1 and step n of standard program A
The net time required to process U21 is t ₁ and t _n , respectively, which is the same as when there is no load. However, when there is the program P (7), the CPU 21 also processes the program P while processing the reference program 2 ', so that the processing time B'required for processing the reference program 2'has no load. It becomes longer than the processing time B at the time.

Therefore, C = t ₁ + ... + t _n B '= T ₁ ' -T ₀ '> B.

Therefore, in the present invention, as the time ratio D, D = B '/ C is obtained from the calculation time C and the processing time B'of the reference program 2'. Alternatively, the processing time B of the reference program when the data processing means has no load is calculated,
The processing time D is obtained by using the processing time B as the computer time C.

The reference program for predicting the processing time is assumed to be a unit program for repeating the actual program X. Also, the calculation time Xc of the program X
Is measured in advance by a computer (data processing means).

When the time ratio of the data processing means is D, the time X _B required to process the program X is
Is X _B ≈Xc × D.

The basic structure of the present invention shown in FIG. 1 will be described with reference to FIG. FIG. 2 (1) shows the processing when the CPU has no load. FIG. 2 (2) shows the processing when there is a load on the CPU. (3) is a process for calculating the processing time.

(1) In processing 1, the calculation time C of the S1 reference program 2'or the processing time B when the data processing time is unloaded is measured.

S2 The calculation time C or the processing time B is stored in the measurement result holding means 5 as the calculation time C. (2) In the process 2, the load 6 (program P
(7), the program Q (8), the program R (9)) in the loaded state, the processing time measuring means 3
Measures the processing time B'of the reference program 2 '.

S2 The processing time measuring means 3 measures the processing time B'of the reference program 2 '. The S3 data processing means 1 retrieves the processing time B from the measurement result holding means 5. The S4 temporal ratio calculating means 4 calculates the temporal ratio D by D = B '/ C from the calculation time C and the processing time B'.

S5 Processing times B'and D are held in the measurement result holding means 5. (3) Process 3 This is a process of calculating the predicted processing time of the general program X similar to the reference program X.

S1 Reference program 2'time ratio D
Is output. S2 The predicted processing time X _B of the general program X similar to the reference program 2 ′ is calculated by X _B = Xc × D (calculation time Xc is obtained in advance).

According to the present invention, an accurate processing time can be predicted according to the state of the computer that actually executes the program.

[0033]

EXAMPLE The calculation time C will be described below with respect to the case where the processing time B measured when the data processing means is unloaded is the calculation time C.

FIG. 4 shows the first embodiment of the present invention. In FIG. 4, 31 is a data processing means.

Reference numeral 32 is a reference program holding means. Three
2'is a standard program. 33 is a processing time measuring means.

Reference numeral 34 is a temporal ratio calculating means. Reference numeral 35 is a measurement result holding means. 36 is a load.

37 is a program P. 38 is a program Q. 39 is a program R.

Reference numeral 40 is an output means such as a display. Reference numeral 41 is a display of the predicted processing time, the predicted end time, and the temporal ratio. 42 is a program X holding means.

42 'is the program X. Reference numeral 43 is a prediction processing time calculation means. Numeral 44 is a prediction end time calculating means, which is based on the calculation time Xc and the calculation time Xc 'after the processing is started, and the prediction end time = (Xc-Xc').
The estimated end time is calculated by × D.

Reference numeral 45 is an input means for inputting the calculation time Xc of a keyboard or the like. Reference numeral 46 denotes a calculation time measuring means, which is a time Xc '(from the processing time to C calculated actually after the processing of the program X (42') is started.
It measures the time excluding the waiting time of PU).

In the measurement result holding means 35, reference numeral 51 denotes the library 1 which holds the processing time B of the reference program 32 'when the data processing means 31 has no load 36.

Reference numeral 52 is a library 2, which is a basic reference program 3 when the data processing means 31 has a load 36.
The processing time B'of 2'is held. Reference numeral 53 is a library 3, which holds the time ratio D based on the reference program 32 '.

A process for obtaining the predicted processing time or the predicted end time when processing the program X in the configuration of FIG. 4 will be described. Calculation time Xc of program X
Is measured in advance. Further, the data processing means 31
The processing time B of the reference program 32 'when there is no load is
It is obtained in advance and measured and stored in the library 1 as the calculation time C of the reference program 32 '.

The calculation time Xc of the program X is input from the input means 45. The processing time measuring means 33 determines the processing time B'of the reference program 32 'by the data processing means 31 at that time and writes it in the library 52 (since the reference program 32' is a program with a light load on the data processing means 31, The load on the data processing means 31 for measuring B ′ is small). The temporal ratio calculation means 34 calculates the temporal ratio D by D = B ′ / C and writes it in the library 3.

The predicted processing time calculating means 43 calculates the predicted processing time X _{B according} to X _B = Xc · D. Output means 40
Outputs the estimated processing time X _B and the temporal ratio D. next,
Predicted end time b in the process of executing the program
A case will be described where (the time required to process an unprocessed portion during the processing of the program X) is obtained.

The processing of the program X is started. The calculation time measuring means 46 measures the net calculation time (CPU time) Xc ′ since the program X started processing. The predicted end time calculating means 44 fetches the calculation time Xc ′ after the processing of the program X is started, and calculates the predicted end time b from that time point by b = (Xc−Xc ′) × D. The predicted end time b is output to the output means 40.

FIG. 5 shows a second embodiment of the present invention. In FIG. 5, a plurality of reference programs are provided, and a reference program similar to the program for predicting the processing time is selected from the plurality of reference programs, and the predicted processing time and the predicted end time are displayed.

In FIG. 5, reference numeral 31 is a data processing means. A reference program holding means 32 holds different reference programs A ₁ , A ₂ and A _n .
Each of the reference programs has a small load on the data processing means 31. For example, it is a standard program for structural analysis, fluid analysis, sorting, search, text-binary conversion, and the like.

Reference numeral 33 is a processing time measuring means. 34 is hour
It is an inter-ratio ratio calculation means. Reference numeral 35 is a measurement result holding means.
Therefore, each standard program A₁~ A_nCalculation time C ₁~ C
n, processing time B₁’～ B_n’、 Time ratio D₁~ D_nTo
To hold.

37 is a program P. 38 is a program Q. 39 is a program R.

Reference numeral 40 is an output means such as a display. Reference numeral 41 is a display of the predicted processing time, the predicted end time, and the temporal ratio. Reference numeral 43 is a prediction processing time calculation means.

Reference numeral 44 is a prediction end time calculating means. 45
Is an input means for inputting the calculation time Xc of a keyboard or the like.

Reference numeral 46 is a calculation time measuring means. In the measurement result holding means 35, 51 is the Liplari 1,
It holds the calculation times C _{1 to} Cn of the reference programs A _{1 to} A _n .

Reference numeral 52 is a liplary 2 for holding the processing times B ₁ ′ to B _n ′ of the reference programs A _{1 to} A _n . 53 is a library 3 is to hold the temporal ratio D ₁ to D _n of the reference program A ₁ to A _n.

Reference numeral 55 is a program X, which is a target program for displaying the predicted processing time and the predicted end time.
The calculation time Xc is obtained in advance. In the configuration of FIG. 5, when displaying the predicted processing time and predicted end time of the program X, a reference program similar to the program X is selected. For example, when the reference program A ₁ is a reference program for structural calculation and the program X is a program for actually performing structural calculation, the reference program A ₁
Select.

The selection is made by the input means 45.
If there is no similar program, a reference program with a small load is created in the data processing means 31 with a configuration similar to the program X, the processing time B is calculated when the data processing means 31 is in the no-load state, and the library is created. The calculation time C is held at 1 (51). Alternatively, the calculation time C may be obtained by directly measuring the calculation time with a computer. And
The newly created reference program is held in the reference program holding means 32.

6, FIG. 7, FIG. 8 and FIG. 9 are embodiments of the present invention.
It is a flowchart of 2. Figure 6 shows the standard
This is a process of calculating the processing time B of the program. S1 group
Associate Program [A₁~ A_n] At the time of each processing
Between [B₁~ B _n]] (B₁~ B_nAre each
Associate Program A₁~ A_nCalculation time C ₁~ Is equal to Cn
And).

S2: It is determined whether the calculated processing times B _{1 to} B _n are to be registered in the library 1. If registered, the process proceeds to S3, and if not registered, the process ends. Register to S3 library 1.

FIG. 7 and FIG. 8 are flowcharts in the case of performing general calculation processing (processing of the above-mentioned program X) under load. S1 A general calculation process (process of the program X) is started.

S2 The reference program [A _{1 to} A _n ] is calculated and the processing time [B ₁ 'to B _n '] is calculated. It is determined whether to register in the S3 library 2. If registered, proceed to S4, and if not registered, proceed to S5.

Register in S4 library 2. The S5 standard program [A _{1 to} A _n ] is repeatedly calculated, and the processing time [B ₁ ′ to
Rewrite B _n '].

It is determined whether to register in the S6 library 2. If registered, proceed to S7. If not registered, proceed to S8. Register in S7 library 2.

S8: The processing time [B _{1 to} B _n ] is used to calculate the temporal ratio [D _{1 to} D _n ]. First, take out the calculation time and processing time from library 1 and library 2,
Then, the temporal ratio [D _{1 to} D _n ] = processing time [B ₁ to
_Bn ] / calculation time [C _{1 to} Cn] is calculated. The calculated temporal ratio [D _{1 to} D _n ] is registered in the library 3.

S9 processing time [B ₁ ' ~ B _n '] is used to calculate the temporal ratio. S10 Determine whether to register in the library 3. If registered, the process proceeds to S11, and if not registered, the process proceeds to S12.

Register to S11 library 3. S12 The time ratio [D _{1 to} D _n ] is calculated at regular intervals, and the library 3 is rewritten.

(Continued from FIG. 8) S12 'When calculating the prediction processing time, the process proceeds to S13, and when calculating the prediction end time, the process proceeds to S19.

S13 The process of calculating the estimated processing time X _B of the reference program X is started. S14 The same program as the program X is selected from the reference programs [A _{1 to} A _n ]. If found, proceed to S18, and if not found, proceed to S15.

S15 A standard program Ax having the same contents as the program X is created. However, it is assumed that the reference program Ax imposes less burden on the computer (data processing means). S16 Processing time B of standard program Ax under no load
To measure.

S17 Register in the library 1 and repeat the processing after S13 (S15 and S16 are the same as the processing of FIG. 7). Retrieve the temporal ratio Dx from the S18 library 3,
The temporal ratio Dx is taken out, and the predicted processing time X _B = calculation time Xc / temporal ratio X _D is calculated.

S19 The program X is actually calculated by the computer (data processing means). S20 The predicted processing time b of the program X is calculated. The temporal ratio Dx is taken out from the S21 library 3.
Prediction processing time b = (calculation time Xc−calculation time Xc ′) ×
The predicted processing time b is calculated from the temporal ratio Dx. However, Xc 'is the elapsed calculation time.

S21 'Display processing of the prediction processing time, the prediction end time and the temporal ratio is performed. FIG. 9 is a display process of the prediction processing time, the prediction end time, and the temporal ratio. S22 The time ratio is displayed.

From the S23 library 3, the time ratio [D
₁ / D _n ] is taken out and the averaged value [α] is obtained. α = (D ₁ + D ₂ + ... + D _n ) / n S24 α is plotted as one point in the line graph.

S25: The vertical axis is α and the horizontal axis is time, and α that changes at regular time intervals is displayed as a line graph. The value of S26α is displayed on the screen as it is.

Each time the value of S27 α changes, the numerical value on the screen is also changed. S28: Displays the estimated processing time. S29 The predicted end time is displayed.

FIG. 10 shows an example of the display screen of the present invention. In FIG. 10, a display screen 60 is a screen for displaying a graph of the prediction processing time, the prediction end time, the average value of the temporal ratio, and the temporal change of the temporal ratio.

Reference numeral 60 'denotes a display screen on which the contents of each library are displayed in a window.

[0077]

According to the present invention, since the processing time of the program is calculated by measuring the congestion degree of the computer, the processing time can be accurately predicted. In addition, even when the congestion level of the computer constantly changes during the execution of the program, the calculation process can be performed while measuring the congestion level of the computer at any time and correcting the end time each time. It is possible to make the timing of calculation processing and the work plan easier.

[Brief description of drawings]

FIG. 1 is a diagram showing a basic configuration of the present invention.

FIG. 2 is a diagram showing a flow of a basic configuration of the present invention.

FIG. 3 is a diagram illustrating the principle of the present invention.

FIG. 4 is a diagram showing a first embodiment of the present invention.

FIG. 5 is a diagram showing a second embodiment of the present invention.

FIG. 6 is a diagram showing a flowchart of a second embodiment of the present invention.

FIG. 7 is a diagram showing a flowchart of a second embodiment of the present invention.

FIG. 8 is a diagram showing a flowchart of a second embodiment of the present invention.

FIG. 9 is a diagram showing a flowchart of a second embodiment of the present invention.

FIG. 10 is a diagram showing an example of a display screen.

[Explanation of symbols]

 1: Data processing means 2: Reference program holding means 3: Processing time measuring means 4: Temporal ratio calculation means 5: Measurement result holding means 6: Load 7: Program P 8: Program Q 9: Program R 10: Output means 11 : Time ratio D 12: program X 13: prediction processing time calculation processing 14: input means

Claims (5)

[Claims] 1. Input means (14), output means (10) and data processing
Management means (1) and time from the start to the end of program execution
The processing time measuring means (3) for measuring the interval and the program total
Maintain a standard program that is the standard for predicting arithmetic time
Reference program holding means (2) and net of reference program
Calculation time C and load on data processing means (1)
Based on the processing time B'of the reference program in
The time ratio calculating means (4) for calculating the ratio D = B '/ C
The data processing means (1) is equipped with a load (6).
Measure the processing time B'of the quasi-program
Based on the calculation time C and the processing time B ′ of
= B '/ C is calculated, and a program similar to the reference program is calculated.
The calculation time Xc of the X (12) is calculated, and the time ratio D and the total are calculated.
Prediction processing of the program X (12) based on the arithmetic time Xc
Time x_BX _B= Xc × D
Computer program processing time prediction method. 2. The program X (1 according to claim 1, wherein the time ratio D and the calculation time Xc of the program X (12) are used.
A prediction processing time calculating means (43) for calculating the prediction processing time X _B of 2) with X _B = Xc × D is provided, and based on the temporal ratio D and the calculation time Xc, X _B = Xc × D A method for predicting the processing time of a computer program, characterized in that the predicted processing time X _B of the program X (12) is calculated and output. 3. The processing time measuring means according to claim 1, further comprising a measurement result holding means (5) for holding a calculation time C, a processing time B ′ and a temporal ratio D of the reference program.
(3) measures the processing time B'of the reference program with the load (6) on the data processing means (1) at any time, and the time ratio calculation means (4) calculates the time ratio at any time. A processing time predicting method for a computer program, which comprises updating the temporal ratio D held in the measurement result holding means (5). 4. The data processing means according to claim 1, 2 or 3, after the processing of the program X (12) is started.
The calculation time measuring means (46) for obtaining the net calculation time Xc ′ executed in (1) is provided, and the calculation time X of the program X (12) is provided.
c, the executed calculation time Xc ′, and the time ratio D, the time b until the program X (12) ends is b =
A method for predicting a processing time of a computer program, which calculates and outputs (Xc-Xc ') * D. 5. An input means (14), an output means (10), a data processing means (1), a processing time measuring means (3) for measuring the time from the start to the end of execution of the program, and a calculation time of the program. Based on the reference program serving as a reference for predicting, the measurement result holding means (5) for holding the net calculation time C of the reference program and the processing time of the reference program, and the time ratio D based on the processing time B ′ of the reference program. = B '/ C is calculated, and the predicted processing time X _B of the program of the program X (12) having a known calculation time Xc similar to the reference program is X _B = Xc × A computer characterized by being calculated by D.