Abstract: Access to a shareable resource between threads is controlled by a lock having shared, optimistic and exclusive modes and maintaining a list of threads requesting ownership of said lock. A shared optimistic mode is provided. A lock state descriptor is provided for each desired change of mode comprising a current mode in which a thread has already acquired the lock. When a thread acquires the lock in shared optimistic mode, other threads are allowed to acquire the lock in shared or optimistic mode. When a thread which acquired the lock in shared optimistic mode wants to acquire the lock in exclusive mode, other threads which have acquired the lock in shared or optimistic mode are prevented from acquiring the lock in exclusive mode until the thread which acquired the lock in shared optimistic mode and requested to acquire the lock in exclusive mode releases the lock.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for obtaining data specifying a plurality of native applications for a particular resource; generating, for each of the native applications, a respective corresponding deeplink for the native application, wherein selection of the respective deeplink causes the native application to display a display environment comprising the particular resource; ranking the respective deeplinks based on a respective rank score for each native application to which the respective deeplink corresponds; and generating metadata that associates the respective deeplinks and their corresponding rankings with the particular resource.

Abstract: Examples may include a host computing platform having a multi-core processor capable of supporting a host operating system and a plurality of virtual machines (VMs). Support may include processing elements or cores for the multi-core processor being capable of separately supporting individual VMs. The individual VMs may be capable of executing separate applications used to process packets for a service chain flow. In some examples, techniques for routing the packets for the service chain flow between the individual VMs may include distributing at least some switch logic between the individual VMs.

Abstract: Methods and system for interface data utilization are described. In one embodiment, source interface data may be provided from a provider. The source interface data may be capable of being used to provide a source user interface for a networked resource associated with the provider. A user request may be received through the source user interface. A service call may be provided over a network to an application based on the receiving of the user request. The application may be associated with an application manager. Response data may be received over the network from the application based on the service call. Target interface data may be rendered based on the response data. The target interface data may be provided from the provider.

Abstract: In one embodiment, a method is provided that includes designating a visual representation of an object in a display screen of a human machine interface, accessing any properties, connections, and text associated with the object in response to a trigger event, and creating an identical copy in response to the trigger event, wherein the identical copy includes any properties, connections and text associated with the object. An interface system that includes a machine readable medium having programming code implementing the method. An industrial automation device is also provided.

Abstract: Embodiments described herein provide recovery placeholders within an application. Specifically, one approach includes providing an application operating on a client device, and generating a recovery placeholder that defines a current state of the application by analyzing a queue containing a set of messages, and identifying one or more selected events corresponding to the application from the queue. In one approach, the current state defines, at the time the recovery placeholder is generated, at least one of: a position within a window of the application, a current activity of the application, a position of the window within a display of a display device, and a placement order of the window of the application in relation to a stack of other cascaded windows. At a later point in time, the application may then be restored to the current state by accessing the recovery placeholder to replay the one or more selected events.

Abstract: There is disclosed a method and system for processing transactions requested by an application in a distributed computer system. The computer system includes at least one resource comprising a plurality of storage areas each with an associated resource manager, or a plurality of resources each comprising at least one storage area with an associated resource manager, the storage areas holding the same tables as each other. There is also provided a transaction manager that is linked, by way of either a network or a local application programming interface (API), to each of the resource managers, the transaction manager being configured to coordinate transaction prepare and commit cycles.

Abstract: A terminal device passes data between programs. The terminal device includes a data passing unit configured to receive the data from a first program and pass the received data to a second program selected from among one or more second programs associated with a type of the received data; the first program configured to convert the type of the data, which is a passing target, from an original type into a unique type, and then pass the data to the data passing unit; and the second program configured to convert the type of the data received from the data passing unit into the original type from the unique type, the second program being associated with the unique type.

Abstract: A method and apparatus of a device that changes the importance of a daemon process is described. In an exemplary embodiment, the device receives a message from a user process destined for daemon process, wherein the daemon process executes independently of the user process and the first daemon process communicates messages with other executing processes. The device further determines if the first message indicates that the importance of the first daemon process can be changed. If the first message indicates the importance of the first daemon process can be changed, the device changes the importance of the first daemon process. The device additionally forwards the first message to the first daemon process.

Abstract: Described are techniques for selecting resources for provisioning. A usage definition, including a piecewise objective function, and first set of logical profiles based on core criteria are selected. Each of the logical profiles in the first set represents a resource set characterized by a core criteria value set that specifies values for the core criteria. A second set of resulting objective function values are determined by evaluating one piece of the objective function for each of the logical profiles in the first set. A highest ranked one of the resulting objective function values in the second set is selected having a corresponding first logical profile of the first set and a corresponding core criteria value set. A third set of resources is selected which is characterized by the corresponding core criteria value set for the first logical profile. The third set of resources is any of recommended or selected for provisioning.

Abstract: A graph processing system includes a graph API (Application Program Interface), as executed on a processor of a computer and as capable of implementing any of a plurality of graph operators to express computations of input graph analytics applications. A run-time system, executed by the processor, implements graph operators specified by each graph API function and deploys the implemented graph operators to a selected computing system. A library contains multiple implementations for each graph API function, each implementation predetermined as being optimal for a specific set of conditions met by a graph being processed, for functional capabilities of a specific computing system on which the graph is being processed, and for resources available on that specific computing system.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to response subscriptions and provide a method, system and computer program product for response tracking across social networks. In one embodiment of the invention, a social networking response tracking method can be provided. The method can be performed by client-side logic and can include associating subscribers with a user or a group of users based upon a posting by the user or a user in the group of users within a client computing device for the user, aggregating different postings from the user to correspondingly different forums disposed about a global computer communications network, and, notifying the subscribers of the aggregated postings.

Abstract: Technologies are described herein for redirecting service calls via endpoint overrides in a service-oriented system. A request is received for a service implemented in the service-oriented system. The request is then analyzed to identify a service key for the requested service. A service endpoint is obtained for the requested service using the service key from a configuration file. The request is further analyzed to determine if an override endpoint for the requested service is provided. If the request contains the override endpoint, a service call to the service identified by the override endpoint is invoked. Otherwise, the service specified by the service endpoint is called for the requested service.

Abstract: A virtual computer system includes: a plurality of computers on which at least one virtual computer operates on a hypervisor; and a management computer that manages the plurality of computers, wherein the management computer includes: an input unit that accepts an operation input of an operator; a screen generation unit that acquires, in a state where a first virtual computer operates on a first computer, progress information concerning a live migration in which the first virtual computer is transferred from the first computer to a second computer, the progress information being acquired from the first computer, that generates statistical information concerning the live migration on the basis of the acquired progress information, and that generates a statistics screen containing the statistical information; and an output unit that displays the statistics screen.

Abstract: A computing device for state transitions of recursive state machines and a computer-implemented method for the definition, design and deployment of domain recursive state machines for computing devices of that type; such devices are intended for the simulation of large systems involving human and automated components, particularly the type generally called “Enterprise Applications”; such devices are also applicable to a much wider range of fields, such as cognitive modelling or robotics. The commonality between the computing device and the computer-implemented method is the Subject Predicate Object Protocol (SPOP) which is used to capture instructions by the computer-implemented method for the definition, design and deployment of recursive state machines and also is the protocol used by the computing device for state transitions of recursive state machines to communicate inbound and outbound events based on the captured instructions.

Abstract: A method for manipulating a hardware device using a layered device driver is discussed. An application may submit an instruction to an application driver component operating in user space. The instruction may be transmitted from the application driver component to an interface driver component operating in kernel space. The instruction may be transmitted again to a physical driver component, which thereafter manipulates a hardware component in accordance with the instruction.

Abstract: In an event processing system, a service level required for event processing is satisfied. A node information acquisition unit 110 acquires node information which includes information related to a connection destination node and performance information, from each of a plurality of nodes. Each of the plurality of nodes transfers an event or an event processing result to another connected node according to a transfer path. A node and path determination unit 120 determines a combination of an event processing node which is a node to perform the event processing and the transfer path from a source node from which an event is transmitted to a destination node to which an event processing result is transmitted, through one or more nodes including the event processing node, in such a way to satisfy a specified service level, on the basis of the node information.

Abstract: The invention refers to tightly coupled multiprocessor distributed computing systems. The proposed solution enables to develop distributed applications as usual monolithic applications with use of typical compilers and builders. These applications support complicated logic of interaction between elements executed in different nodes and, at that, have limited complexity of development. The invention determines requirements to a distributed application and a method of its execution, memory organization and system node interaction manner.

Abstract: The I/O performance measurement unit of Hypervisor measures latencies of I/O process requests to virtual disks, and reports the average value of the latencies to the I/O performance information collection unit of the management server. The provision destination determination unit sets, as a storage unit to which a virtual disk is to be allocated, that is a storage unit having the smallest average value of the latencies among storage units to which virtual disks have been provided.

Abstract: A computer implemented method, system and product for transferring information between systems of record connected to a bus comprising generating an event in response a change in a system of record of the systems of record; transforming the change event into a generic event at an adapter for the system of record, wherein the adapter is communicatively coupled to the system of record and the bus; conveying the generic event to the bus from the adapter; reasoning on the generic event to determine if at least some information of the generic event should be propagated to another system of record; based on a positive determination, using a policy based system of record information filter to determine what information of the event to send to the another system of record, and propagating at least some of the information of the generic event in a new event to another adapter communicatively coupled to the another system of record; and translating the new event, at the adapter, to an event able to be understood by the