Method for automated deployment of a software program onto a multi-processor architecture

DETAILED DESCRIPTION OF THE INVENTION To enable the tasks comprising a complex problem to be deployed across processors in a multi-processor architecture, the invention employs a DFG of the problem solution to both pre-assign and pre-schedule the individual tasks that lead to an execution of the solution of the problem.
Each task is assigned to a "logical processor", a logical processor being a data structure that defines an eventual physical processor's functions and performance requirements.
In addition to assigned tasks, each logical processor is also assigned criteria which must be fulfilled when the task or tasks to be carried out by the logical processor are deployed onto a physical processor in a chosen multi-processor architecture.
The deployment of pre-assigned, pre-scheduled tasks is accomplished by using a map of available physical processors in the multi-processor architecture, as well as information describing the current utilization and interrelationships of the physical processors.
The above resume of the invention will be better understood by initially referring to FIG.
1.
In the known manner, a programmer employing a DFG software package constructs a flow graph 10 that illustrates various tasks that comprise a procedure for achieving a solution of a selected problem.
Such problems often involve arrays of data and lend themselves to solution on highly parallel, multi-processor architectures.
DFG 10 illustrates relationships between a plurality of tasks/primitives employed in the solution of an exemplary problem.
Data input to the DFG occurs via input nodes 12 and 14.
While each of primitives A-F can exhibit a wide range of complexities, each consists of a task that is predetermined and for which detailed performance data and code object file names already exist in the data base of a data processing system (e.
g.
a workstation) used to construct the DFG.
Once DFG 10 has been created, the programmer has produced a graph data base 15 that includes a node interconnect file 16 and an object screen positional file 18