Abstract: The present invention relates to a method for message delivery from a sender process to a receiver process within a computer system, comprising performing an atomic check for the receiver process and a parent of the receiver process, returning a first status of the receiver process and a second status of the parent of the receiver process based on the atomic check, and delivering the message according to the first status and the second status, wherein the first status and the second status stay unchanged during the atomic check.

Abstract: Various embodiments provide for a layered approach to developing operating system platform components such as a color management system. This can be accomplished by providing new functionality and by utilizing an existing API module comprising existing APIs to receive input that can be associated with either current functionality, legacy functionality, or the new functionality. Furthermore, a rule-based module conceptually located below the operating system's existing public API module can be used to determine the appropriate processing functionality for the received input—which can then be processed accordingly.

Abstract: Techniques are described for providing enhanced interactions with software services, such as when executing software programs use remote software services. For example, if a software program is executing on a first computing system and using remote services provided by one or more other computing systems, one or more local software proxies may be executed on the first computing system to represent the remote services. The software program may interact in a common manner with the local software proxies, while each local software proxy may interact with its corresponding remote service in a manner specific to that remote service and transparent to the software program. Furthermore, a local software proxy may facilitate software program testing, such as by interacting with a local copy of a remote service rather than the actual remote service during testing and/or by emulating asynchronous message interactions with a remote service during testing.

Abstract: An application programming interface (API) that leverages operating system instrumentation to provide a chain of threads and processes may alleviate some debugging complications. Specifically, the chain may start with the first thread in the process that experienced the original failure and end with the last thread upon which the first thread directly or indirectly depends. The API may aid debugging efforts by classifying all threads related or dependent upon an original failed thread into specific categories of failures, requesting further information from the originating OS concerning specific failed threads, and using that information to debug the failed application or process more thoroughly.

Abstract: Software processes are automated by storing predetermined responses and recognizing the screens of server and/or web-based applications that require data to continue operating.

Abstract: A virtual execution environment for software applications and other code objects. In one implementation, the present invention allows for virtual execution of applications by transparently capturing the rendered output of natively executed applications, and delivering the output to other processes on the same platform or to remote devices in a platform agnostic manner.

Abstract: Approaches for transparently interfacing with a third party version control system (VCS) are provided. In one approach, an enterprise application integration (EAI) system comprises an integrated development environment (IDE) client, a repository, an API, and an API implementation. The IDE client enables a user to develop one or more functional components that can be used or executed to derive one or more enterprise application functionalities. The repository interacts with the IDE client to save and access the one or more functional components. The API is invoked by the repository to interact with any VCS. The API implementation enables the repository, by way of invoking the API, to interact with a VCS, which is an external VCS that is not provided as part of the EAI system.

Abstract: A computer implemented method, apparatus, and computer program product for a checkpoint process associated with a device driver in a workload partitioned environment. In response to initiation of a checkpoint process, a stream is frozen. The stream comprises a set of kernel modules driving a device. Freezing the stream prevents any module in the set of kernel modules from sending any messages, other than a checkpoint message, to another module in the set of kernel modules. The message block for each module in the set of kernel modules is updated with internal data to form a restart message. The internal data is data describing a state of the module in the set of kernel modules.

Abstract: Input/output (I/O) operation requests from pageable storage mode guests are interpreted without host intervention. In a pageable mode virtual environment, requests issued by pageable storage mode guests are processed by one or more processors of the environment absent intervention from one or more hosts of the environment. Processing of the requests includes manipulating, by at least one processor on behalf of the guests, buffer state information stored in host storage. The manipulating is performed via instructions initiated by the guests and processed by one or more of the processors.

Abstract: Methods and apparatus consistent with the invention provide the ability to organize and build understandings of machine data generated by a variety of information-processing environments. Machine data is a product of information-processing systems (e.g., activity logs, configuration files, messages, database records) and represents the evidence of particular events that have taken place and been recorded in raw data format. In one embodiment, machine data is turned into a machine data web by organizing machine data into events and then linking events together.

Abstract: Techniques for performing a multi-level patching operation are described. According to one such technique, before a particular patch is applied, the data containers that are targeted by the particular patch are identified. A determination is made as to whether any of these target data containers already has been targeted by any previously applied patch. A determination also is made as to whether any other data container that contains (immediately or otherwise) any of the target data containers already has been targeted by any previously applied patch. If any target data container or any other data container that contains a target data container already has been targeted by a previously applied patch, then the particular patch is not applied to the target data containers.

Abstract: An approach is provided for proactive notification of contract changes in a software service. According to the approach, when the executable code of a composite application operable to access the service is generated, an initial copy of a contract that describes the service is retrieved. A baseline representation of the contract is generated based on the initial copy of the contract. When the composite application is being executed, a determination is made based on the baseline representation whether the contract has experienced any changes. In response to determining that the contract has experienced a change, a notification is sent indicating that the contract has experienced the change.

Abstract: Computer method and apparatus for connection tree routing in visual modeling of software is disclosed. Tree routing style is represented as a property of a subject connection. A router object manages location of bendpoints of the subject connection in a connection tree. The subject connection maintains an end node as its target instead of a trunk element of the connection tree. The router object is formed of a hierarchy of routers including branch routers, tree routers and forest routers. Different routers maintain different aspects of the tree data forming display of the connection tree.

Abstract: An embodiment generally relates to a method of increasing efficiency in a dynamic linker. The method includes determining a length of a source string and a check segment of the source string and selecting a candidate string from a plurality of strings. The method also includes determining a candidate check segment of the candidate string based on the length of the source string and verifying the source string and the candidate string are identical in response to the check segment of the source string being identical to candidate check segment.

Abstract: Data communications, including issuing, by an application program to a high level data communications library, a request for initialization of a data communications service; issuing to a low level data communications library a request for registration of data communications functions; registering the data communications functions, including instantiating a factory object for each of the one or more data communications functions; issuing by the application program an instruction to execute a designated data communications function; issuing, to the low level data communications library, an instruction to execute the designated data communications function, including passing to the low level data communications library a call parameter that identifies a factory object; creating with the identified factory object the data communications object that implements the data communications function according to the protocol; and executing by the low level data communications library the designated data communications fu

Abstract: An application is monitored to identify different execution paths, e.g., sequences of invoked components, which occur due to the receipt of messages by the application. Similarities between the execution paths are determined based on a distance algorithm, in one approach, and execution paths which are similar are assigned to a common group. Additionally, application runtime data such as response times is obtained for the execution paths and aggregated for the group. The messages can also be grouped based on the grouping of the execution paths. Further, a representative execution path can be determined for each execution path group for comparison to subsequent execution paths. A representative message can similarly be determined for each message group. Results can be reported which include a group identifier, representative message, representative execution path, count, and aggregated runtime data.

Abstract: A software installation checker is disclosed. A small stub application is put inside a desktop package, and is run at certain points during a software installation. The stub contacts a server and fetches a library which comprises a class with a method. The stub runs the method on the class, passing to the class the information as well as the server. The class unpacks an engine and passes control to the engine. The engine runs a check with tasks received from a collector of the server. Data is uploaded to the server, and can be examined via a web interface.

Abstract: Techniques are provided for efficiently processing SOAP requests at a Web service application (WSA) of a multi-functional device (MFP). In one technique, a WSA includes at least three threads. An external request processing thread processes SOAP requests from different client applications. A request processing thread processes a SOAP request according to the business logic of the WSA. A internal communications thread communicates with other components of the MFP that are distinct from the WSA. In another technique, a WSA processes different SOAP request differently, depending on the size of the SOAP and the resources required to process the SOAP request so that fast requests may be processed immediately while slow requests are pending. In another technique, a WS-Eventing specification is implemented within a WSA to simplify the event subscription and notification process.

Abstract: Role search apparatus for grouping nodes according to relationships with other nodes, the apparatus comprising: an input for receiving an arrangement of nodes said arrangement comprising at least two partitions of said nodes and with predetermined relationships between nodes across said partitions, and a pattern recognition unit associated with said input, for using pattern recognition on said nodes and said relationships to find relationship patterns amongst said nodes, thereby to form at least one group from nodes of a first of said partitions, wherein said nodes being formed into said group share relationships with same ones of a predetermined number of nodes in a second partition.

Abstract: In an information processing device adapted for performing an application program, a displaying unit causes a display device to display information related to a state transition of the application program. A generation unit receives an input updating request for updating information related to a displayed state transition, and generates an application program which realizes a state transition according to the updating request.