SYSTEM FOR HIGH-LEVEL VIRTUAL COMPUTER WITH HETEROGENEOUS OPERATING SYSTEMS

Abstract: A system facilitates a high level virtual computer (HLVC) in a heterogeneous hardware and software environment. A user specifies the hardware and software configuration of a virtual computer which is routed into a configurator (12), which activates a distributed process controller (14) and supporting components in the desired virtual computer. Each processor in the virtual computer is equipped with a language injection library (24) and runtime servers (daemons (20)). In one embodiment, the language injection library facilitates transference of data among the processors in the system during the execution of an application program, and isolates the details of coordinating the heterogeneous hardware and software in the virtual computer. The disclosed embodiments easily lend themselves to the construction of scalable special purpose processors.

Description: SYSTEM FOR HIGH-LEVEL VIRTUAL COMPUTER WITH HETEROGENEOUS OPERATING SYSTEMS Field of the Invention The present invention is a system for creating high-level virtual computers (HLVC's) among a set of com¬ puters having various languages, communication protocols, and operating systems. Background of the Invention It is common in computer applications for an operator to wish to execute programs involving several separate computers simultaneously. The simultaneous use of several computers may be required for a parallel- processing application, where the labor of carrying out a large number of calculations within a single application is divided among several computers to increase total speed. Alternatively, a corporate user may have at his disposal several different computers used by various parts of the company; e.g. the personnel, accounting, production, etc. departments each of which may use a different computer system. The corporate user may wish to run a program without having to be concerned with the locations of data and subprograms. For example, it would be convenient to have a number of idling computers to help with the calculation when a single coit -jter cannot deliver the results in time. A significant problem arises, however, if the various computers which an operator would like to use are of different protocols and/or operating systems. There are any number of operating systems in popular use today, such as UNIX, VMS, or VM. Similarly there are any number of protocols for interprocessor communication in common use, such as TCP/IP, DECNET, SNA, or OSI. Obviously a computer having operating system A and protocol B will not be able to easily share data and computing power with another computer with operating system C and protocol D. The present invention facilitates coordination of heterogeneous computer systems, particularly for large applications. The system of the present invention enables a user at a host station to create a high-level virtual computer, or HLVC, out of a network of heterog¬ eneous computers. Figure 1 is a schematic diagram showing how a network of different computers of various operating systems may be combined to form various HLVC's. The nine computers shown in the diagram are physically connected by a common network bus. Various multi-proces¬ sor applications may require the use of subsets of the computers on the network, or all of the computers. By initiating the flow of data or instructions among various computers in the system, various HLVC's may be created. For example, HLVC 1 in Figure 1 consists of the three computers in the dotted circle, while HLVC 2 may include the computers in the dashed circle, and HLVC3 may include the computer encompassed by the dotted-dashed circle. HLVC's are defined by the interaction and flow of data and/or instructions among a certain set of computers for a particular application. In addition to physical connection of various computers in the HLVC, it is essential that different program modules, or "software chips," which may be embodied in various computers, be coordinated within the HLVC. Thus, an HLVC is marked not only by different types of hardware, but by a cooperation of software which may be spread among various locations. Figure 2 is a symbolic rendering of the interaction of different software chips in an HLVC. Each software chip (also known as a "module" or "sub-program") is considered as a set of program instructions suitable for a particular type of computer in the HLVC which produces an output in response to a data input. The interconnection between the outputs and inputs is by means of data buses. In an HLVC the output from one software chip may also be the input to another software chip, as shown in Figure 2. The execution locations of the software chips can form Single Instruction Multiple Data (SIMD) sometimes refer¬ red to as Scatter and Gather (SAG) , Multiple Instruction Multiple Data (MIMD) , and pipelined parallel components of various granularity. The operation of an HLVC must be understood as a means for building efficient distributed application systems based on distributed heterogeneous computers. The present invention facilitates the development, synthesis, and automatic execution control of large applications using heterogeneous computer systems. With the present invention an operator simply enters into a host computer general instructions defining which com¬ puters in the network are to be used for which tasks, or elects to have the system apportion the load among the computers. Each software chip in the system includes within a set of short programs, called up by instructions from the host process, which effect the necessary modifi¬ cations to the different computers so that data or instructions may be transferred from one computer to another computer. The system itself, not the operator, performs the "chores" of coordinating the different languages and operating systems by generating or initiat¬ ing dynamic service programs, or "daemons", at runtime. In this approach, since the code generation is performed within the various computers as needed during the course of one application, efficient daemons are created for any computing or communication device by specifying pre¬ defined desired properties. This approach offers a greater degree of specialization in the generated pro- 5 grams in comparison to building a general-purpose system (such as a distributed operating system) affording both efficiency and flexibility in the resulting application. In another embodiment of the present invention, computation intensive functions or programs are imple- 10 mented into the system by way of a high level interface. This high level interface minimizes the effort needed to expended by the user of the HLVC system to have these computation extensive programs performed. The system of the present invention carries out its 15 objects in a practical manner because automatic code generation overhead, normally introduced by algorithmic generalization, is limited to the minimal level and will only grow linearly with the size of interprocess com¬ munication needs. In cases where efficiency is of prime 20 consideration in a heterogeneous computing environment, such as in real-time applications, the system can serve as a tool to find the best program partition and process allocation strategy. Once the near optimal is found, the automatically generated or initiated daemons may be 25 further refined by implementing them using lower level, machine dependent codes. Summary of the Invention The present invention is a system for enabling communication among a plurality of target computers. 30. Each of the target computers includes at least one communication channel, memory space accessible through the communication channel, and a library of language injections in the memory space. Each language injection is a high level interface between the programmer and lower level interprocessor communication control com¬ mands. Each language injection is a subroutine in the target computer for the transference of data or instruc¬ tions through the communication channel according to a runtime supplied interprocess communication pattern. The target computers are operatively connected to at least one host computer. The host computer includes means for processing a computing environment specification, the computing environment specification being a set of instructions for activating at least a subset of the target computers for accepting data, and instructions from the host computer. The host computer further in¬ cludes means for processing an application program. The application program includes sub-programs runable by at least one of the subset of target computers, and further includes at least one interprocessor control command for activating one of the language injections in a target computer. The host computer also includes means for transferring the sub-programs to the appropriate target computers for compilation and execution. In one embodiment, related to computational inten¬ sive programs, such as a FRACTAL display program, the user is provided with a high level interface to initiate the execution of the program. The present invention, by means of predetermined control of multiple heterogenous computers, reduces the execution time of the computation intensive programs. The computers perform known parallel processing techniques, such as SIMD (SAG), MIMD and pipe¬ lining. Brief Description of the Drawings For the purpose of illustrating the invention, there is shown in the drawings a form which is presently preferred; it being understood, however, that this inven- tion is not limited to the precise arrangements and instrumentalities shown. Figure 1 is a general diagram showing the operation of a virtual computer. Figure 2 is a diagram generally showing the inter¬ connections of software chips within a virtual computer. Figure 3 is a block diagram showing the main elements of the present invention. Figure 4 is a flowchart illustrating the function of the CSL compiler. Figure 5 is a flowchart illustrating the function of the Distributed Process Controller. Figure 6 is a block diagram showing the interaction of the present invention with two target computers. Figure 7 is a flowchart illustrating the function of the Remote Command Interpreter Daemon. Figure 8 is a flowchart illustrating the function of the Port ID Management Daemon. Figure 9 is a flowchart illustrating the function of the Sequential File Daemon. Figure 10 is a flowchart illustrating the function of the Mailbox Daemon. Figure 11 is a flowchart illustrating the function of the Tuple Space Daemon. Figure 12 is a simplified flowchart showing an example application. Figure 13 is a diagram illustrating the function of hierarchical programming using the present invention. Figure 14 is a diagram showing the HLVC component interconnection related to a second embodiment of the present invention. Figure 15 is a diagram illustrating the function of the Nodecap monitor daemon (NODECAPD) . Figure 16 is a diagram illustrating the function of the Configurator (CSL Compiler) of the second embodiment. Figure 17 is an illustration showing some of the parameters of the X.Prcd file generated by the CSL compiler of the second embodiment. Figure 18 is a diagram showing the components of a high-level virtual computer of the second embodiment. Figure 19 is a diagram showing the process of injecting distributed functions (input, output and computation) into a user program. Figure 20 is a diagram showing the sub-components of the Distributed Function Library and two exemplary runtime scenarios. Figure 21 is a diagram composed of Figure 21(a), (b) and (c) respectively showing the three basic dis¬ tributed parallelism techniques: SIMD (SAG) , MIMD and pipelines. Figure 22 is a diagram illustrating the function of the Remote Command Interpreter Daemons (RCID) of the second embodiment. Figure 23 is a diagram illustrating the function of the Distributed Process Controller (DPC) of the second embodiment. Detailed Description of the Invention General Overview Figure 3 is a diagram showing the relationships among the different elements of the present invention and the heterogeneous computers in the system. First, a general overview of the system function will be described with reference to Figure 3; detailed explanations of individual elements of the system will follow. The system of the present invention comprises four major elements: (a) a Configuration Specification Lan¬ guage (CSL) compiler or "configurator" to be described with reference to Figures 4 and 16 for first and second embodiments, respectively; (b) a Distributed Process Controller (DPC) to be described with reference to Figures 5 and 23 for the first and second embodiments, respectively; (c) a Language Injection Library (LIL) to be described with reference to Figures 6 and 19 for the first and second embodiments, respectively; and (d) a runtime support daemon library to be described with reference to Figures 7-11, 15 and 22 related to both the first and second embodiments. Figure 3 shows the general relationship among the elements of the invention. Figure 3 illustrates a host computer by means of a phantom box 10. The host computer 10 allows the operator, in one embodiment, to enter in¬ structions for a multiprocessor application. In another embodiment, to be more fully described, an application console is provided to allow the operation to command execution of multiprocessor applications by the mere entrance of the name of the program. The host computer 10 is connected through a common bus 16 to any number of network computers (WS1, WS2 ... WSk) . (Hereinafter, "network" will refer to the computers physically con¬ nected to each other; the subset of computers in the network used in a particular application will be referred to as the "system".) The system of the present invention is defined by software embodied in the various computers in the network. Whether a particular computer operative¬ ly connected to the network is a host computer, a target computer, a master computer, a worker computer, depends on the nature of the multiprocessor application. The elements of one embodiment of the present invention within the host computer are shown within the box 10 in Figure 3. There may be more than one host computer within any computer network; indeed, a network can be so created that every computer in the network may function as a host computer. The configurator 12 acts as the interface between the entire system and the operator. The configurator 12 acts as a compiler for two inputs from the operator: the specification in configuration specification language (CSL) and the network capability, also known as the computing environment specification language (CESL) specification. The CESL specification is a definition of the capabilities and properties of all of the hardware and system software in the entire network. The CESL specification is generally pre-programmed into the system and includes information about the available languages, operating system, and protocol for each com¬ puter in the network. This information interacts with the Language Injection Library, as will be explained below. Figure 4 is a flowchart showing the function of the CSL compiler in the configurator 12 for one embodi¬ ment of the present invention. For another embodiment, the configuration is shown in Figure 16. The CSL speci¬ fication and the network specification, illustrated in Figure 4, are entered by the user. With the network specification, the configurator creates a network graph, which is a list of all of the computers physically avail¬ able in the network, including information about the operating systems, programming languages and communica¬ tion protocols. A CSL specification also includes information about the interdependency of the various sub¬ programs in the application program. For example, it may be necessary that a first sub-program be completed before another sub-program begins. The CSL compiler analyzes the sequences and dependencies and ascertains that there is no contradiction in the CSL specification. Another function of the CSL compiler is to generate single-instruction-multiple-data workers, or "slaves", in the control processing units CPU's which are not expli¬ citly required by the CSL specification. The "slaves" are sub-programs within the application program which are not explicitly assigned for execution on a particular computer. If these sub-programs access data through a "tuple space" (which will be explained below) , these programs may be run anywhere in the network having a suitable compiler. The "slave" programs in an applica¬ tion, then, may be placed anywhere they are compilable in a network, and the CSL compiler will place them wherever there is room. Although general-purpose computers commonly have only one operating system, it is common for a computer to accommodate a number of types of protocols. Some proto¬ cols are more efficient for certain purposes than others. Another function of the CSL compiler is to calculate which protocols available on a particular network com- puter are more efficient for a particular purpose. Finally, the CSL compiler generates code to be sent to the distributed process controller (DPC) 14. For one embodiment, a flow chart of the DPC is illustrated in Figure 5, whereas for another embodiment the flow chart of the DPC is illustrated in Figure 23. To the DPC 14 illustrated in Figure 5, to be described, the CSL com¬ piler generates the application precedence, by which the various interdependencies of the software chips (sub¬ programs) are specified. The sub-programs which are part of the main application program are sent to the target computers where their execution is desired (in a static system) or chosen (in a dynamic system) , as well as the Interprocess Communication (IPC) patterns for the trans¬ ference of instructions among computers during the execu- tion of the application program, as will be explained below. In a first embodiment, the application prece¬ dence, software chips (also known as modules or sub¬ programs) , and IPC patterns are all sent out within program "shells" for loading into the DPC 14 and the target computers, in a manner known in the art. In the second embodiment, the program shells are transferred from DPC to respective RCID's and carried out by the RCIDs. The new embodiment merges the sub-program shells with the dependency information file, thus simplifying the clearing process when an application is completed. An instruction is operated by the configurator to activate the DPC when it is time for the application to begin. The DPC receives from the configurator an IPC pattern and a control script for each software chip. If, under the instructions in a particular application, certain software chips must be run before other software chips, the sequence or dependency is also controlled by the DPC. If the user elects to use dynamic process alloca- tion, the DPC includes a ranking of individual computers in the network, such as by speed or suitability for a particular purpose, so that the DPC may choose among several possible computers in the network for the purpose of maximizing efficiency. This programmed ranking of individual computers in the network is based on the CESL specification. Of course, the operator may deliberately choose that certain sub-programs be executed at certain locations; for example, the sub-program for displaying the final results of an application would typically be executed at the user's host location. Figure 5 is a flowchart for one embodiment showing the operation of the distributed process controller (DPC) . If the execution location of a particular module (software chip) is not specified by the user, the sub- program is considered "dynamic", and the DPC will choose, based on its internal ranking of computers on the net¬ work, the most efficient combination of network com¬ puters. If the particular execution location is not "dynamic", the DPC will simply respond to the user instructions and address the requested network computer through its remote command interpreter daemon (RCID) , as will be explained in detail below with reference to Figure 7. Once a connection is made between the DPC and the desired target computer, the module's IPC pattern and shell may be loaded to the target computer. Due to the presence of the commercially available Network File System (NFS), the module's executable body IPC pattern and shell may not need to be loaded to target computer. CESL specification should give this information and direct the DPC to operate accordingly. In the course of the execution of a single applica¬ tion program having a number of sub-programs or modules, it is common that a particular module may be run several times. Thus, whether or not the graph is "dynamic", the DPC, after sending a process to a particular target com¬ puter, will query whether the process must be sent again, as indicated by the "more?" boxes in the flowchart. Fur¬ ther, the DPC spawns an interactive server shell, or query shell, which monitors the process of the applica- tion program. When a particular module in an application program is completed, a network message interrupt is sent to the DPC. Upon receiving this interrupt, the DPC updates the graph it has created for the system, to indicate that a certain module is finished for the purposes of the present application. Finally, when all of the modules are run the required number of times, the DPC terminates. The DPC 14 within the host computer 10 is connected by a bus 16 to the ports of the target computers WS1, WS2 ... WSk in the network. The means by which instructions from the host computer are transferred to the target com¬ puters will be explained in the following section. A Simple Example Figure 6 is a schematic diagram showing the essen¬ tial hardware elements for carrying out a simple multi¬ processor operation. This multi-processor operation is applicable to the first embodiment illustrated in Figures 1-13. Another embodiment applicable to computation intensive programs is to be described with reference to Figures 14-23. For this example, applicable to Figures 1-13, the objective of the program will be for a message "hello" to be transferred from a first workstation computer WS1 to a second workstation computer WS2. The host computer 10 shown in Figure 6 is the same as the host computer shown in slightly different form in Figure 3, and again the host computer 10 may be embodied in a second computer on the network or in any computer so adapted on the network. Thus, although the host computer 10 is shown as a separate element in Figure 6, it may be embodied within either WS1 or WS2 as well. As an illustration of the capabilities of the present invention, assume that computer WS1 includes a VMS operating system, a DECNET protocol, and a FORTRAN compiler. In contrast, WS2 includes a UNIX operating system, a TCP/IP protocol, and a PASCAL compiler. The specific types of operating system, protocol, or compiler are not necessary to the invention but are shown in this example to illustrate the function of the present inven¬ tion in a heterogeneous system. The object of this example program is to initiate a message (the word "hello") in a short program in WS1, and then to output that message into a port in WS2, where a program in WS2 will read the message, for instance to display it on a monitor. The entire multiprocessor operation is initi¬ ated by the operator through the host computer. The operator enters into the host computer 10 the CESL specification and the IPC patterns through the CSL specification. The CESL specification is typically pre¬ programmed into the host computer upon the physical connection of various computers onto the network; gener¬ ally the operator need not bother with the CESL at the beginning of each application. The IPC pattern is first specified in the CSL (first embodiment) or a process graph (second embodiment) . The pattern is not completely defined until process locations are determined. The actual programs, the "write_hello" program in FORTRAN for WS1 and the "read_hello" program in PASCAL for WS2, are compiled using the process to be described with reference to Figure 19. For this example, the IPC pattern (which may be in any particular format) includes instructions to locate the "write_hello" program in WS1, and the "read_hello" program in WS2 over the network. Within each of the target computers are certain essential elements: adjacent a well-known port in WS1 and WS2 is a "daemon" 20. As will be explained below, the daemon 20 is a short monitoring program by which a target computer on the network waits for a signal from the host computer. Adjacent the daemon in each target computer is a memory space 22. As used here, "memory space" in each computer is used broadly for any means for storing data or instructions. Within the memory space 22 is a lan- guage injection library (LIL) 24, which is a library of subroutines which are activated by instructions from the host computer, as will be explained below. Also within each target computer is the customary compiler and operating system, which in the case of WS1 in Figure 4 is a FORTRAN compiler and VMS operating system and a PASCAL compiler and UNIX operating system are in the computer WS2. Also embodied within the computer is an input- output protocol which is used by the system software on both computers. The IPC pattern in the configurator 12 passes to the DPC 14, shown in Figure 3, and activates the daemons 20 in computers WSl and WS2 shown in Figure 6. The daemon 20 is a Remote Command Interpreter Daemon (RCID) , (the exact operation of which will be explained below with reference to Figure 7) , which in effect activates computers WSl and WS2, initializing each computer to expect a program to be loaded into its memory 22. The RCID (daemon) in each computer WSl and WS2 is a short monitoring program which branches upon an instruction from a host computer. After the daemons in WSl and WS2 are caused to branch, the host computer sends to computers WSl and WS2 respectively the execution programs for the application, in this case the "write_hello" program for WSl and the "read_hello" program for WS2, as shown in Figure 6. The "write_hello" program for WSl is entered into the host computer in FORTRAN so that it may be compiled within WSl itself. This program includes the instruc- tions to create a string variable of the word "hello" and output the variable "hello" to an output port. Since, in this example, WSl has a VMS operating system, it should be pointed out that the "native" communication protocol for the VMS operating system is DECNET, which requires "name abstraction" for input and output ports. That is, in DECNET output ports are identified by name, and the specific physical port used at any given time will vary depending on how many ports are being used at a particu¬ lar time. However, with name abstraction, a declared output port is simply given a name, and the name stays bound to its declared purpose no matter which actual physical port the data eventually passes through. Thus, for this case the program must name the output port, for example "tmp" for "temporary" for output to WS2. The program sent from the host computer 10 to computer WS2 is the "read_hello" program, having the function of accepting the string variable "hello" from the output port "tmp" from WSl. In this example, WS2 has a UNIX operating system. The native protocol for the UNIX operating system is TCP/IP, which uses "port" abstraction as opposed to the "name" abstraction in the VMS. With "port" abstraction, specific physical ports are assigned functions by the program. Programs are sensitive to the specific number of a port, and not to a temporary name given in the course of a program. With port abstraction, a user must use what is known as a "yellow pages" to obtain the correct numbered port to which a certain output is sent out, or at which a certain input is expected. This "yellow pages" technique is well-known in UNIX programming. Note also that either DECNET or TCP/IP can be used by the system as a whole. For this example, wherein a message is written in computer WSl and sent to WS2, the program is initiated in one computer and the second computer reacts to the first computer. WS2 is thus in a position of having to wait for a data input from WSl. In order to effect this waiting, the "read_hello" program must include the set¬ ting up of a mailbox or equivalent memory space, and an instruction to read the contents of the mailbox when data is entered therein from a port. Thus, the message "hello" enters WS2 through a port, and then goes into a mailbox (shown as 30) where it waits until it is read by the program in WS2. The mailbox is also in the form of a daemon; it is a monitoring loop which branches upon the input of data. A mailbox is only one type of data structure possible with the present invention; other types of data structures for more complicated applica¬ tions will be discussed below. Because WSl uses a VMS operating system and WS2 in this example uses a UNIX operating system, provision must be made somewhere in the system for reconciling the name abstraction of VMS (WSl) with the port abstraction of UNIX (WS2) by designating a common communication proto¬ col. The system takes care of the translations between port numbers and names. Specifically, if TCP/IP is selected, the program in WS2 gives the appropriate port number to the WSl program and spawns a mailbox daemon (which is the setting aside of buffer space associated with the declared port) . The "read_hello" program in WS2 does not read directly from the port but reads from the contents of the mailbox associated with the port when the string variable is inserted through the port into the mailbox in WS2. In addition to reconciling the port abstraction and name abstraction, there are any number of necessary sub¬ routines going on "underneath" the main programs which are entered into the host computer by the operator. The advantage of the present invention is that the organiza¬ tion of the system itself (in a software sense) is such that the "chores" of coordinating multiple heterogeneous computers (in this case two computers) are performed automatically by a library of "language injections" which are activated by the operator's instructions, the details of which the operator ordinarily never sees. For exam¬ ple, the reconciling of port abstraction would be per¬ formed by sub-programs within the invention automatically in response to a general IPC instruction. It is the activation of these language injections, or subroutines, by the IPC patterns in the system which allow programs such as the present example to be executed with minimum instructions from the operator. In order to activate the necessary computers in the network for a particular ap- plication, the user enters a CSL which is generally stated in one or a very small number of program lines. For instance, if the entire system-wide application is named "talk", a typical phrasing of the IPC pattern would look like this: configuration:talk; M:write(exec_loc=wsl) *• F:msg ► M:read(exec_loc=ws2) where "exec_loc" is a possible CSL instruction for "execution location". This one line of program tells the system to expect a program named "write" which should be executed at WSl, a program "read" which should be exe¬ cuted at WS2, and that there will be a flow of data from WSl to WS2. When this instruction is compiled by the configura¬ tor in the host computer 10, a large number of sub- routines will be activated. The configurator is essen¬ tially a program which accepts the terse instructions from the user and in response generates directives to guide runtime utilities to operate efficiently. Certain advantages of the present invention over the previously known methods of virtual computer program¬ ming should be pointed out. Heretofore, if a sub-program within a larger execution program was intended to be exe¬ cuted on a particular computer in a network, the sub-pro¬ gram itself would have to include the numerous lines of program required to coordinate the interprocessor com¬ munication, such as port abstraction or name abstraction. A programmer would have to coordinate the different ports in the various computers in advance, before running the entire program. Such coordination is time-consuming and restricts subsequent changes in the program; for example, if it were simply decided to change the execution loca¬ tion of one sub-program from a UNIX-FORTRAN work station to a VMS-FORTRAN work station, a large number of lines in the sub-program itself would have to be changed to accommodate the different method of identifying ports. Thus, with prior art methods even the simple change in execution location requires substantial alteration of the execution programs. In contrast, with the present invention, each sub- program is independent of its execution location. In order to change the execution location of a particular sub-program, the user need only change the CSL specifica¬ tion. The system automatically produces new IPC pattern files to coordinate the various computers in the system. The IPC patterns coordinate with the various subroutines in the Language Injection Library (LIL) , as will be explained in detail below. The Daemons Daemons are short monitoring programs which are continuously running at the reserved ports of the com¬ puters on the network. For one embodiment, the associ¬ ated daemons are illustrated in Figures 7-11. For another embodiment, the associated daemons are illus¬ trated in Figures 15 and 22 and also Figures 8-11. In general, in its normal state, each daemon runs as an endless loop until an instruction is received from the network. The incoming instruction causes the loop to branch. Thus, through the daemons, any computer on the network can be "called into action" by the host computer for a particular application. There are two classes of daemons, permanent and dynamic. The permanent daemons run continuously in all of the computers on the network, in expectation of instructions from the host computer. The dynamic daemons are created, or "spawned", within individual computers incidental to a particular application. For the first embodiment, there are three permanent daemons: the Remote Command Interpreter Daemon (RCID) (Figure 7), the Port Identifier Management Daemon (PIMD) (Figure 5) , and daemons for external files, such as the Sequential File Daemon (SEQD) (Figure 9) . The second embodiment to be described hereinafter, shares the daemons illustrated in Figures 8 and 9. Figure 7 shows a flowchart of the RCID, which was mentioned briefly in the simple example given above. The function of the RCID is to be available to receive a signal from the host com¬ puter at a "well known port", in a manner known in the art. An interrupt for the daemon from the host computer will send its signal through this well known port. Processes are initiated when a signal is sent from the host computer to the RCID in one of the computers on the network. The key step in the spawn subprocess is a conversion of the incoming signal to the operating system format in the computer. The daemon program branches into one or more of these processes when it is interrupted by a signal from the host computer. If the operating system in the host computer operates by port abstraction, for example, the daemon will initiate a process within the local operating system by which a name will be created for a port in the operating system through which the incoming program from the host computer may enter. Similarly, with name abstraction, the daemon will initi¬ ate a process by which a specific port is prepared for the incoming program having a pre-defined port name. Other processes which may ensue when the loop is inter¬ rupted include a load calculation and report, for exam¬ ple, to report back to the host computer how much space has been used as a result of the program entering the port. Another possible instruction may be a "terminate" instruction. Different subprocesses may be initiated by the daemon depending on the actual signal from the host computer which interrupts the loop in the local daemon. Network computers using UNIX may also require a "delete zombie" instruction to be activated by the RCID. The "delete zombie" instruction erases data or program lines which have entered the local computer as a result of a particular application. As is known in the art, with the UNIX operating system, a "zombie" is a program which is no longer needed but remains in the memory. The Port Identifier Management Daemon (PIMD) of Figure 8 provides the service of binding unique port num¬ bers to user defined objects. Figure 8 shows a simple flowchart of the PIMD. Once again a loop is established at a "well known port" to wait for an interrupt from the host computer. Depending on the signal by which the loop is interrupted by the host computer, the PIMD can be used to declare, or register, a user-given name to a parti¬ cular port, remove that name, or reset the internal data structures. This daemon is required only in operating systems where port abstraction is used, such as UNIX. Figure 9 shows a flowchart for the sequential file daemon (SEQD) . The sequential file is one of many forms for accessing external files known in the art. Other external file systems in common use include the ISAM (Index Sequential Access Mechanism) , the relative or "HASH" file, and the database or knowledgebase files. The distribution of all of these external files work in a basically similar fashion, and although the sequential file is described in detail here, it would be apparent to those skilled in the art to apply other forms of external files to the present invention. The sequential file is useful for applications, such as personnel files. With a sequential file, the files are scanned so that every record in an entire file is read. The other external file systems mentioned would use more sophisticated means of locating a desired record in a file more quickly, if the processing of the entire file is not desirable. The sequential file daemon shown in Figure 9 exists at a well-known port of a target computer, allowing all remote computers to access the sequential files on this computer. A loop is set up at a well-known port, which branches upon the input of a request. A request would include the name of the desired file, and one of four operations (OPEN, CLOSE, READ, WRITE) to be performed on the accessed file and information about the requesting computer. The sequential file daemon shown in Figure 9 also includes an "index" system which is common in sequential file applications but is not necessary to the present invention. With the "index" system, every ten requests for data out of the file are handled by a particular software structure. Once a particular remote software chip requests data from the file, that request is given an index number, and subsequent requests from the same software chip will be handled by the same software structure within the file. If more than ten requests accessing different files are made, it spawn another software structure, referred to by the next highest index number. For example, requests 1-10 will be given index number "1", 11-20 will be given index number "2", etc. This system is well known in the art. Sequential file daemon may be implemented as a permanent or dynamic daemon depending upon user's preference while RCID and PIMD are mandatory permanent daemons. It should be pointed out that all permanent daemons use "well known ports" in an operating system where port abstraction is used, such as UNIX, or "generic names", such as RCID, PIMD, and SEQD in systems were name abstra¬ ction is used, such as VMS. The dynamic daemons are daemons which are spawned incidental to a particular application. An IPC data ob- ject, such as a mailbox, external file, or tuple space, is an entity to which all defined semantic operations, such as READ, WRITE, PUT, GET, or EXIT, are implemented. This not only simplifies the design and implementation of dynamic daemons, but also improves the general efficien- cy. Since each dynamic daemon corresponds to a named entity in an application, these names are used to derive network object names. In an operating system where port abstraction is used, the network object name is derived by the CSL compiler. For both embodiments of the present invention there are two types of dynamic daemons, the tuple space daemon (TSD Figure 11) and the mailbox daemon (MBXD Figure 10) or SEQD, if the user so desires. These daemons are created incidental to use of IPC data ob- jects, which will be described in detail below. IPC Data Objects The inter-process communication (IPC) data objects are software mechanisms by which sub-programs in the user's application communicate with each other. There are three types of IPC data objects in common use: the mailbox, the tuple space, and the sequential file. The sequential file is implemented by a SEQD daemon, as described above. These different kinds of IPC data objects are used for various specific tasks. The mailbox data object is an arrangement whereby a quantity of data is sent from one computer to a second computer, the information being held temporarily in the second computer until the second computer is ready to use it. Figure 10 shows a flowchart for a mailbox daemon (MBXD) . The MBXD is created through the RCID and is assigned to a specific port obtained from PIMD, or a net¬ work name (if name abstraction is used) . The MBXD will then set up a loop at the application specific port and wait for a request such as "read_mail," "put_mail," or "close_mail". The MBXD creates a local mailbox (that is, sets aside a specific space in the memory of the local computer) and then relays the message coming through the port into the mailbox, where it may be read by the sub- program on the local computer. In response to the "close_mail" request, the daemon sends an end-of-file (EOF) message to the local mailbox and removes the binding of the name of the mailbox from the specific port, so that the port and the name may be used again within the application. The MBXD can be used to construct coarse-grain MIMD (multiple instruction multiple data) components and pipe¬ lines. The MIMD and pipeline functions are to be further discussed with regard to a second embodiment. When there are multiple senders, multiple MBXD's may be adapted to multiplex into a single local mailbox. Another important type of IPC data object having its own specific daemon is the "tuple space", which has associated with it a tuple space daemon (TSD) (Figure 11) . The tuple space concept is very important for parallel-processing applications; that is, applications in which the labor of a very large program is apportioned automatically among several computers to save time. The advantage of tuple space is that by its very nature the arrangement allows automatic load-balancing: in essence, with tuple space computers in a network, the computers which can complete tasks the quickest are automatically given more tasks to do. The general principle of tuple space is known in the art (see, for example, Gelernter, "Getting the Job Done", Byte. November, 1988, p. 301). Basically, a tuple space is best thought of as a "bag" of "tuples". These tuples represent divisible computational portions of a larger application. In a heterogenous system, some com- puters on the network may work faster than other com- puters. With tuple space, every computer in the system simply grabs one tuple from the tuple space, performs the computation and then puts the results back into the tuple space before taking another tuple to do. The important point is that each computer in the system may simply take another task as soon as its present task is completed, if the tuple size is optimized, this balanced the loads of heterogenous computers automatically. In contrast to a sequential system, wherein the network computers effec- tively "stand in line" and one particularly long task can hold up the completion of shorter, simpler tasks. In tuple space, there are for present purposes three important operations, "put", "get", and "read". When a particular task is completed by one of the com- puters in the system, it may be returned to the tuple space as simply a quantity of ordinary data, which may be accessed and read in a subsequent task. A "put" is the placing of data into the tuple space. A "get" is the removal of data from the tuple space. In a "read" (RD) , a computer merely looks at a tuple in the tuple space but does not remove it from the tuple space, so that it may also be read by another computer in the system. Figure 11 shows a flowchart for the tuple space daemon (TSD) . As with the MBXD, the port for the input or output of instructions or data for a tuple space is created and named by a PIMD (Figure 8) . The TSD of Figure 10 will be associated with one application spe¬ cific port. In addition to the tuple space commands of put, get, and read, the TSD is also sensitive to open and close commands through an application-specific port. Figure 12 is a simplified flowchart, for the first embodiment of the present invention, showing an applica¬ tion involving both mailboxes and tuple spaces. The objective of the program is to multiply two matrices of dimensions NxN. Each value within the matrix requires a dot-multiplication operation of a row in the first matrix and a column in the second matrix. In this example, the various dot-multiplication operations are apportioned among several "worker" computers. In this example, the matrices to be multiplied are located in two mailboxes Mbx A and Mbx B. The values for the two matrices may have been entered into these mailboxes piecemeal over a period of time. When the application program is run, the data from the mailboxes is sent to an initializer pro- gram, which accesses tuple space tsl. Once the data is in the tuple space tsl, the various worker computers access individual rows and columns and perform the dot- multiplication operation. As soon as a worker is fin¬ ished with one operation, it will send the result back to the tuple space and take another row and column for another operation. Because worker computers may operate at varying speeds, it is likely that, by the time the matrices are completely multiplied, some workers will have performed more operations than others; but this versatility is the virtue of the tuple space. When the multiplication is completed, the results are sent from the tuple space into a collector program which deposits the final answer in mailbox (Mbx) C. Below the flowchart in Figure 12 is shown a typical CSL specification for this operation. The first line of the specification gives a name "Matrix_multiply" to the entire operation. The next line organizes files (shown with a capital F) and modules (identified by the capital M) . Thus, files A and B are organized as mailboxes, file TS1 is organized as a tuple space, and C is organized as another mailbox. The "initializer" and "collector" pro¬ grams are organized as modules, or sub-programs, within the application program. The arrows between the organ¬ ized files and modules indicate the flow of data in the course of running the application program. The following lines organize the relationship of the worker computers to the tuple space tsl. Thus, the line "F:TS1 → M:Wor¬ ker1 → F:TS1" indicates that data will be moving from the tuple space TSl to a program called "worker 1" and then back to tuple space TSl. The various worker programs may or may not be embodied in different computers; in fact, • the operator will probably not care about where the worker programs are physically executed. It should also be pointed out that the "worker" programs, as they all access a tuple space and their physical location was not specified in the CSL, are "slave" programs for purposes of locating the programs by the CSL compiler. Below the CSL specification in Figure 12 is a representative CESL specification. The various lines show a typical specification with available languages, operating systems, and communication protocols. Language Injection Library (LID The essential attribute of an HLVC is the transfer¬ ence of data and program instructions among various co - puters. In the present invention, this transference of data and instructions is effected by the IPC data ob¬ jects, using software mechanisms such as the mailbox, tuple space, or the sequential file. These mechanisms may be implemented using dynamic daemons. This interac- tion between dynamic daemons and application programs exists in the form of "language injections". The collec¬ tion of language injections within each computer in the network is a "language injection library" (LIL) previous¬ ly discussed with regard to Figure 6. The LIL for a second embodiment is to be described hereinafter with reference to Figures 16 and 17. Each language injection is a software subroutine, corresponding to a specific IPC operation on a specific IPC data object. Each such language injection is called into action by the command in the application program being run by the particular computer. The source code of the language injection library should be compilable and runable in any operating system and with any protocol. That is, from the programmer's view point, the IPC commands which activate the subroutines of the language injection library are the same no matter which language and for what protocol or operating system the application program is intended. However, the object code form for each language injection will vary depending on the protocol and operating system of the target computer. Within each computer, the language injections are written in a form runable in that particular computer. When the source code of the language injection library is included in the application program, it is said that the program is "linked" to be described with reference to Figure 19. The set of input and output LIL functions are used by application programs or subprograms (modules) for net¬ work transparent programming. LIL is preprogrammed and compilable on multiple operating systems and communica¬ tion protocols. This is done by using pre-processor statements. For example, if the LIL is to be implemented in C and a code segment should only be read by a C compiler under Digital VMS operating system, then thiε segment must be controlled by a pre-processor symbol, say VMS. Obviously, the most popular operating system may be the default requiring no control symbols. Various communication protocols, such as TCP/IP, DECNET, SNA and OSI, should all be treated the same way. Note that the inclusion of various operating sys¬ tems in a LIL will only contribute to the compilation size of LIL while the inclusion of many communication protocols may contribute to runtime overhead. To avoid excessive runtime overhead, a management scheme is neces- sary to control the LIL to operate with no more than three (3) communication protocols. This number corres¬ ponds to the maximum number of communication protocols supported by a single computer among all accessible computers in a network. Different from conventional programming language macros, LIL routines base their operations on a runtime supplied IPC pattern file. This IPC pattern file dic¬ tates the physical (actual) communication patterns of the underlying program (or module) at runtime to be described with reference to the lower part of Figure 19. For a first embodiment, every LIL function performs a certain task on a given data object (identified by a user defined name) . For a second embodiment, to be described with reference to Figures 14-23, a high level interface is provided to reduce the necessary steps of an operator or user to perform parallel programming tasks, especially, those associated with computation intensive functions. Every data object for the first embodiment assumes a set of permissible semantic operations. For example, a tuple space object may have "open/close", "put", "get" and "read" operations while a mailbox object may assume "open/close" "read" and "write" operations. The main features of typical input/output functions are provided as follows. The description uses the syntax: "return_type function_name (parameters) " for all functions. The "return_type" is given as either "void" or "integer", depending on whether a signal is returned to the user. These features may be further described with reference to some specified functions. a) void cnf_init() This is an implicit function called at the start of an image (the first time execution of cnf_open) to initialize internal data structures for the image. The source of information is a program specific IPC pattern file whose format is shown below: conf = application_system_name debug = -1, 0-3 max_d = maximum diameter of the associated network module: Name 1 logical_name : type In_or_Out physical_info comment module: Name 2 module: Name n This information must be accessible as global variables by other functions in LIL. The main objective for these data structures is to maintain the relations between user defined logical data objects and their runtime locations. A typical implementation would be to use either dynamic memories or static arrays. Note that the logical name of the execution image is obtained from an environment variable: CNF MODULE. The generation of the IPC pattern file and the definition of CNF_MODULE are all due to the Configurator (static processor allocation) or DPC (dynamic processor allocation) . b) int cnf_open(user_defined_object_ name) This is a generic open function for all types of objects. It performs preparation for a given data object for future access. For example, if the object is a sequential file, it opens the file and records the file descriptor. If the object is a tuple space, it then creates necessary data structures for future connection needs. An integer, referred to as an object handle, is returned as the result of this call. This integer points to the entry of the internal data structure and should be used in all subsequent calls concerning this object. The function returns -1 if the normal open acti¬ vities cannot be completed successfully. c) void cnf_close(user_defined_object_name) This is also a generic function. It closes a user defined object by shutting down communication links and/or file descriptors associated with the object. d) int cnf_fread(object_handle, buffer, size) This function performs an input operation for a given file. The output is placed in a "buffer" with maximum size "size". The actual number of bytes is returned at completion. The file may reside on a different computer than the underlying process. The function must communi¬ cate with the appropriate daemon using the results obtained from cnf_open. e) int cnf_fwrite(object_handle, buffer, size) This function writes "size" bytes in "buffer" to the actual runtime storage pointed by the handle. The actual number of bytes written is returned at completion. This file may also be located in a different host (according to the IPC pattern file) . The results obtained in cnf_open is used here. f) int cnf_fseek(object_handle, offset, direction) This function changes the current read pointer for the given handle. Similar considerations should be given to remote files. It returns -1 if an EOF is encountered, returns 0 if BOF and 1 otherwise. g) int cnf_mread(object_handle, buffer, size, sync) This function reads information from the run¬ time device pointed by the handle and places it in "buf¬ fer". When "sync" = 0, the read is asynchronous and when "sync" = 1 synchronous. The actual number of bytes read is returned at completion. Note that this function should always read a local IPC structure, such as a message queue for UNIX system V derivatives, a FIFO for BSD based systems or a mailbox for VMS systems. h) int cnf__mwrite(object handle, buffer, size, sync) This function writes "size" bytes from "buffer" to the given object. According to the IPC pattern, this write may be a local or remote operation. Note that if the IPC pattern indicates that the receiver is on a remote computer, this function must communicate with a remote dynamic daemon whose functions is to relay the information from . this function (of the sender module) to a local IPC structure on the receiver computer. Otherwise, thiε function writes directly to a local IPC structure. The actual number of bytes written to the receiver is returned at completion. i) int cnf tsread(object handle, key, key size, buffer, buffer_size, sync) If "sync" = 1 this tuple space read function may wait for the tuple with desired key to arrive and reads the information to "buffer" when the tuple is present. Otherwise, the function performs a read and the control returns immediately. The actual number of bytes read is returned at completion. Note that "key" contains a tuple search pat¬ tern. A regular expression match is performed by the dynamic tuple space daemon upon request. The location and port number of the dynamic daemon is obtained from the cnf open function. If more than one tuple match "key" an arbitrary tuple will be chosen. j) int cnf tsget(object handle, key, key size, buffer, buffer_size, sync) This function acts similarly as cnf tsread provided that the matched tuple is extracted from the tuple space upon the completion of the operation. If more than one tuple match "key" an arbitrary tuple will be chosen. k) int cnf tsput(object handle, key, key size, buffer, buffer_size) This function inserts a tuple "key" with con¬ tent in "buffer" to a tuple space. The location of the tuple space daemon is found in the IPC pattern file. The actual number of bytes written to the space is returned at completion. 1) void cnf_term This function closes all objects that are not yet closed and terminates the underlying program with status "1". As mentioned earlier, the user may define new object types with new operations to be used as a distri¬ buted IPC medium, such as a distributed database, know- ledgebase, etc. The operations can be very different from above but the spirit of implementation should be the same as described for network transparent programming (or HLVC programming) . Finally, LIL should be supplied to application programmers in an object library form such that only necessary functions will be linked to an application program before producing an executable. There may be many communication protocols opera¬ ting in a large heterogeneous computer network. With the present system, the communication protocol that is required for a particular application is not a concern of the operator at compilation time. Computers which understand different communication protocols cannot directly exchange information. However, some computers may support a number of communication protocols. Such a computer can serve as a bridge for information exchanges between different computers in a large network. The runtime overhead of this implementation is proportional to the number of different communication protocols usable in one operating system. Similarly, different computers having compilers of different languages can be used independently with the language injections. But the process must be linked with LIL for execution. The overhead of this solution is equivalent to the overhead of any multi-language inter¬ face. Hierarchical HLVC Construction Figure 13 is a diagram illustrating numerous vir¬ tual computers arranged hierarchically. Each level 100, 102, 104 and 106 represents an abstraction which may be embodied in any number of computers anywhere in the world. Each level 100 ... 106 comprises Device (DEV) , Module (MDL) or Group (GRP) computing tasks previously referred to as software chips. The various levels are in a hierarchical relationship; that is, the virtual com¬ puter with software chips at level 100 manipulates data at a higher level of generality than the computer having software chips at 102, which in turn operates at a higher level of generality than the software chips at levels 104 and 106. To give a concrete example, level 100 may be comprised of all the software chips of all of the finan¬ cial and accounting planning for a large corporation. Within the general planning of the large corporation may be a number of divisions or departments, each with its own system of accounting; personnel, inventory, produc¬ tion, etc. The company may be divided not only by department but geographically as well; a New York office and a Philadelphia office may have inventory and person¬ nel departments of their own. On even lower levels, individual managers within a department at a location may operate their own virtual computers, these computers having direct access to data files on very low levels. Examples of very low levels in the computer hierarchy would be a data file on one employee within one depart- ent at one location, or the inventory file for one particular part produced at a particular location by a particular department. By "levels of generality" is meant that virtual computers at higher levels will not be interested in the details of production, personnel, etc. many levels further down, but only in the data (or information) the lower levels produce. The idea of a hierarchical HLVC construction is that data will be decentralized and kept closest to the managers who use it most often. In a corporation having several thousand people, it is probably not necessary for a central office to have duplicates of the personnel files of every janitor. However, computers at higher levels of general¬ ity may well be interested in information such as aggre- gate personnel data for all geographical locations, or aggregate information about all of the departments at a particular location. It is common in the computerization of businesses that various equipment will be purchased at different times, and therefore be of different designs. However, it would be expensive to transfer all of the data from other departments or locations into a new computer whenever a new computer is purchased in the company. If two companies merge, it may be impractical to merge large quantities of data throughout the two merged corporations into a uniform system having one operating system and one language. Occasionally, it may be desired to request data from an external source. The present invention enables the coordination of numerous computers at various levels of generality without having to alter the programs within the various computers themselves, or to waste space with unnecessary duplication of data at different levels. Looking at Figure 13, consider level 100 to be a top management level in a corporation, level 106 to represent the computer at a personnel office at a partic- ular location, and modules 1, 2 and 3, shown below level 106, to represent personnel files of three individual employees at that location. Depending on the chosen structure of the hierarchy, level 102 could be considered to represent personnel for all locations, or all depart¬ ments at the geographical location associated with level 102. With the present invention, a user at level 100 could access the individual files at modules 1, 2 and 3, and even process the data in the modules with instruc¬ tions at level 102 (for examples, health insurance premiums or income tax) for printout at level 100. Thus, information may be retrieved at 106, processed at 102 and read out at 100; thereby yielding a completely decentral- ized virtual computer. The key advantage of decentrali¬ zation is that the information in modules 1, 2, and 3 can be updated by a user at level 106, who presumably would have close contact with the employees. This update could be accomplished, without having to go through the higher level 102, 104 or 100. In Figure 13, the various levels 100, 102, 104, and 106 each represent a virtual computer. With each virtual computer are a number of software chips, which may or may not be embodied within the same physical computer. In the hierarchies possible with the present invention, there are several types of software chips, the modules (MDL) , the groups (GRP) , and the slave programs, not shown. There are also devices (DEV) , such as the ter¬ minal shown in level 100, which do not have a software function, except to act as a terminal, printer, or other device. The modules MDL are independently-running software programs, which exist at the bottom terminus of a hierarchy, whether the level in the hierarchy is toward the top, as is level 100, or at the bottom as is level 106. The group GRP software chips operate at a higher level of generality than the modules, and access data from modules, as shown in phantom. Within each level, the various software chips are related into a virtual computer by any number of interface data objects 110 which are generally shown. These data objects 110 are the means by which data may be transferred among the software chips in the virtual computer, such as by tuple space or mailboxes. The interface data objects 110 exist not only between software chips within a level but between software chips on different levels, as shown. The system of the present invention enables such a hierarchy to be practically realized in a heterogenous computing environment. With decentralization, hierarchies can be automati- cally organized and changed at will by simply reorganiz¬ ing the access of various computers to other computers. A high-level computer is really defined as a computer with access to all of the abstracted data in the network, while a low-level computer would be one without access to higher level data. This hierarchical arrangement has much less overhead than, for example, a monolithic tuple space, wherein all of the information in a corporation is theoretically available in an enormous pool. If a large number of computers are sharing a single pool of data, a number of serious problems are created. First, in order to provide security and create a hierarchy of computers, just about every piece of information in the tuple space must be accessed by a security code, thus considerably increasing the overhead. Secondly, long scanning periods would be required for finding a particular piece of data and organization of data in a meaningful way (e.g., by department among various geographical locations, or all departments within a geographical location) would be difficult to manage. Further, it is likely that this necessary coding and classifying of data in the large pool of a tuple space would be beyond the physical capacity of most computers. With the present invention, data may be shared among a large number of computers, but the data is actually stored generally only in the com- puter wherein it is used most often. However, higher- level computers are able to access data stored in lower- level computers. It should now be appreciated that the first embodi¬ ment of the present invention, illustrated in Figures 1- 13, provides a system that creates high-level virtual computers, (HLVC's) from among a set of heterogeneous computers each of which may have various languages, communication protocols and operating systems. A second embodiment of the present invention particularly suited for accommodating computation intensive functions may be described with reference to Figures 14-23. The second embodiment is configured in a manner similar to that of Figure 6. The system for executing the computation intensive application programs, to be described with reference to Figures 14-23, comprised the host computer 10 and the target computers WSl, WS2, ... WSk as well as the application console of Figure 14 to be described. HLVC For Computation Intensive Programs The second embodiment, primarily through the addi¬ tion of the application console and program enhancements to the configurator and distributed process controller, drastically reduces the amount of effort needed by user to perform program parallelization. The present inven- tion provides a high level interface for the user which is particularly suited to accommodating computation intensive programs. The second embodiment provides means for enhancing known parallel processing (PAR) techniques adapted to these computation intensive programs. The multiple heterogeneous computers, previously discussed, cooperatively interact to reduce the execution time of these computation intensive programs. The PAR processes of the present invention, includes the previously men- tioned three types of distributed parallelism, which are SIMD (SAG) , MIMD and pipeline illustrated in Figure 21 to be described. The means for facilitating these parallel (PAR) processing operations and for reducing the neces¬ sary effort by the user is shown in Figure 14. The block diagram of Figure 14 is different from the block diagram of the first embodiment shown in Figure 3, in that the blocks CSL and CESL of Figure 3 are merely illustrated in Figure 14 as control lines 202 and 204, respectively, emanating to and from the application console 206. The application console 206 further has a control line 208 indicated as Activating User System. Figure 14 illustrates various elements, more fully shown on their related Figure, some of which are comprised of various components indicated by corresponding letter symbols, and all of which are shown in Table 1. TABLE 1 Element Nomenclature Related Figure 206 application console 18 210 distributed application configuration 18 210A configurator (cis compiler) 16 210B Node.Cap 15 210C X.Prcd 17 212 process development 18 212A language injection library (LIL) 19 212B distributed function library (DFL) 20 214 user program 19 214A conventional compiler library 214B other user programs — 216 user process 19 218 distributed application execution 18 218A distributed process controller (DPC) 23 218B runtime daemon library 15, 22 NodeCapd Daemon The NodeCap 210B is a file containing information from a CESL specification of the first embodiment. Figure 15 illustrates nodecap daemon (NODECAPD) 210E comprised of NODECAP 210B and an additional file 210D (NET CTL.DAT) which supplies the NODECAPD with the multiple network information. (NODECAPD) 210E of Figure 15 is added to the daemon library for maintaining the accuracy of NodeCap file. It periodically monitors the computers (WSl ... WSk) and validates any entry made into the NODECAP file 210B. Figure 15 shows a typical task performed by the NODECAPD 210E that receives information from the files 210D and 210B. This task periodically checks for identification within the networks (as shown in 210D of Figure 15) and then waits (sleeps) for a duration specified in Delta (see 210D) before rechecking for this same information. The NODECAPD exchanges information with the remote com¬ mand interpretor daemon (RCID) , to be described with reference to Figure 22, both of which control the ex¬ change of information between the host computer 10 and the computers WSl ... WSk. Note that NodeCap file is essential to the processor allocation tasks in CSL compiler and DPC. Configurator For Computation Intensive Programs The configurator of Figure 16 is similar to the previously discussed configurator of Figure 4 with the exceptions that the network specification, shown in Figure 16, is supplied from the NODECAP of Figure 15. Since the Application Console is a window-based inter¬ face, such as a commercially available x-window, a graphic data collection program may be used to record the information normally obtained from the CESL specifica¬ tion. Further, the module shells and IPC patterns of Figure 4 are merged into one file: X.Prcd (Figure 17) . This facilitates the management of auxiliary file for multiple applications. Precedence Information File: X.Prcd Figure 17 illustrates the format of the application precedence (X.PRCD) file. It contains two groups of information: (a) application sub-program interdependen- cies and (b) individual sub-program information, such as type, input/output ports, direction, runtime, and physi¬ cal connection. Each sub-program (or process) can be of type PAR (parallel processing) , MDL (a module) or GRP (a sub¬ system) . The input/output port information may be incomplete when X.Prcd is generated by the CSL compiler. This implies that DPC is going to fill in the missing pieces before starting the user's program. Application Console The application console (AC) 206 provides the operator with a high level interface for having program¬ ming tasks performed by the network of Figure 6. By "high level" it is meant that the user may command execution of a program by merely moving the so-called mouse device and pressing the buttons. The application console 206 provides the integrated means for controlling and monitoring the performance of the application pro¬ grams being executed by the network. The application console comprises a data entry device, a virtual key- board, and a monitoring device virtual display. The application console 206 is best implemented by the distributed window systems, such as the X-Windows (MIT) , Open-Look (Sun Micro Systems) and NeXT windows (NeXT computer) . The application console 206 may be considered as a virtual computer device that allows itself to be shared for multiple distributed applications being ac¬ complished within the network of Figure 6 at the same time. The application console 206 provides the integrated interface between the user and the programming tasks components of the high-level virtual computer shown in Figure 18 as comprising; (1) process development 212; (2) distributed application configuration 210; (3) distri- buted application execution 218; and (4) distributed application maintenance 220. The distributed application maintenance 220 is comprised of software routines and monitoring means that allow for the so called debugging of the application pro- grams related to the present invention. The debugging means are primarily used during the development phase of the application programs. In general, these means preferably include debugging and performance analysis tools that allow a user to view, in a static manner, selected programming segments of the application pro¬ grams. Normally, all debugging and performance monitor¬ ing data is collected during the execution of an applica¬ tion program and analyzed afterwards. The distributed application maintenance 220 tasks allows the parallel process computations such as SAG, pipeline and MIMD, as well as the software chips DEV, GRP and MDL previously discussed, to be viewed by a user and recorded for analysis purposes. The application console 206 also allows the user to perform process development 212 utilizing the language injection library (LIL) and the distributed function library (DFL) functions which may be described with reference to Figure 19 showing distributed functions which are embedded in a user process. Figure 19 illus- trates the components of the programmed software (LIL and DFL) that are integrated into the user program to operate in the network computers (host computer 10 and WSl ... WSk of Figure 6) . This integration provides the routines to operate the application software functions related to the present invention, especially the software of the computation intensive programs. User Program Figure 19 further illustrates that the user program 214 is supplied with information from the language inter- jection library (LIL) , previously discussed, and the distributed function library (DFL) . The LIL supplies the operations to the (IPC) data objects, some of which are shown in Figure 19 as cnf_open whereas, the DFL supplies routines for the computation intensive programs such as a known ray-tracing program; FRACTAL calculation program, to be described with reference to Figure 20. A user program 214 having the appropriate routines (to be described) are contained within each of the computers (host computer 10 and WSl ... WSk) of the network of Figure 6. After the routines, in the form of macro instruc¬ tions, of the DFL and the LIL are loaded or placed into the user program 214 within the associated computer (10, WSl ... WSk) , then the user program 214 is merged with the codes of linker 214C, and also the codes of a conven¬ tional compiler runtime library 214A. The compiler in each computer (10, WSl ... WSk) cooperates with its respective operating system in a manner as described with reference to Figure 6 of the operating systems of the computers (10, WSl — WSk) of the network of Figure 6. The linking (object code 214B, linker 214 and compiler 214A) produces an executable user program 216 operating within the respective computers (10, WSl ... WSk) and whose runtime relations are determined by the remote com¬ mand interrupt daemon (RCID) of Figure 21 and the distri¬ buted process controller (DCP) of Figure 23. In general, the RCID supplies the initialization information (obtained from DPC) to the user program 216 to allow it to perform its assigned tasks, whereas, the user process 216 after the completion of its assigned task supplies the final results to the DCP by means of commands such as that shown in Figure 19 as being Termin¬ ation (cnf_term) . The computation intensive programs, such as FRACTAL, being run by the user process 216 in each computer (10; WSl ... WSk) may be described with further reference to the DFL illustrated in Figure 20. Distributed Function Library The distributed function library (DFL) is comprised of three segments: (1) DFL Table. (DFLJTB) 212B1; (2) DFL Driver (DFL_DR) 212B2; and (3) DFL Subroutine (DFL_SUB) 212B3. The interaction between the segments 212B2 and 212B3 produces the distributed data 222 shown as com¬ prising 222A (Coords); 222B (IDX) ; 222C (Fl) ; 222D (F2) ; 222E (F3) ; and 222F (F4) . Figure 20 illustrates that the segment DFL__TB is referenced by the distributed process controller (DPC) (Figure 23) for processor (10, WSl ... WSk) assignment; DFL_DR is referenced by the user programs to be included in the executable body (Figure 19) ; the distributed data 222 is created by both the DPC programs of Figure 23 and the RCID programs of Figure 22; and the DFL_SUB is used by the DPC (Figure 23) to create the runtime workers to be described. Figure 20 uses the letter symbols A, B, and N to show the commonality between the program segments of DFL TB, DFL_DR, DFL_SUB and the distributed data 22. For example, the symbol A is used to show the commonality of the FRACTAL program illustrated in: (i) (DFLJTB) within the confines of the box A; (ii) (DFL_DR) within the confines of box A; and (iii) (DFL_SUB) within its box A. The subscript for the symbol A is similarly used for the distributed data 222 (Coords) A 2 and (IDX) A 2 . The distributed function library of Figure 20 is particularly suited for performing the computation inten¬ sive programs by means of parallel processing (PAR) . A PAR process uses the multiple heterogeneous computers discussed with regard to Figure 6 and which computers cooperate with each other to reduce the execution time of the computation intensive programs. The interface with each of the user programs contain within each of the computers of Figure 6 is provided by the routines of the distributed function library shown in Figure 20. The PAR processes primarily related to the present invention are the SIMD (SAG) ; MIMD; and pipeline techniques all of which are known in the computer art. An abbreviated description of the FRACTAL program performed by the PAR type: SAG is given in Table 2. TABLE 2 DISTRIBUTED FUNCTION LIBRARY (DFL. FRACTAL PROGRAM Segment DFLJTB (A) Name: FRACTAL Par Type: SAG Data Bases: Coords, IDX Relative CPU Powers: wsl:l ws2:1.5 ws3:3.6 DFL_DR (A) FRACTAL (image, x,y) - Pack coords to grains - Insert to tuple space "Coords" - Wait results from "IDX" - Assemble results - Return DFL_SUB (A) FRACTAL_wk: - Wait on "Coords" - Extract tuples - Compute - Insert results to "IDX" - Loop until no more tuples DISTRIBUTED DATA - Coords (A χ ) - IDX (A 2 ) In general, the DFLJTB is a table or file contained within the host computer 10 of Figure 6 and lists the parameters of the data buses that establish the com¬ munications between the computers (10, WSl ... WSk) of Figure 6. The DFLJTB also lists the relative power of the computers WSl, WS2, ... WSk for the main calculation routine. The DFL_DR contains the driver routines that controls and directs the interaction between the host computer 10 and the working computers (WSl WSk) for performing the computation intensive program, such as, the FRACTAL program. The DFL_SUB are the subroutines contained within each of the worker computers (WSl ... WSk) that computes the selected portion of the FRACTAL program being performed in WSl ... WSk and exchanges the intermediate and final results of each such computation with the host computer so as to provide the cooperating solution of the FRACTAL program. The distributed data 222 (Coords and IDX) are exchanged as blocks of data between working computers WSl ... WSk and the host computer 10. The operation of the FRACTAL computer accomplished by the SAG type parallel processing may be further described with reference to Figure 21. Distributed Parallelism Processing Figure 21 functionally illustrates three types of distributed parallelism processing which are (1) SIMD (SAG) ; (2) MIMD; and (3) pipeline which are respectively illustrated in Figure 21(a); Figure 21(b); and Figure 21(c). Figure 21(a) functionally illustrates, by means of directional arrows shown in phantom, the interaction between the host computer 10 and the working computers (WSl ... WSk) involved with the performance of the FRACTAL program generally illustrated in Table 2. Figure 21(a) illustrates that the host computer 10 contains programming segments 212B1 and 212B2, discussed with regard to Figure 20, and also that each of the working computers (WSl ... WSk) contains the programming segment 212B3 also of Figure 20. The host computer 10 is shown to embody a Scatter and Gather (SAG) Process and two tuple spaces TS(1) and TS(2). Functionally, the SAG process places the tuples related to the FRACTAL program into TS(1) for distribution to (scatter) the working computers (WSl ... WSk) . The working computers place the . results to TS(2) to be gathered by the SAG process. The segmentation of the tuples in the host computer 10 and the working computers (WSl ... WSk) may be as described in "Parallelizing 'Scatter - And - Gather 1 Applications 5 Using Heterogeneous Network Workstations." by Yuan Shi and Kostas Blathras disclosed at the Proceedings of the Fifth Siam Conference on Parallel Processing for Scien¬ tific Computing held in Houston, Texas in March 1991, and herein incorporated by reference. 10 As illustrated in Figure 20, after each respective working processor WSl ... WSk has performed its computa¬ tions related to its received tuple, the respective result is transferred to the host computer 10 by way of tuple space TS(2). The host computer gathers such 15 information and continues its process until the execution of the FRACTAL program is completed. A computation intensive function could also be accomplished by the parallel process MIMD or pipeline respectively shown in Figures 21(b) and (c) . Figures 21 20 (b) and (c) generally illustrates the principles of operation of the MIMD and pipeline processes. The overall operation of the distributed parallelism proces¬ sing of Figures 21(a), (b) , and (c) may be further described with reference to Figure 14. 25 Overall Operation of Second Embodiment Figure 14, in its lower portions, illustrates that the working computers (WSl, WS2 ... WSk), as well as the host computer 10 shown in phantom, are interconnected by the bus 16. The worker computers (WSl ... WSk) each con- 30. tain the Port ID Management Deamon (PIMD) , previously discussed with reference to Figure 8, and also the Remote Command Interrupt Daemon (RCID) of Figure 22. The daemons (PIMD and RCID) are supplied from the host computer 10 each time the network (10, WSl ... WSk) is updated. The PIMD and RCID daemons perform the chores to coordinate the data exchange between the computers (10, WSl ... WSk) each of which may have a different operating system (OS1, OS2 ... OSk) and a different compiler. The PIMP and RCID daemons are supplied from the runtime daemon library 218b contained in host computer 10. The RCID daemon related to the second embodiment of the present invention is illustrated in Figure 22. Remote Command Interpreter Daemon The Remote Command Interpreter Daemon (RCID) of Figure 22 receives information from the NODECAPD of Figure 15 and from the distributed process controller (DPC) of Figure 23. The DPC is shown as entering Figure 22 from bus 16 and into the program segment (wait for (DPC) ) of the subset (process creation) . A comparison of the RCID of the second embodiment of Figure 22 with the RCID of the first embodiment of Figure 7, reveals that Figure 22 is simplified. The RCID of Figure 22 receives from the DPC, by way of bus 16, a single message that causes the RCID to respond and receive information from the DPC that is used for initialization and external control functions so as to direct the exchange of infor¬ mation within the network of Figure 14. The primary means of controlling and exchanging information, related to the second embodiment of the present invention, is determined by the distributed process controller which is functionally illustrated in Figure 23. Distributed Process Controller Figure 23 illustrates a general flow chart of the distributed process controller (DPC) comprised of seg¬ ments 230, 232 ... 248. The entry (230) into the flow chart is established by the availability of the applica¬ tion precedence (X.Prcd) of Figure 17 which, as previous- ly discussed, is developed by the configurator (CSL compiler) of Figure 16. The command to execute or have the DPC (segment 232) read the X.Prcd is caused by the application console 206 generating the control signal 208 (Activating User System) . The distributed process controller (DPC) of Figure 23 is applicable to three types of processing one of which is the PAR type related to the second embodiment of the present invention and the remaining two of which are the GRP and MDL types previo- usly discussed with regard to the first embodiment. The programming decisions highlights of the PAR type are shown in segment 236, whereas, the programming decision highlights of the MDL and GRP process types are respec¬ tively shown in segments 238 and 240. Each of the segments 236, 238 and 240, as shown in Figure 23, share the programming segments 232, 234, 242. The segment 232, in response to control signal 208, causes the reading of the X.PRCD program and in a manner well known in the art, constructs a dependency matrix with linked process initialization and control informa¬ tion. Upon the completion of segment 232 the step-by- step sequence of Figure 23 sequences to segment 234. Programming segment 234, checks for the type (PAR, GRP or MDL) of process to be performed, and then, sequen- ces to segment 236 for PAR type, to segment 238 for a GRP type, or to segment 240 for a MDL type. The second embodiment of the present invention is primarily related to the PAR process type shown in segment 236. Segment 236 is divided into: (i) the SAG (SIMD) processing, (ii) the pipeline processing, and (iii) the MIMD processing. The SAG (SIMD) processing, previously discussed with regard to Figures 20 and 21a, has program¬ ming highlights illustrated in the top portion of segment 236. The SAG process of segment 236 indicated as SAG (SIMD) parallelizable, performs four functions. The first (a) determines the assignment of the working com¬ puters (WSl ... WSk) to the program (e.g. FRACTAL) being performed. If the process (SAG) has a processor (WSl ... WSk) assigned to it, then, the SAG process uses such, otherwise it searches the information contained in the DFLJTB to determine and then use the most power processor (10, WSl ... WSk). This selected computer is to host the SAG process. The segment 236 then (b) obtains from the DFLJTB table, the function name of the program being performed such as FRACTAL, and obtains the corresponding name of the tuple spaces related to that particular pro¬ gram. The segment 236 then (c) assigns two tuple space daemons, previously described with reference to Figure 11, to the host computer which serves as the calling SAG processor. Finally (d) , the SAG program of segment 236 determines which of working computers WSl ... WSk are assigned to executing the named program (e.g., FRACTAL). Upon completion of (d) , the SAG program sequences to segment 242. Segment 242 supplies all the initialization records to all of the computers (10, WSl ... WSk) within the net¬ work shown in Figure 6, and then starts the execution of the one or more processes previously described with reference to Figures 20 and 21(a). For the process (SAG) being described which uses more than computer (10, WSl ... WSk) , the segment 242 sends executables (programs capable of being executed) to the one or more RCID(s) respectively contained in the one or more working com¬ puters (WSl ... WSk) assigned to execute the SAG process. If the process being performed is being accomplished by only the host computer 10 or a Network File System is in place, then executables are not sent to the RCID. For the SAG process, the executables are sent to the respec¬ tive RCID's which, in turn, initiate the user process 216 of Figure 19. The user process 216 is shown as being included in segment 244 of Figure 23. The user processor 216 then accomplishes its portion of the simultaneous, parallel-processing application, performed and upon its completion, sends the remote termination call comprised of the IPC pattern shown within segment 246. This ter¬ mination call is then routed to the entry location of segment 248 as shown in Figure 23. Segment 248 upon receiving the termination call modifies the previously discussed sequential dependen- cies, and returns the step-by-step progression to segment 234 to await the assignment of its next task whereon the step-by-step progression of segment 236 ... 248 is repeated in response to each received new task. It should now be appreciated that the practice of the present invention provides for a second embodiment that performs parallel processing for computation inten¬ sive programming. The execution of such programming is initiated by the user merely entering in the name of program, e.g., FRACTAL, by way of the application console 206. In the practice of the present invention, it has been estimated that by use of six working processing computer (WSl ... WSk) in cooperating with one host computer 10, reduces the execution time normally taken for a computational intensive program such as FRACTAL by a factor of six times assuming all computers are of equal power. The present invention, described for both the first and second embodiments, may serve as a digital processing system for many applications. One such application is real time signal processors such as those found for radar and sonar applications. Real Time Signal Processors Real time Signal Processors are special purpose computers. Due to the contiguous flow of data, tradi- tionally a pipelines architecture has been used to achieve computation speedup. It is now recognized that all types of parallel structures: MIMD, SIMD and pipe¬ lines, all previously discussed primarily with reference to Figures 14-23, can be used to produce higher perfor¬ mance signal processors. The present invention provides a system and a method for the design and implementation of scalable and customizable signal processors. For such signal processors, multiple homogeneous CPU's, such as those described with reference to Figure 6, with local memories are connected through a high speed bus 16 with multiple I/O ports for peripherals. The size of the local memory should be sufficient to accommodate at least two typical grain real time processes. The grain is the size of a live process. Configurator (CLS compiler) , such as those dis¬ cussed with reference to Figures 4 and 16, may be derived to generate interprocess communication patterns (IPC) , previously discussed, and control data (X.Prcd) adapted to the needs of real time processing. For a signal processor with hard real time requirement, that is, one in which the time measurements must supply absolute (hard) values, the configurator is used to identify the near optimal program partitioning and processor alloca- tion. Once the partition and allocation are found, all pre-partitioned processes are re-coded to form the near optimal partition. All configurator generated IPC patterns and dependency matrixes are hard coded into the optimally partitioned programs. For signal processors with soft (non-absolute) time requirements, the re-coding process may be skipped to reduce labor costs. Real Time Signal Processor Daemons Each processor unit, including a CPU and a local memory, such as those discussed with regard to Figure 6, contains programs that can provide similar functions as RCID and PIMD, similar to those described for Figures 2 and 8, respectively, as well as a minimal function scheduler (First-In-First-Out) . The RCID program in this 5 case is to load real time process routines and attach it to the process list. The PIMD server in this case is to provide the grouping of CPU ID; interrupt vector index; and application port assignments. The minimal function scheduler (FIFO) simply waits at a software interrupt 10 associated with each process list (per CPU) which is to be set by the arrivals of real time processes. The scheduler (FIFO) transfers the control of CPU to the first process on the list. After the completion, the real time process transfers the control to the next 15 process on the list, if any, until the list is empty. Every process occupies the entire CPU from its activation to its termination phases. For real time processing applications, it is preferred that each CPU (10, WSl ... WSk of Figure 6) be dedicated to process the data associ- 20 ated with the input signal sequences. Real Time Signal Processors Distributed Process Controller CDPC) A distributed process controller (DPC) , similar to that described with reference to Figure 23, controls the 25 signal processor for its sub-task coordination according to a X.Prcd similar to that described for Figure 17. It is preferred that the X.Prcd which is particularly suited for real time processing, be arranged to form part of the DPC. Also one of the CPU's (10, WSl ... WSk of Figure 6) 30. should be dedicated to service the DPC. Real Time Signal Processor Tuple Space Daemons Tuple space daemons act as servers operating in each CPU, that receives requests from other CPUs and manipulates the tuples through their local memory. The use of each tuple space server indicates the existence of one virtual vector processor. One CPU should be dedi¬ cated to each tuple space server. The number of dedi- cated tuple space CPUs is determined by the application being preformed by the real time processors. One can form multiple pipelined virtual vector processors using multiple tuple space CPU's (and associated worker CPU's). Real Time Signal Processor Language Injection Library Language Injection Library (LIL) , such as those described with reference to Figure 19, contains pre-pro¬ grammed codes for open/put/get/read/close tuple spaces and open/read/write/close remote communication ports. This library is used in the customization process to determine the near optimal process partition and proces¬ sor allocation of the real time processors. Once the near optimal is found, the injection routines are physi¬ cally included as code segments into the real-time process. For this application, it is preferred that the mailbox daemons, described with reference to Figure 10, also become part of the language injection library (LIL) , thus part of the real time process. Application of Real Time Signal Processing A signal processing application is accomplished by first partitioned to form SIMD, MIMD and pipelined com¬ ponents. The partitioning may be accomplished in a manner as previously mentioned technical article "Paral- lelizing *Scatter-And-Gather' Application Using Hetero¬ geneous Network Workstations." Generally speaking, it has been determined that SIMD components give the best speed advantages and MIMD components can give a fair speed advantage. Pipelines are the least preferred. A SIMD component can be viewed as a Scatter-And-Gather (SAG) element. A "SAGable" computation, as used herein, is a computation that can be transformed into a repeti- tive application of a single sub-task. For example, multiplying two matrices can be transformed into repeated applications of dot products of respective vectors. All existing techniques for vectorization can be employed to identify and maximize the SAGable components. MIMD components come from the dataflow analysis of the signal processing application. Processor assignment should take into account that independent processes can be run on difference CPUs. Finally, pipelines are to be formed by streamlining the dataflow along the most natural order (shortest delay) of the underlying architecture. For best results of pipeline techniques, it is preferred that processor assignment to form stages of similar time delays. It should now be appreciated that the practice of the present invention may be used for real time signal processors. The real time applications may be accomp¬ lished by the parallel processing techniques such as those described herein for SIMD (SAG) , MIMD and pipe¬ lining. The hardware architecture is a simple strea - lined multiprocessor platform which can be scaled into many dimensions to optimize the performance. The proces¬ sor requirements are uniform allowing the use of large quantities of commercially available CPU chips for one signal processor. The present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof and, accordingly, reference should be made to the appended claims, rather than to the foregoing specification, as indicating the scope of the invention.

Claims: CLAIMS 1. A system for execution of an application program including a plurality of sub-programs among a plurality of target computers, comprising: (a) a plurality of target computers, each target computer including (i) at least one communication channel, (ii) memory space accessible through the at least one communication channel, (iii) a library of language injections in the memory space, each language injection being runable by the target computer in response to an external inter¬ processor control command, each language injection being a subroutine facilitating the operation of a pre-defined data object; (b) at least one host computer operatively connected to the plurality of target computers, including (i) means for processing a computing environment specification, the computing environment specification being a set of instructions for activating at least a subset of target computers for accepting data and instructions from the host computer, (ii) means for processing the application program, the application program including at least one sub-program runable on at least one of the subset of target computers, the application program further includ¬ ing at least one interprocessor control command for activating at least one library injection in a target computer, whereby the sub-program may be compiled and executed in any target computer having a compatible compiler without alteration of the sub-program, (iii) means for transferring the sub¬ program from the at least one host computer to at least one target computer for compilation and execution in the target computer in response to a signal from the host computer. 2. A system as in claim 1, having language injections adapted for the operation in one or more target computers of a mailbox mechanism. 3. A system as in claim 1, having language injections for operating in the target computers a mechanism for accessing an external file. 4. A system as in claim 1, having language injections for the operation of at least one tuple space among the target computers. 5. A system as in claim 1, having language injections for operation of mailboxes, external files, and tuple spaces among the target computers. 6. A system as in claim 1, wherein the software characteristic of the at least one host computer is embodied within at least one of the plurality of target computers. 7. A system as in claim 1, wherein each target computer further includes a daemon associated with the at least one communication channel, the daemon being a program whereby the at least one communication channel is monitored for an instruction from the host computer, and also for declaring other communication channels in the system for subsequent use in the application program. 8. A system according to claim 1, wherein said application program is adapted for real time processing. 9. A system for the creation of a virtual com¬ puter for execution of an application program including a plurality of sub-programs among at least one host com¬ puter and a plurality of target computers, comprising: a configurator in the host computer, adapted to compile an application software specification, the application software specification being instructions related to the desired execution of individual sub¬ programs at particular target computers; daemon means associated with each target computer, including at least one software loop adapted to branch upon an instruction external to the target com¬ puter to access the target computer, whereby at least one sub-program may be executed in the target computer; a distributed process controller, adapted to activate the daemon means associated with each target computer in response to the application software specifi¬ cation; and a library of language injections in each target computer, each language injection being runable within the target computer in response to an instruction external to the target computer, each language injection being a subroutine facilitating the transference of data among the target computers, whereby a sub-program may be compiled and executed in any target computer having a compatible compiler without alteration of the sub-pro¬ gram. 10. A system as in claim 9, wherein the language injection library includes software means adapted to create daemons incidental to the execution of an applica¬ tion program, whereby data is transferred among a plural¬ ity of target computers. 11. A system as in claim 10, wherein the software means adapted to create daemons incidental to the execu¬ tion of an application program include means for creating a mailbox. 12. A system as in claim 10, wherein the software means adapted to create daemons incidental to the execu¬ tion of an application program include means for the creation of a tuple space. 13. A system as in claim 9, wherein a subset of the target computers require name abstraction and another subset of the target computers require port abstraction, further including means for reconciling port abstraction and name abstraction among the target computers. 14. A system according to claim 9, wherein said application program is adapted for real time processing. 15. A method of executing an application program having a plurality of sub-programs to be executed among a plurality of target computers, comprising the steps of: entering into a host computer the application program, including interprocessor commands related to desired target computers for the execution of various sub-programs; providing within each target computer daemon means, comprising at least one software loop adapted to branch upon an external instruction, thereby permitting a sub-program to be loaded into the target computer for compilation and execution within the target computer; providing within each target computer a language injection library, comprising a plurality of subroutines runable by the target computer and adapted to facilitate the transference of data among target com¬ puters without alteration of the sub-program, the sub¬ routines being executed in response to interprocessor commands. 16. A method as in claim 15, further comprising the step of causing the host computer to send an instruc¬ tion to at least one target computer, thereby activating the daemon means in the target computer and causing at least one subroutine in the language injection library to be executed by the target computer. 17. A method as in claim 16, further comprising the step of creating, by means of activating at least one subroutine in the language injection library of at least one target computer, a mailbox. 18. A method as in claim 14, further comprising the step of creating, by means of at least one subroutine from the language injection library of at least one target computer, a tuple space. 19. A method as in claim 15, wherein said applica¬ tion program is adapted for real time processing. 20. A system for execution of a computational intensive application program including a plurality of subprograms among a plurality of target computers, comprising: (a) a data entry device; (b) a plurality of target computers, each computer including: (i) at least one communication channel, (ii) memory space accessible through the at least one communication channel, (iii) a library of language injections in the memory space, each interjection serving as a routine for controlling data in said plurality of target computers, (iv) a distributed function library in said memory space that cooperates with said interjections of said library of language injections, said distributed function library comprising subroutines for computational intensive programs serving as said application programs to be executed by said system, said computation intensive programs and said cooperating injections both being initiated for execution by said data entry device; and (c) at least one computer operatively con¬ nected to the plurality of target computers, including: (i) means for processing a computer environmental specification, the computer environmental specification being a set of instructions for activating at least a subset of target computers for accepting data and instructions from the host computer. (ii) means for processing the computa¬ tional intensive application programs, the computation intensive application programs including at least one sub-program runable on at least one of the subset of target computers, whereby the at least one sub-program of said computational intensive programs may be compiled and executed in any target computer having a compatible com¬ piler without altering the contents thereof, (iii) means for transferring the sub¬ program of the computational intensive application program from the at least one host computer to at least one target computer for compilation and execution in the target computer in response to a command signal from said data entry device. 21. A system according to claim 20, wherein computation intensive application program is adapted for real time processing.

Inventors: SHI YUAN, SHI, YUAN
Applicants: UNIV TEMPLE, TEMPLE UNIVERSITY - OF THE COMMONWEALTH SYSTEM OF
Application year: 1991
Main classification: G06F9
IPC codes: G06F9, G06F15