Method and apparatus for processing executable program modules having multiple dependencies

• US 6,430,590 B1
• Filed: 01/29/1999
• Issued: 08/06/2002
• Est. Priority Date: 01/29/1999
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Fischer, Stephen E.
• Primary Examiner(s): BANANKHAH, MAJID A
• Application Number:
  US09/239,943
• Time in Patent Office: 1,285 Days
• Field of Search: 709/100, 714/2, 714/20, 714/32, 714/35, 714/38, 714/45, 717/114, 717/141, 717/158, 712/201, 712/214, 712/233, 712/236, 712/237
• US Class Current: 718/100
• CPC Class Codes: G06F 30/23 using finite element methods [FEM] or finite difference methods [FDM]

Abstract

A computer readable storage medium for executing a simulation process representing a collection of semiconductor devices and tests for the devices. The simulation process constitutes a batch job of a plurality of execution modules representing nodes of a directed acyclic graph. Each of the nodes contains a directory identifying any parent modules which have to be executed prior to executing the module, and identifying any child execution modules which are to be executed subsequent to executing the module. The directory also includes a status file indicating the state of execution of the module containing the directory. A supervisory processor performs a job farming operation on each of the execution modules in a distributed processing system. The execution modules are processed in an order defined by the identity of any parent and child modules referenced in the directories. At the completion of execution of a module, the status file of the directory is changed to indicate that the module has been executed.

Claims

1. A computer-readable storage medium storing computer-executable instructions for implementing method steps for controlling the processing order of executable program modules in a computer system having multiple interdependent executable program modules, said method steps comprising:

creating for each executable program module, a list of parent modules for said executable program module, and a status file for representing whether said executable program module is awaiting execution or has completed execution;

arranging said modules as nodes in an execution sequence defined by a directed acyclic graph;

traversing the directed acyclic graph to begin execution of all executable program modules without parent modules;

periodically checking the parent list of each node to determine whether all parent modules have completed execution;

updating the associated status file when a module has completed execution; and

beginning the execution of modules whose parent modules have completed execution, and updating the associated status file to indicate the module is currently executing.

2. The computer-readable storage medium of claim 1, wherein access to status information in a process flow of executable program modules is global in a multiprocessor system, allowing simultaneous use of said multiple computer systems to process a process flow.

3. The computer readable storage medium of claim 1 wherein each of said execution modules contain a script identifying the job to be executed by said computer system.

4. The computer readable storage medium of claim 3 wherein each of said execution modules'"'"' list of parent modules and execution code are contained in a directory.

5. The computer readable storage medium of claim 1 wherein said method further includes the updating of said status file when execution of said module begins.

6. A method for executing a simulation process representing a collection of semiconductor devices and tests of said devices defined by a batch job of a plurality of execution modules representing nodes of an acyclic graph to be executed, comprising:

creating a directory of pointers for each module identifying any parent modules which have to be executed prior to executing the module containing said directory, said directory also including a file which identifies the execution status of the module containing said directory;

job farming each of said execution modules for execution in a distributed processing system in an order defined by the identity of any parent; and

changing the status file of a directory of a module when said execution of said module is completed.

7. The method for executing a semiconductor simulation process according to claim 6 wherein said job farming is carried out by a supervisory computer of said distributed processing system in an order which executes said modules having no parent execution modules prior to executing the remaining execution modules.

8. The method for executing a semiconductor simulation process according to claim 7 wherein said supervisory computer controls execution of said remaining execution modules by locating child modules having a status file which remains in the unexecuted state from a parent execution module which has completed execution.

9. The method for executing a semiconductor simulation process according to claim 6 wherein each directory contains a script defining the job to be executed for that execution module.

10. The method for executing a semiconductor simulation process according to claim 7 wherein said supervisory computer periodically checks the status bit of each directory of a module, and the state of the status file of any parent module, before assigning said module for execution.

11. The method for executing a semiconductor simulation process according to claim 10 wherein said supervisory computer after checking said status bits, starts a subprocess to execute said execution module assigned for execution and to update said module status field to a running status.