Abstract: A graphical user interface for monitoring a job executing on a remote host system from a local workstation by displaying a tree view of the system, a queue within the system, a job within the queue, and a file related to the job. The graphical user interface displays the tree view; displays a first level of the tree, the first level comprising one or more system nodes, each system node representing a host system; displays a second level of the tree, the second level comprising one or more job queue nodes, each job queue node branching below a system node representing a job queue in the host system corresponding to the system node; and displays a third level of the tree, the third level comprising one or more job nodes, each job node branching below a job queue node representing a job in the job queue corresponding to the job queue node.

Abstract: A user interface for configuring connections from a local workstation between a file system residing on the local workstation and a file system residing on a remote host system. The interface provides for such configuration by allowing the user to specify the host system, specify a host directory path within the host file system, and specify a mapping between a file within the host directory path on the host file system and a file on the local file system. After such configuration, the user may access the host file system file in the same manner as a local file system file.

Abstract: A communication infrastructure providing communication between agents, between agents and agent-hosting servers, and between agent-hosting servers. The communication infrastructure consists of three layers (from bottom to top): Mail Facility Layer, Message Facility Layer, and Agent Management Communication Facility Layer. The Mail Facility Layer is the lowest layer providing a general, semantics-free mail paradigm for asynchronous communication between distributed objects, whether they are local or remote to each other. The Mail Facility Layer provides a level of abstraction in terms of mail, virtual mailbox, post office, and mail queue, and hides the details of implementation and actual transport. It is designed to provide location transparency and to be implementable using various transport protocols. The next Message Facility Layer provides a typed messaging paradigm for asynchronous and synchronous message passing between distributed objects.

Abstract: A fast and efficient way of performing global value numbering beyond basic blocks and extended basic blocks on a complete topological ordering of basic blocks in a program. Global value numbering makes use of an unknown value number and iterative processing of a worklist containing expressions assigned an unknown value number. A hash table is used to reduce storage and processing time.

Abstract: A method for re-executing a process on a computer system is described wherein said process includes a number of activities which are executed by said computer system according to a workflow graph. Each of said activities requires for its execution at least one work item incarnation from another one of said activities, and each of said activities creates at least one work item incarnation to be used by another one of said activities. The method comprises the steps of a) identifying by a user one of said activities to be faulty and correcting it, b) evaluating by said computer system those ones of said activities which are influenced by said faulty activity with the help of said at least one work item incarnation created by said faulty activity, and c) executing by said computer system said corrected faulty activity and said evaluated activities according to said workflow graph.

Abstract: When displaying the caller stack of a distributed client/server program that uses Remote Procedure Calls (RPC), the user is provided the capability of viewing the RPC calls in the same manner as normal procedure calls. When a breakpoint is encountered in an RPC server program while using a debugger for distributed programs, the call stacks for the client and server program are appended together into a single distributed call stack. In the case of nested RPC calls (e.g. program A executes an RPC call to program B which executes an RPC call to C and so on) all of the call stacks are appended together in the order they were created. The distributed call stack may span many programs, threads of execution, and computing machines. The distributed call stack may be used to select a routine from the call stack when setting a context for a tool that displays program state information.

Abstract: When displaying the caller stack of a distributed client/server program that uses Remote Procedure Calls (RPC), the user is provided the capability of viewing the RPC calls in the same manner as normal procedure calls. When a breakpoint is encountered in an RPC server program while using a debugger for distributed programs, the call stacks for the client and server program are appended together into a single distributed call stack. In the case of nested RPC calls (e.g. program A executes an RPC call to program B which executes an RPC call to C and so on) all of the call stacks are appended together in the order they were created. The distributed call stack may span many programs, threads of execution, and computing machines. The distributed call stack may be used to select a routine from the call stack when setting a context for a tool that displays program state information.

Abstract: A method and system are provided for controlling the access objects in an object oriented data processing application, where the objects are being hierarchically structured and either locally available or retrievable from an external unit. Each object has a dependent object counter which indicates the existence or the number of dependent objects associated with that object. When at least one dependent object is not locally available, a dummy object is appended to that object, enabling the object expansion even if the dependent objects of the selected object are not yet locally available in local memory. The objects to be retrieved from the external unit are locked from user access, while access is allowed to the locally available dependent objects.

Abstract: A graphical user interface for mapping and accessing objects in data stores is disclosed. A user may define a mapping between object schema and data store schema by use of a high level language, Schema Mapping Definition Language (SMDL), which is data store independent, object oriented language independent, and extensible. The user may either write SMDL directly or generate SMDL through the use of a graphical user interface Smart Schema whose graphical semantics support the SMDL semantics. A Schema Mapping Internal Representation (SMIR) containing representations of the object schema, the data store schema, and the mapping of the object schema and the data store schema is generated by an SMDL Parser from the SMDL. The SMIR is represented such that it may be accessible by both development interfaces and run-time environments.

Abstract: A method is described for allowing data to be transferred in parallel over several input/output channels simultaneously. When a file is opened within an application program, a system library routine tasked with allocating input/output channels checks to see if multiple channels have been defined by control commands separate from the application. If the multiple channels have been so defined, the driver will open multiple channels for data transfer in a manner independent of the application. Existing applications can use this technique to perform striped input/output without requiring modification.

Abstract: A computer-based multimedia presentation system is provided with a synchronization scheme for recording and playing independent media. The disclosed system and method allows media processes and single medium processes to achieve and maintain synchronization with each other without process interdependence and without interprocess communication. This capability is provided by assigning a common clock for all processes, requiring all participating media processes to reference the common clock, informing each process of, a synchronization basepoint called a "zero-time", and then allowing each process to independently synchronize itself to the common clock. The common clock itself does not provide any stimulus to a media process; it is a passive component in the synchronization. The media process is the active component, referring to the common clock as required to maintain synchronization for the particular media it is handling.