Processing

Please wait...

Settings

Settings

Goto Application

1. WO2012063339 - COMPUTER SYSTEM, JOB EXECUTION MANAGEMENT METHOD, AND PROGRAM

Publication Number WO/2012/063339
Publication Date 18.05.2012
International Application No. PCT/JP2010/070043
International Filing Date 10.11.2010
IPC
G06F 9/50 2006.01
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
FELECTRIC DIGITAL DATA PROCESSING
9Arrangements for program control, e.g. control units
06using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
46Multiprogramming arrangements
50Allocation of resources, e.g. of the central processing unit
G06F 9/48 2006.01
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
FELECTRIC DIGITAL DATA PROCESSING
9Arrangements for program control, e.g. control units
06using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
46Multiprogramming arrangements
48Program initiating; Program switching, e.g. by interrupt
CPC
G06F 2209/484
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
2209Indexing scheme relating to G06F9/00
48Indexing scheme relating to G06F9/48
484Precedence
G06F 2209/5017
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
2209Indexing scheme relating to G06F9/00
50Indexing scheme relating to G06F9/50
5017Task decomposition
G06F 9/46
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
9Arrangements for program control, e.g. control units
06using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
46Multiprogramming arrangements
G06F 9/4881
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
9Arrangements for program control, e.g. control units
06using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
46Multiprogramming arrangements
48Program initiating; Program switching, e.g. by interrupt
4806Task transfer initiation or dispatching
4843by program, e.g. task dispatcher, supervisor, operating system
4881Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
G06F 9/5038
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
9Arrangements for program control, e.g. control units
06using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
46Multiprogramming arrangements
50Allocation of resources, e.g. of the central processing unit [CPU]
5005to service a request
5027the resource being a machine, e.g. CPUs, Servers, Terminals
5038considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
Applicants
  • 株式会社日立製作所 HITACHI, LTD. [JP]/[JP] (AllExceptUS)
  • 畑邉 誠和 HATABE Norichika [JP]/[JP] (UsOnly)
  • 杉田 勉 SUGITA Tsutomu [JP]/[JP] (UsOnly)
Inventors
  • 畑邉 誠和 HATABE Norichika
  • 杉田 勉 SUGITA Tsutomu
Agents
  • 平木 祐輔 HIRAKI Yusuke
Priority Data
Publication Language Japanese (JA)
Filing Language Japanese (JA)
Designated States
Title
(EN) COMPUTER SYSTEM, JOB EXECUTION MANAGEMENT METHOD, AND PROGRAM
(FR) SYSTÈME INFORMATIQUE, PROCÉDÉ DE GESTION D'EXÉCUTION DE TÂCHE ET PROGRAMME
(JA) 計算機システム、ジョブ実行管理方法、及びプログラム
Abstract
(EN)
In the computer system of the present invention, the existence or non-existence of updates for master data for each partitioning key is managed as master data management information. If there is an update for the master data, the job is re-executed therefor, whereupon, at job re-execution time, the data is partitioned using only the partitioning key corresponding to the master data that has been updated, sub-jobs to be re-executed are localized in units by partitioning key, and the job is re-executed. (See FIG. 1)
(FR)
Dans le système informatique de la présente invention, l'existence ou la non-existence de mises à jour pour des données maître pour chaque clé de partitionnement est gérée en tant qu'informations de gestion de données maître. Si une mise à jour pour les données maître existe, la tâche est exécutée de nouveau pour ces données. Ensuite, au moment de la réexécution de la tâche, les données sont partitionnées à l'aide uniquement de la clé de partitionnement correspondant aux données maître qui ont été mises à jour, des sous-tâches à exécuter de nouveau sont localisées dans des unités par la clé de partitionnement et la tâche est exécutée de nouveau (voir FIG. 1).
(JA)
 本発明の計算機システムでは、マスタデータ管理情報として、分割キーごとにマスタデータの更新有無を管理する。マスタデータに更新があった場合にはジョブを再実行するが、ジョブ再実行時は更新されたマスタデータに対応する分割キーでのみデータ分割を行い、再実行対象のサブジョブを分割キー単位で局所化してジョブを再実行する。(図1参照)
Also published as
Latest bibliographic data on file with the International Bureau