Possibility of execution evaluating apparatus and method therefor
AssigneeInternational Business Machines Corporation
InventorRysuke Mamada
Life of this patent
Estimating the term…
Abstract
A compiler 2 sequentially simplifies, according to predetermined rules, a network of a processing flow defined by a PERT diagram and including a plurality of jobs executable in parallel, and determines which of any other jobs provide processing results causing each job to start and perform the processing when accepting them. Further, in the process of the simplification, if a pattern making the processing flow inexecutable, such as a loop, occurs in the network, the compiler 2 determines that the processing flow is inexecutable, and shows it to the user. If the processing flow is inexecutable, the compiler 2 generates a program for actualizing the processing of each job in the processing flow in synchronism with the processing of other jobs.
Claims10
Apparatus for determining whether a processing flow, including a plurality of jobs executable in parallel, can be executed each of said jobs starting when the job accepts the processing result of one or more previous jobs, the apparatus comprising:
- a simplification unit for simplifying a Program Evaluation and Review Technique (PERT) network
- according to predetermined rules, said network including one or more nodes formed by one or more
- jobs in said processing flow, and wherein said network, after being simplified, includes a part in which connections between the nodes of said part cannot be further simplified according to said rules;
- and
- an evaluating unit for identifying said processing flow, prior to execution, as being unexecutable when predetermined connection patterns are present, between a plurality of the nodes in said part of the network.
A method for determining whether a processing flow, including a plurality of jobs executable in parallel, can be executed, each of said jobs starting when the job accepts the processing result of one or more previous jobs, the method comprising:
- simplifying a Program Evaluation and Review Technique (PERT) network according to predetermined rules, said network including one or more nodes formed by one or more jobs in said processing flow, and wherein said network, after being simplified, includes a part in which connections between the nodes of said part cannot be further simplified according to said rules;
- and
- evaluating said processing flow, prior to execution, as being unexecutable when predetermined condition patterns are present, between the nodes in said part of the network.
A recording medium readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for determining whether a processing flows, including a plurality of jobs executable in parallel, can be executed, each of said jobs starting when the job accepts the processing result of one or more previous jobs, said method steps comprising
- sequentially simplifying a Program Evaluation and Review Technique (PERT) network according to predetermined rules, said network including one or more nodes formed by one or more jobs in said processing flow, and wherein said network, after being simplified, includes a part in which connections between the nodes of said part cannot be further simplified according to said rules;
- and
- evaluating said processing flow, prior to execution, as being unexecutable when predetermined connection patterns are present between a plurality of the nodes in said part of the network.
Dependencies are inferred from the claim text.