Abstract: A system and method provides for variable target outputs from a compiler with only a single execution. The compiler includes a front end, a generic back end, and plurality of individual back ends that are dynamically loaded by the compiler during execution. The front end produces an abstract syntax tree which is then processed by the generic back end and the individual back ends to produce a number of back end trees, each adapted for a specific back end, and representative of the desired structure of the various target outputs, including target code files, or events. The generic back end traverses the abstract syntax tree, and on each node of the tree, invokes each back end that has a node of its back end tree attached thereto. The back end can then modify its own back end tree, and attach further back end nodes to other nodes of the abstract syntax tree.

Abstract: In an information processing system running under two different operating systems (OS), a job entry unit enters a control program of a job, which is executed by the second operating system, via the first operating system. A language conversion/transfer unit converts the control program into a program for the second operating system, and transfers it to the second operating system. A data conversion/transfer unit mutually performs conversion and a transfer between files used for the first operating system and files used for the second operating system. A job execution unit executes the program for the second operating system using transferred data included in the files used for the second operating system. Thus, a user can execute the job without being conscious of differences between the operating systems.

Abstract: There is disclosed a multi-processor system arranged, in one embodiment, as an image and graphics processor. The processor is structured with several individual processors all having communication links to several memories. The individual processors can, on a cycle by cycle basis, be grouped in any configuration to run in synchronism (but from different instruction streams) with the other processors in that group. More than one such synchronized group can be formed concurrently. A crossbar switch serves to establish the processor memory links and the entire image processor, including the individual processors, the crossbar switch and the memories are contained on a single silicon chip.

Abstract: A system and method for remote software installation and maintenance. A number of workstations are connected by a network. Each has basic peer-to-peer communication ability providing remote file transfer and remote command execution. An arbitrarily selected workstation captures user installation requirements and controls installation and maintenance processing. Task lists are selected based upon requirements and the steps of the task list are executed locally, or remotely, to satisfy the installation or maintenance requirement. Task list process is logged so that processing may be resumed following a failure or intentional suspension.

Abstract: An application integration architecture (MO) for a data processing platform (PL) constituted by a network (RE) of machines running a plurality of heterogeneous applications (APA), the codes of which are not modifiable and each of which includes a plurality of external interfaces (IE), characterized in that, for the purpose of modifying the basic characteristics of these applications in a way that is transparent to the user, it comprises:a) an ergonomic integration module (MIG) for the centralized control of the applications with a graphical interface (GI),b) an operational continuity module (MCF) which executes actions to prevent them from operating abnormally,c) a module (MSC) for intercepting the dialogues between the components in order to ensure their logical security and the accounting of the resources consumed by the user.

Abstract: A computer system provides multiple unprotected applications direct access to a slave processor. The host processor issues context switching requests to save and restore partially completed unprotected requests in the slave processor.

Abstract: An arbitration procedure allowing processes and their associated processors to perform useful work while they have pending service requests for access to shared resources within a multi-processor system environment. The arbitration procedure of the present invention is implemented within a multi-processor system (e.g., a symmetric multi-processor system) wherein multiple processes can simultaneously request "locks" which control access to shared resources such that access to these shared resources are globally synchronized among the many processes. Rather than assigning arbitration to the operating system, the present invention provides an arbitration procedure that is application-specific. This arbitration process provides a reservation mechanism for contending processes such that any given process only requests a lock call to the operating system when a lock is available for that process, thereby avoiding spinlock by the operating system.

Abstract: A method and system for generating a computer program. In a preferred embodiment, the present invention provides a program tree editor for directly manipulating a program tree. A program tree comprises of plurality of nodes corresponding to computational constructs. The program tree editor receives commands from a user that are independent of a programming language syntax. The present invention also provides a display representation generator for generating a display representation of the program tree. The display representation generator retrieves nodes from the program tree and displays a display representation of the node. A user of the present invention preferably interacts with the program tree editor based on the display representation.

Abstract: A method and apparatus are provided for processing programmed input/output (PIO) operations in a computer system. A batched list of PIO operations is stored in a buffer. Then the batched list of PIO operations is moved as a single system bus operation to an I/O bus interface unit. The I/O bus interface unit includes sequencer logic. The sequencer logic is used for executing the batched list of PIO operations and for providing an ordered sequence of PIO operations to a system I/O bus. The method and apparatus of the invention enhances the use of non-intelligent I/O adapters in a computer system by reducing the overhead of system PIO operations. Also the correctly ordered sequence of PIO commands provided by the sequencer logic facilitates the use of non-intelligent I/O adapters in reduced instruction-set computer (RISC) systems.

Abstract: Apparatus and accompanying methods for optimally using available computer resources, illustratively processing time, and which can be advantageously used for selecting task(s) instances to be precomputed during idle time as well as during other periods of processing activity. Specifically, at an onset of each idle-time interval, processing time is allocated to precompute during the remainder of that interval a future task instance, from among a group of such instances then available for precomputation, that will provide the highest fixed or incremental utility. For those task instances which exhibit constant or varying value with time, task selection is based on maximum probability of future occurrence, or net expected value (NEV), respectively, of each such instance. NEV is evaluated as a product of the task instance probability multiplied by a rate of change in the value (EVC flux) to be provided by that task with continued computation time, respectively.

Abstract: A method and system are provided for executing a service processor request within a data processing system having one or more processors within a central processing complex, each of the processors within the central processing complex including allocatable processor resources. Each of the processors within the central processing complex is provided with the capability of processing selected service processor requests by reserving a portion of the allocatable processor resources within each of the processors for such purpose. A service processor request within the central processing complex is initially processed utilizing at least one of the processors in response to receiving a service processor request, if sufficient processor resources are available to process the service processor request within the reserved portion of the allocatable resources.

Abstract: A method of selecting a process to run within a multi-processor computer system in which the processors are arranged in nodes defined by node buses. A global run queue for queuing unaffined processes of the computer system is provided. A nodal run queue for each node bus of the computer system is provided. Highest priority levels in the global run queue is determined by one of the processors. Highest priority levels in the nodal run queue of the one processor is determined by the one processor. A process having a highest priority within the highest priority levels of the global and nodal run queues is determined by the processor. Finally, the process is executed by the one processor. Only when the processor finishes searching the global run queue and its nodal run queue for a process to run and does not find one, does it search within other nodal run queues that are found to be busy.

Abstract: A virtual machine system comprised of a real machine having a virtual machine control monitor including an initial program loading emulation part and a virtual machine and an outer memory connected to the real machine. A virtual machine assist mechanism is provided in the real machine for offering a control mechanism of the virtual machine by firmware. At an initial program loading stage, when an input-output substitutional generation command is generated at the initial program loading emulation part in the virtual machine control monitor, an actual data transmission is executed from the outer memory to the area of the virtual machine, as if an input-output request were generated at the virtual machine. In addition, an input-output interruption after the execution of data transmission is transferred from the outer memory to the virtual machine assist mechanism by the control of the input-output substitutional generation command.

Abstract: Aspects of the invention include a method of conducting a reduced length search along a search path. A node which would otherwise occur between a previous and a following node in the search path is eliminated, and information is stored as to whether, had said eliminated node been present, the search would have proceeded to the following node. During the search, a search argument is compared with the stored information, and the search effectively progresses from the previous node directly to the following node if the comparison is positive. In preferred embodiments, some nodes provide result values for the search, and a node is eliminated only if its presence would not affect the result value for the search. In another aspect, the invention features a method of conducting a two mode search of reduced length. For a first mode of the search, nodes along a search path are provided, at least some of the nodes including one or more pointers pointing to other nodes.

Abstract: Description tables can be linked to a kernel to form a device driver. The description tables can be device description tables and adapter description tables. The kernel is operating system dependent. The description tables are operating system independent and can be linked to other kernels for other operating systems. A library of kernels for different operating systems can share a common set of kernel requests.

Abstract: A method and means for handling events in a computer system which occur during the execution of programs including routines prepared in a plurality of computer programming languages is described. The number and identity of each unique computer programming language used in the preparation of the program is determined using a language list contained in the application program. A unique event handling means (event handler) is initialized for each unique computer programming language used in the program. As the program executes selected events of interest to the event handlers are detected. The parameters associated with the selected event are determined. Optionally the detected events may be divided into two types: broadcast or targeted. Broadcast events are sent to all event handlers (except the debug event handler), whereas, the targeted events are sent to a single event handler.

Abstract: The present invention is a system and method to avoid static variable initialization and reference conflicts in a multi-threaded computer system. There are four major problems that arise with computer programs containing static variable references and static variable initializations on a computer system with a multi-threaded operating system: (1) premature references made on an uninitialized static variable; (2) side effects caused by initialization competition among threads; (3) multiple initialization of the same static variable; and (4) server control of static variable reference and initialization. Each of these four problems is eliminated by the system and method of this invention. The invention operates by locking the CPU during identification of the first thread seeking to initiate a static variable operation, maintaining all other threads in a wait state, and unlocking the CPU thus releasing the waiting threads from their wait state.

Abstract: The invention allows the participation of a resource manager in a transaction which is coordinated by a transaction manager with which the resource manager's protocols are not compatible. More particularly, a mapper records a connection reference which the application program obtains from the resource manager and a transaction reference which the application program obtains from the transaction manager. The resource manager stores recovery information in an associated log file.

Abstract: An in-band/out-of-band alert delivery system for a computer system manager includes an alert log which maintains a record of alerts to be delivered and the status of those alerts, an alert manager for making a first atop to deliver each alert, and a retry manager for making subsequent attempt to deliver alerts as becomes necessary and appropriate. The alert delivery system may also include a bus master interface manager for making in-band alert deliveries and a communications manager for making out-of-band alert deliveries. Telephone numbers are provided to the communications manager by an alert destination list. Out-of-band alert deliveries nay be made via a modem, a universal asynchronous receiver transmitter, or the like.

Abstract: Methods for allowing a user to customize an interface for a computer program are provided. The methods allow a user of the computer program flexibility in organizing commands into a menu structure. The methods also allow a user of a computer program to assign a keystroke sequence to a command. The user can then invoke the command by entering the keystroke sequence. A command assigned to a keystroke sequence does not need to be associated with a menu. The methods allow the user of a computer program to predefine parameters for commands. The predefinition allows the user to invoke a command without reentering the parameters. In a preferred embodiments, the methods use a command array that contains an entry for each command. The methods use an array associated with each menu. The arrays contain unique identifiers of the commands that are associated with the menu. These unique identifiers are used to reference entries into the command array.