JPH03118637A - Dynamic job multiplicity control system - Google Patents

Dynamic job multiplicity control system

Info

Publication number
JPH03118637A
JPH03118637A JP25528889A JP25528889A JPH03118637A JP H03118637 A JPH03118637 A JP H03118637A JP 25528889 A JP25528889 A JP 25528889A JP 25528889 A JP25528889 A JP 25528889A JP H03118637 A JPH03118637 A JP H03118637A
Authority
JP
Japan
Prior art keywords
job
multiplicity
execution
waiting time
class
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
JP25528889A
Other languages
Japanese (ja)
Inventor
Yumiko Mochizuki
望月 祐美子
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NEC Corp
Original Assignee
NEC Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NEC Corp filed Critical NEC Corp
Priority to JP25528889A priority Critical patent/JPH03118637A/en
Publication of JPH03118637A publication Critical patent/JPH03118637A/en
Pending legal-status Critical Current

Links

Abstract

PURPOSE:To reduce the operating load of an operator by providing a means which stores the job executing environment information, a job processing state accumulating means, a means which calculates the execution waiting time rate, a means which decides the job multiplex degree, and a control means. CONSTITUTION:A job processing state accumulating means 1 accumulates the total execution waiting time and the execution starting job number for each job class. A time informing means 2 informs a means 1 of the time information every fixed time. Then the means 1 informs a calculation means 3 of the cumulative execution waiting time and the cumulative execution starting job numbers for all job classes every prescribed time. The means 3 calculates the execution waiting time rate for each job class based on the reference execution waiting time stored in a storage means 4 and gives the result of calculation to a job multiplicity deciding means 5. The means 5 checks whether the job multiplicity is changed or not. If even just a single job class having a change is confirmed, a control means 6 is started and changes the multiplicity of the job classes of a job execution means 7. As a result, a fine and optimum multiplicity can be set.

Description

【発明の詳細な説明】 [産業上の利用分野] 本発明は、コンピュータシステムに関し、特にジョブ多
重度の制御に関する。
DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a computer system, and particularly to control of job multiplicity.

[従来の技術] 従来、ジョブ多重度の制御を行う際には、操作者がジョ
ブ多重度の変更に必要な情報(変更情報)をキーボード
から手入力し、この変更情報に基づいて、ジョブ多重度
制御が行われている。
[Prior Art] Conventionally, when controlling the job multiplicity, an operator manually inputs information necessary for changing the job multiplicity (change information) from a keyboard, and then changes the job multiplicity based on this change information. Severe control is in place.

[発明が解決しようとする問題点] 従来のジョブ多重度制御では、ジョブ多重度の変更に必
要な変更情報を手作業で投入することになっているため
、操作者が介入しないとジョブ多重度の変更ができない
という問題点がある。
[Problems to be solved by the invention] In conventional job multiplicity control, the change information required to change the job multiplicity is manually entered, so the job multiplicity cannot be changed without operator intervention. The problem is that it is not possible to change the .

また、最適なジョブ多重度でシステムを運用する為には
常時ジョブの処理状況を監視する必要がある。
Furthermore, in order to operate the system with optimal job multiplicity, it is necessary to constantly monitor the job processing status.

[問題点を解決するための手段] 本発明は、ジョブを実行するジョブ実行手段を備え、ジ
ョブの特性に基づいてジョブクラスを設定し、ジョブク
ラス毎にジョブの多重度を設定してシステム負荷の制御
を行うコンピュータシステムにおいて、システム全体の
ジョブ多重度及びジョブクラス毎のジョブの最大/最小
多重度、基準待ち時間、現在のジョブ多重度を含むジョ
ブ実行環境情報を記憶する記憶手段と、各ジョブクラス
のジョブの延べ実行待ち時間とジョブの実行開始数を累
積するジョブ処理状況累積手段と、累積実行待ち時間及
び累積実行開始数を受け、各ジョブクラスの実行待ち時
間率を計算する計算手段と。
[Means for Solving the Problems] The present invention includes a job execution unit that executes jobs, sets job classes based on job characteristics, and sets job multiplicity for each job class to reduce system load. a computer system for controlling job execution environment information including job multiplicity for the entire system, maximum/minimum job multiplicity for each job class, standard waiting time, and current job multiplicity; A job processing status accumulation means for accumulating the total execution waiting time and the number of job execution starts of jobs in a job class; and a calculation means for calculating the execution waiting time ratio of each job class based on the cumulative execution waiting time and the cumulative number of execution starts. and.

前記ジョブ実行環境情報及び前記各クラスの実行待ち時
間率に基づいて、各ジョブクラスの最適ジョブ多重度を
決定する決定手段と、前記決定手段からの通知により前
記ジョブ実行手段による各ジョブクラスのジョブ多重度
を制御する制御手段とを有することを特徴としている。
determining means for determining the optimum job multiplicity for each job class based on the job execution environment information and the execution waiting time rate for each class; It is characterized by having a control means for controlling the degree of multiplicity.

[実施例] 次に1本発明について実施例によって説明する。[Example] Next, one embodiment of the present invention will be explained with reference to examples.

第1図を参照して0本発明による動的ジョブ多重度制御
方式は、ジョブ処理状況累積手段1と。
Referring to FIG. 1, the dynamic job multiplicity control method according to the present invention includes job processing status accumulation means 1.

時間通知手段2と、計算手段3と、記憶手段4と。Time notification means 2, calculation means 3, and storage means 4.

ジョブ多重度決定手段5と、ジョブ多重度制御手段6と
、ジョブ実行手段7とを備えている。
It includes a job multiplicity determining means 5, a job multiplicity control means 6, and a job execution means 7.

第2図に、記憶手段4に記憶されるジョブ実行環境情報
の形式を示す。
FIG. 2 shows the format of the job execution environment information stored in the storage means 4.

第2図において、ジョブ実行環境情報は、システムの最
大多重度21と、ジョブクラス22.基準実行待ち時間
23.ジョブクラスの最大多重度24、ジョブクラスの
最小多重度25.及び現在のジョブ多重度26を備えて
いる。
In FIG. 2, the job execution environment information includes the maximum multiplicity of the system 21, job class 22. Standard execution waiting time 23. Maximum job class multiplicity 24, minimum job class multiplicity 25. and the current job multiplicity 26.

再び第1図を参照して、ジョブ処理状況累積手段1はジ
ョブクラス毎にのべ実行待ち時間と実行開始ジョブ数を
累積する。一つのジョブクラスに実行待ちのジョブが複
数存在する場合には全てのジョブの実行待ち時間を累積
する。
Referring again to FIG. 1, job processing status accumulating means 1 accumulates the total execution waiting time and the number of jobs that have started execution for each job class. If there are multiple jobs waiting for execution in one job class, the execution waiting time of all the jobs is accumulated.

時間通知手段2は所定時間毎にジョブ処理状況累積手段
1に時間情報を通知する。ジョブ処理状況累積手段1は
1時間情報を受けると、全ジョブクラスの所定時間毎の
実行待ち時間の累積と実行開始ジョブ数の累積とを計算
手段3に通知し、実行待ち時間と実行開始ジョブ数の累
積カウンタをゼロにクリアする。
The time notification means 2 notifies the job processing status accumulation means 1 of time information at predetermined intervals. When the job processing status accumulation means 1 receives the one-hour information, it notifies the calculation means 3 of the accumulation of execution waiting times and the accumulation of the number of execution start jobs for all job classes at predetermined time intervals, and calculates the execution waiting time and execution start jobs. Clears the number of cumulative counters to zero.

計算手段3はジョブクラス毎に実行待ち時間率を計算す
る。
The calculation means 3 calculates the execution waiting time rate for each job class.

この際。On this occasion.

実行待ち時間率 記憶手段4に記憶された基準実行待ち時間として計算す
るが、累積実行開始ジョブ数がゼロの場合には平均実行
待ち時間を、とり得る最大の値として処理する。
It is calculated as the standard execution waiting time stored in the execution waiting time rate storage means 4, but if the cumulative number of execution start jobs is zero, the average execution waiting time is processed as the maximum possible value.

各ジョブクラスの実行待ち時間率が計算が終了すると、
計算手段3はこの結果をジョブ多重度決定手段5に渡す
Once the execution waiting time rate of each job class has been calculated,
The calculation means 3 passes this result to the job multiplicity determination means 5.

ここで、第3図も参照して、決定手段5の動作について
説明する。
Here, the operation of the determining means 5 will be explained with reference also to FIG.

処理31では計算手段3から渡されたジョブクラスと実
行待ち時間率との配列を実行待ち時間率をキーにして昇
順に並べる。処理32では実行待ち時間率が1より小さ
いか調べる。小さい場合は処理33に進み2等しいか大
きい場合は処理36に進む。
In process 31, the job classes and execution waiting time rates passed from the calculating means 3 are arranged in ascending order using the execution waiting time rates as keys. In process 32, it is checked whether the execution waiting time ratio is smaller than 1. If it is smaller, the process proceeds to step 33; if it is equal to or greater than 2, the process proceeds to step 36.

処理33では現在のジョブ多重度が記憶手段4に記憶さ
れた該当ジョブクラスの最小多重度より大きいか調べる
。大きい場合は処理34に進み。
In process 33, it is checked whether the current job multiplicity is greater than the minimum multiplicity of the relevant job class stored in the storage means 4. If it is larger, proceed to process 34.

等しいか小さい場合は処理35に進む。処理34では該
当ジョブクラスの現ジョブ多重度を1つ小さくした値を
記憶手段4の該当ジョブクラスの現ジョブ多重度に記憶
する。処理35では実行待ち時間率のより大きいジョブ
クラスがあればそのジョブクラスをジョブ多重度決定対
象ジョブクラスとして処理32に戻り、なければ処理3
6に進む。
If they are equal or smaller, the process proceeds to step 35. In process 34, a value obtained by reducing the current job multiplicity of the relevant job class by one is stored in the current job multiplicity of the relevant job class in the storage means 4. In process 35, if there is a job class with a higher execution waiting time ratio, that job class is set as a job class to be determined for job multiplicity and the process returns to process 32; otherwise, the process returns to process 3.
Proceed to step 6.

処理36では実行待ち時間率の一番大きなジョブクラス
をジョブ多重度決定対象ジョブクラスとする。
In process 36, the job class with the largest execution waiting time rate is set as the job class for which job multiplicity is to be determined.

処理37では変更後の全ジョブクラスのジョブ多重度合
計が記憶手段4に記憶されるシステムの最大多重度より
小さいか調べる。小さい場合は処理38に進み、大きい
場合は処理312に進む。
In process 37, it is checked whether the total job multiplicity of all job classes after the change is smaller than the maximum multiplicity of the system stored in the storage means 4. If it is smaller, the process proceeds to process 38; if it is larger, the process proceeds to process 312.

処理38では実行待ち時間率が1より大きいか調べる。In process 38, it is checked whether the execution waiting time ratio is greater than 1.

1より大きい場合は処理39に進み9等しいか小さい場
合は処理312に進む。
If it is greater than 1, the process proceeds to step 39; if it is equal to or smaller than 9, the process proceeds to step 312.

処理39では該当ジョブクラスの多重度が記憶手段4に
記憶される最大多重度より小さいか調べる。小さい場合
は処理310に進み2等しいか大きい場合は処理311
に進む。
In process 39, it is checked whether the multiplicity of the relevant job class is smaller than the maximum multiplicity stored in the storage means 4. If it is smaller, proceed to process 310, and if it is equal to or greater than 2, proceed to process 311
Proceed to.

処理310では該当ジョブクラスの現ジョブ多重度を1
つ大きくした値を記憶手段4の該当ジョブクラスの現ジ
ョブ多重度に記憶する。処理311では実行待ち時間率
のより小さいジョブクラスがあればそのジョブクラスを
ジョブ多重度決定対象ジョブクラスとして処理37に戻
り、なければ処理312に進む。
In process 310, the current job multiplicity of the relevant job class is set to 1.
The increased value is stored in the current job multiplicity of the relevant job class in the storage means 4. In process 311, if there is a job class with a smaller execution waiting time ratio, that job class is set as the job class to be determined for job multiplicity and the process returns to process 37; otherwise, the process proceeds to process 312.

処理312ではジョブ多重度に変更があるか調べ、変更
があるジョブクラスが1つでもある場合は制御手段6を
起動し、全ジョブクラスに変更がない場合は終了する。
In process 312, it is checked whether there is a change in the job multiplicity, and if there is a change in even one job class, the control means 6 is activated, and if there is no change in all job classes, the process ends.

ここで、第4図を参照して、制御手段6の動作について
説明する。
Here, the operation of the control means 6 will be explained with reference to FIG.

制御手段6が起動されると、処理41において。When the control means 6 is activated, in process 41.

ジョブ多重度決定手段5からジョブの多重度を変更する
ジョブクラス及び新しい多重度を入力する。
The job class for which the job multiplicity is to be changed and the new multiplicity are input from the job multiplicity determining means 5.

処理42では処理41により入力された情報によリジョ
ブ実行手段7のジョブクラスの多重度を変更する。
In process 42, the multiplicity of the job class of the rejob execution means 7 is changed based on the information input in process 41.

[発明の効果] 以上発明したように本発明では、操作者の手を煩わせる
ことなく動的にジョブの多重度を変更できるため、操作
者の操作の軽減を図ることができる。また、各ジョブク
ラスのジョブの最大/最小多重度や基準実行待ち時間を
調節することにより。
[Effects of the Invention] As described above, according to the present invention, the degree of multiplicity of jobs can be dynamically changed without bothering the operator, thereby reducing the number of operations required by the operator. Also, by adjusting the maximum/minimum job multiplicity and standard execution waiting time of each job class.

きめこまかな最適多重度の設定が可能となるという利点
がある。
This has the advantage that it is possible to set the optimum multiplicity in a fine-grained manner.

段、3・・・計算手段、4・・・記憶手段、5・・・ジ
ョブ多重度決定手段、6・・・ジョブ多重度制御手段、
7・・・ジョブ実行手段。
stage, 3... calculation means, 4... storage means, 5... job multiplicity determining means, 6... job multiplicity control means,
7...Job execution means.

【図面の簡単な説明】[Brief explanation of drawings]

第1図は本発明の一実施例を示す構成図、第2図は第1
図に示す記憶手段に記憶されるジョブ実行環境情報の一
形成を示す図、第3図は第1図に示すジョブ多重度決定
手段による処理を示すフローチャート、第4図は第1図
に示すジョブ多重度制御手段による処理を示すフローチ
ャートである。 第1図において。 1・・・ジョブ処理状況累積手段、2・・・時間通知手
第 1 図 第2図 第4図 41 処理 42処浬
FIG. 1 is a configuration diagram showing one embodiment of the present invention, and FIG.
3 is a flowchart showing the processing by the job multiplicity determining means shown in FIG. 1, and FIG. 4 is a diagram showing the formation of job execution environment information stored in the storage means shown in FIG. 7 is a flowchart showing processing by a multiplicity control means. In FIG. 1...Job processing status accumulation means, 2...Time notification means 1 Fig. 2 Fig. 4 41 Processing 42 processing

Claims (1)

【特許請求の範囲】 1、ジョブを実行するジョブ実行手段を備え、該ジョブ
の特性に基づいてジョブクラスを設定し、該ジョブクラ
ス毎にジョブの多重度を設定してシステム負荷の制御を
行うコンピュータシステムにおいて、ジョブ実行環境情
報を記憶する記憶手段と、各ジョブクラスのジョブの延
べ実行待ち時間とジョブの実行開始数を累積するジョブ
処理状況累積手段と、前記累積実行待ち時間及び前記累
積実行開始数を受け各ジョブクラスの実行待ち時間率を
計算する計算手段と、前記ジョブ実行環境情報及び前記
実行待ち時間率に基づいて各ジョブクラスのジョブ多重
度を決定する決定手段と、前記決定手段からの通知によ
り前記ジョブ実行手段による各ジョブクラスのジョブ多
重度を制御する制御手段とを有することを特徴とする動
的ジョブ多重度制御方式。 2、特許請求の範囲第1項において、前記ジョブ実行環
境情報はシステム全体のジョブ多重及びジョブクラス毎
のジョブ最大/最小多重度と、基準待ち時間と、現時点
におけるジョブ多重度とを有することを特徴とする動的
ジョブ多重度制御方式。 3、特許請求の範囲第1項において、予め定められた時
間を計時する時計手段を備え、該時計手段がカウントア
ップすると、前記ジョブ処理状況累積手段は前記累積実
行待ち時間及び前記累積実行開始数を前記計算手段に与
えるようにしたことを特徴とする動的ジョブ多重度制御
方式。
[Claims] 1. A job execution means for executing a job is provided, a job class is set based on the characteristics of the job, and a job multiplicity is set for each job class to control the system load. In a computer system, a storage means for storing job execution environment information, a job processing status accumulation means for accumulating the total execution waiting time of jobs of each job class and the number of job execution starts, and the cumulative execution waiting time and the cumulative execution calculation means for calculating the execution waiting time rate of each job class based on the number of starts; determining means for determining the job multiplicity of each job class based on the job execution environment information and the execution waiting time rate; and the determining means a control means for controlling the job multiplicity of each job class by the job execution means based on a notification from the job execution means. 2. Claim 1 provides that the job execution environment information includes job multiplicity of the entire system, maximum/minimum job multiplicity for each job class, standard waiting time, and current job multiplicity. Features a dynamic job multiplicity control method. 3. In claim 1, the job processing status accumulating means includes a clock means for counting a predetermined time, and when the clock means counts up, the job processing status accumulating means calculates the cumulative execution waiting time and the cumulative execution start number. A dynamic job multiplicity control method, characterized in that the calculation means is provided with:
JP25528889A 1989-10-02 1989-10-02 Dynamic job multiplicity control system Pending JPH03118637A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP25528889A JPH03118637A (en) 1989-10-02 1989-10-02 Dynamic job multiplicity control system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP25528889A JPH03118637A (en) 1989-10-02 1989-10-02 Dynamic job multiplicity control system

Publications (1)

Publication Number Publication Date
JPH03118637A true JPH03118637A (en) 1991-05-21

Family

ID=17276681

Family Applications (1)

Application Number Title Priority Date Filing Date
JP25528889A Pending JPH03118637A (en) 1989-10-02 1989-10-02 Dynamic job multiplicity control system

Country Status (1)

Country Link
JP (1) JPH03118637A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH05197570A (en) * 1992-01-21 1993-08-06 Nec Software Kansai Ltd Dynamic scheduling device for job
JP2011113139A (en) * 2009-11-24 2011-06-09 Fujitsu Ltd Computer system, information processing method, and program

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH05197570A (en) * 1992-01-21 1993-08-06 Nec Software Kansai Ltd Dynamic scheduling device for job
JP2011113139A (en) * 2009-11-24 2011-06-09 Fujitsu Ltd Computer system, information processing method, and program

Similar Documents

Publication Publication Date Title
JPH0869386A (en) Process scheduling system
JP3006551B2 (en) Business distribution system between plural computers, business distribution method, and recording medium recording business distribution program
JPH03118637A (en) Dynamic job multiplicity control system
US6604200B2 (en) System and method for managing processing
JPH06161837A (en) System for selecting volume on external storage device
JP2003177928A (en) Scheduling method for variable time-slice time
JP5058416B2 (en) Batch control system for online combination system, program for batch control of online combination system, and recording medium recording the program
JPH05173807A (en) Job schedule system
JPH0588917A (en) Job scheduling system
JPH0212554A (en) Input/output buffer allocation system
JPH04340135A (en) Cpu time distribution control system between plural processing types
JPH06309180A (en) Interrupt controller for computer system
JPH0855091A (en) Distributed processing system and load distributing method for this system
JPH1063603A (en) Peripheral control device and its load state setting method
JP3126247B2 (en) Information processing apparatus and method
JPH04257915A (en) Information processor
JP2601693B2 (en) Automatic job scheduling method
JPH032920A (en) Message output processing system for information processing system
CN115237242A (en) Control method and device
JPH0969054A (en) Job class decision system
JPH08329022A (en) Input/output process load decentralization control system for multiprocessor system
JPH0830560A (en) Load control system for computer system
JPS60238938A (en) Operating method of computer system
JPS63137344A (en) Memory control system in transaction processing system
JPH05197570A (en) Dynamic scheduling device for job