Abstract: A method and system for managing computer program execution is implemented in a set of callable run-time support services which allow processes written in single or multiple languages to cooperate and behave in a predictable and orderly manner. Three key program execution constructs are defined: process, enclave, and thread. The process is the highest level construct of the program execution. It consists of one or more enclaves. The enclave defines the scope of execution semantics defined by the high level languages. This includes the scope of application termination and the scope of name resolution for shared data, files and procedures. The enclave consists of one or more threads. The thread is the basic program execution unit with its own state of execution. A thread may execute concurrently with other threads. A thread may consist of a series of call invocations of procedures. These procedures may be written in different high level languages.

Abstract: A system for developing tests of a System Under Test (SUT) which includes a Central Processing Unit (CPU), a screen and input apparatus. The system for developing tests includes a manipulation apparatus enabling an operator to manipulate, within a test workspace, a sequence of test script statements into a desired script, wherein the test script statements describe operator commands to the SUT and screen capture and verify operations and b) interactive execution apparatus for executing at least a portion of the desired script by providing the at least a portion of the desired script to the SUT thereby to operate the SUT as desired.

Abstract: A computer system supports the application of a function supplied by the Operating System (OS) or a utility program. A generating section generates system operation information including job execution history information and file access history information. In accordance with the system operation information, a determining section determines a job or job step to which the function can be applied. In response to a notice from the determining section, a converting section converts an original job control program or job into new job control programs or jobs, and outputs the new job control programs or jobs.

Abstract: A method and an apparatus for reconciling communication and locality by enabling a user/programmer to write programs in an extended procedural language which explicitly manipulate locality. The multiprocessor includes a plurality of processing elements connected to each other each processing element having a unique address and including a central processing unit for executing local CPU code and reading and writing local data and a locality manager for controlling data movement between processing elements which are cooperating on a single task by executing local locality manager code which indicates when shared data can be released and when non-local data is requested.

Abstract: A method for storing device drivers in the adapter region of a computer's address space includes the step of providing a plurality of headers and associating each header with a device driver to be loaded and initialized. Each header includes instructions for loading and initializing its associated device driver. Further, each header includes information for identifying the address next following its device driver. The method further includes the step of storing the plurality of device drivers and their corresponding headers in an address space having addresses that are sequential. Further, each header is stored in an address space having addresses that are sequential with the addresses of the address space occupied by its corresponding device driver. A method is also disclosed for loading the plurality of device drivers stored in the manner discussed above.

Abstract: A programmable computer which operates by executing rules, each including a rule name, and optionally: input parameters, a set of conditions, a set of actions associated with each condition, and a set of exception handlers. A condition is a logical expression which evaluates to a true or false boolean value, while an action is an executable statement. An exception handler contains executable statements.The computer includes text entry and display means for programming of rules. A rule is displayed with each condition and each action having a row of text. The computer generates a yes/no quadrant into which a programmer may enter sequence numbers, to associate ordered sets of actions with individual conditions. Sequence numbers may be entered not associated with any condition, to define a set of default actions.Upon entering a rule, the computer sequentially evaluates the rule's conditions.

Abstract: The present invention is a method, system and process for automatically customizing a computer environment based on the current active computer disk directory. Detection of the current active disk directory and any change of disk directory by a user triggers a search for a file that initiates the computer environment. Upon detection of the file, the system reconfigures the operating system to meet the user's requirements based on the disk directory.

Abstract: In one aspect, a software development technique is capable of efficiently organizing for execution a conditional code segment having multiple associated conditional paths. The development technique employs in association with each path of the code segment, a probability compiler directive which dictates to the compiler a probability for satisfying a conditional test of the associated path. In another aspect, a system/process is capable of optimizing organization of assembled program code for a code's particular execution environment. This optimization approach tunes assembled code organization for each specific execution environment, employing run-time based statistical data collected during performance execution of the assembled code. The execution environment, consisting of hardware, software, and other factors such as workload, input data, etc., can also be collected and employed by an optimizer unit to best reorganize the assembled program code for a current execution environment.

Abstract: The present invention provides methods for allocating physical registers within a compiler phase to achieve efficient operation of a target CPU. The methods of the present invention allocate variables between physical registers and memory to accommodate local as well as global code structure. Such methods facilitate the location of variables that are heavily accessed at a portion of the code in a physical register during the execution thereof.

Abstract: An archive command detects an original storage device density value from the device and changes the device's density to a ROM density required by system ROM to read a bootstrap image. The bootstrap image from the system, as well as the original density value stored in a density file, are then written to the storage media in the ROM density required for system restoration by the IPL. The system then reads its copy of the original density value, changes the storage device parameters to their original value, and writes the desired additional system image or other software to the device media in the original device density. When restoration of the thus-archived bootstrap image or other software is required, during system IPL the system ROM will read the bootstrap file from the media stored in the correct ROM density required by the system ROM.

Abstract: A method and system for managing the connection of client components to an interface implemented by a server component. In a preferred embodiment, a user component provides an implementation of an interface and a description of the interface. A component manager aggregates the user component into itself to form a server component. When a client requests a connection to the interface, the component manager retrieves a reference to the interface from the user component and sends the reference to the client components. In a preferred embodiment, the component manager tracks the client components connected through an interface. A user component may also provide multiple interfaces to client components which the component manager also tracks.

Abstract: An object-oriented data processing system performs a desired processing based upon an object model including a plurality of objects each formed of data and methods.

Abstract: When a data-parallel language like Fortran 90 is compiled for a distributed-memory machine, aggregate data objects (such as arrays) are distributed across the processor memories. The mapping determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. A common approach is to break the mapping into two stages: first, an alignment that maps all the objects to an abstract template, and then a distribution that maps the template to the processors. This disclosure deals with two facets of the problem of finding alignments that reduce residual communication; namely, alignments that vary in loops, and objects that permit of replicated alignments. It is shown that loop-dependent dynamic alignment is sometimes necessary for optimum performance, and algorithms are provided so that a compiler can determine good dynamic alignments for objects within "do" loops.

Abstract: The present invention provides a non-stop data processing system having an online data backup function. The method according to the present invention is a data backup method for a computer system having a central processing unit for performing multitask processing, a multiple memory constituted by a plurality of memory devices for online storing data processed by tasks of the central processing unit, and a data backup memory for saving data of the multiple memory, wherein the central processing unit performs parallel processing of (a) user task(s) to treat usual work between the central processing unit and the multiple memory and a maintenance task to save data online from memory devices as a part of the multiple memory to the data backup memory.

Abstract: A programmable timer circuit is comprised of a programmable timer counter for receiving a count and for counting to the count. A clock signal for driving the timer counter which timer counter generates a signal representative of the count. A microprocessor generates count data in response to programming of the microprocessor. Timer data register receive the count from microprocessor. A first gate is provided having an enabled mode and an non-enabled mode for enabling loading of the timer data from the timer data register to the timer counter input only in the enabled mode. A monitoring circuit is provided for monitoring the timer count and enabling the gate mean to the enabled mode only when the timer has time-out.

Abstract: A job execution prediction control method and apparatus in a computer system having a CPU. Information on processing amounts of a plurality of parallelly executed jobs is collected during execution of the respective jobs. Predicted execution end times of the respective jobs are calculated on the basis of the collected information. Subsequent processing speeds of the respective jobs are controlled on the basis of the predicted execution end times calculated for the respective jobs and target execution end times of the respective jobs.

Abstract: In a support system for software development implemented on a computer, a file input/output distinction related to a utility whose program can not be analyzed is preliminarily registered in the support system, job control language which is the subject of automatic production of a job flow specification is input, the job control language and a source program are analyzed and basic job flow information is produced. A job flow specification is automatically produced by deriving a file input/output distinction from a load module name in the input job control language and one of source program analysis information corresponding thereto, utility information and job control language analysis information.

Abstract: In a method for increasing the functionality of a computer program, use is made of a computer system comprising a user/terminal which via driver modules is connectible to a computer program. When the user/terminal requests execution of the computer program, the user/terminal is connected intially to a wrapper program via an additional driver module. After data exchange between the wrapper program and the user/terminal, the computer program is started from the wrapper program. Finally, the wrapper program is disconnected, and the computer program is connected to the user/terminal.

Abstract: In a production system in which a plurality of production rules are partitioned into a plurality of clusters for processing to effect cluster control, control expression elements, each describing an instruction for specifying a cluster to be invoked next for execution or an instruction for other flow control, are arranged in the order of execution to provide a control expression part separate from the clusters for processing. An instruction for a return to the control expression part is described in an action part of an appropriate production rule in a cluster, in place of the cluster specifying instruction, so that sequential invocation of clusters can be performed following the instructions described in the control expression part, thereby making it unnecessary to give a description for specifying the name of a cluster to be invoked next for execution in the action part of each production rule.

Abstract: A method and system for generating a rules-based computer program employs an interactive workstation to display input data format screens. These screens are edited on the workstation to define the formats of all permissible items of input data to the program and the formats are stored. The workstation then displays rule entry screens in decision table format on which the program designer defines the rules relating to the processing of associated input data items. The completed decision tables are stored and together with the stored input data formats are compiled to produce computer program code for run-time execution or interpretation.