Abstract: An embodiment of the invention provides a method to determine relationships between entities where an interface receives a first data set representing observations of a first entity and observations of a second entity, and a second data set representing a relationship between the first entity and the second entity. An entity analytics engine applies a first candidate rule to the first data set to generate a first candidate relationship between the first entity and the second entity. A processor determines whether according to a criterion the first candidate relationship matches the relationship represented in the second data set. The entity analytics engine replaces the first candidate rule with a second candidate rule by when the first candidate relationship does not match the relationship represented in the second data set.

Abstract: An embodiment of the invention provides a method for determining relationships between physical entities, where one or more of the physical entities is associated with static feature(s) and changeable feature(s). An entity analytics engine determines that a first physical entity and a second physical entity may be in a relationship with a third physical entity based on a first rule and a first set of observations. The first rule is applicable to one or more static features of the first physical entity, the second physical entity, and the third physical entity. The first rule provides that the first physical entity and the second physical entity may be in a relationship with the third physical entity when the third physical entity includes one or more static features that are within a threshold degree of similarity to static features of the first physical entity and the second physical entity.

Abstract: A motion processing analysis method, system, and computer program product include selecting a first spatial graticule size, determining that a physical entity is associated with a first spatial graticule during a first timeframe and that the physical entity is associated with a second spatial graticule during a second timeframe, as a result of determining that the physical entity is associated with the first spatial graticule during the first timeframe and that the physical entity is associated with the second spatial graticule during the second timeframe, adding to a sum, determining that the sum is beyond an acceptable range, and as a result of determining that the sum beyond the acceptable range, selecting a second spatial graticule size.

Abstract: A computer-implemented distributed data processing method for a software application that includes no code that targets a distributed data processing system, the method including in a first process executing a first software component on a first computer, establishing a reference to at least a second software component resident on a second computer, establishing a handler in a second process executing on the second computer, determining that the first process is attempting to invoke a routine of the second software component based on the handler, and transferring data from the first process to the second process.

Abstract: A virtual memory management method, system, and computer program product at a first machine, receiving a request to access memory associated with a virtual address, at the first machine, initiating a translation of the virtual address to a logical address, during the translation of the virtual address to the logical address, determining that a machine identifier corresponds to a second machine, communicating the request to access the memory to the second machine, and at the second machine, fulfilling the memory access request.

Abstract: A resource sharing method, system, and computer program product in a distributed computing environment, includes in response to a first condition, determining a first node on which an access rate of a synchronization object is greatest, storing the synchronization object on the first node for use in synchronizing access to a resource, and in response to a second condition, determining a second node on which an access rate of the synchronization object is greatest, and relocating the synchronization object from a storage on the first node to a storage on the second node.

Abstract: A memory management method, system, and computer program product include receiving a request to allocate a block of memory including a first portion to be accessed by a first software component executing on a first computer and second portion to be accessed by a second software component executing on a second computer, allocating the block of memory and additional bytes including a first identifier of the first portion, a first status indicator associated with the first portion, a second identifier of the second portion, and a second status indicator associated with the second portion, initializing the first status indicator and the second status indicator, and making the block of memory available to the first software component and the second software component.

Abstract: A cloud resource protection method, system, and computer program product include authenticating a user on a first computer that is part of a distributed system, based on the authentication, assigning to the user, on the first computer, a token indicating a set of permissions, receiving a directive from the user to initiate, via the first computer, the execution of a process associated with a class, based on the token, initiating, on a second computer, the execution of the process, with no further authentication, granting the process access to a data set, access to which is restricted to one or more of the plurality of classes, and providing a data item from the data set to the user.

Abstract: A computer-implemented distributed data processing method for a software application that includes no code that targets a distributed data processing system, the method including in a. first process executing a first software component on a first computer, establishing a reference to at least a second software component resident on a second computer, establishing a handler in a second process executing on the second computer, determining that the first process is attempting to invoke a routine of the second software component based on the handler, and transferring data from the first process to the second process.

Abstract: A resource sharing method, system, and computer program product in a distributed computing environment, includes in response to a first condition, determining a first node on which an access rate of a synchronization object is greatest, storing the synchronization object on the first node for use in synchronizing access to a resource, and in response to a second condition, determining a second node on which an access rate of the synchronization object is greatest, and relocating the synchronization object from a storage on the first node to a storage on the second node.

Abstract: Systems and methods of enhancing computing performance may provide for detecting a request to acquire a lock associated with a shared resource in a multi-threaded execution environment. A determination may be made as to whether to grant the request based on a context-based lock condition. In one example, the context-based lock condition includes a lock redundancy component and an execution context component.

Abstract: A computer-implemented distributed data processing method for a software application that includes no code that targets a distributed data processing system, the method comprising: executing a software application that has been designed with a single-node operation to operate in a distributed fashion by automatically arranging for components of the software application to execute across a plurality of nodes.

Abstract: Aspects of the present disclosure relate to associating chat history with versions of software development artifacts such as source code files. A version of an artifact is identified. The identified version is analyzed by a natural language processor to determine a set of features associated with the version. The set of features associated with the version is compared to a portion of chat history. Based on the comparison, a match certainty is calculated. In response to the calculated match certainty satisfying a match certainty threshold, a determination is made that the version and the portion of chat history correspond. In response to the determination that the version and portion of chat history correspond, an association between the version and the portion of chat history is stored.

Abstract: Embodiments for profiling an instance of a computing program distributed across a plurality of nodes in a distributed computing environment. First call data, comprising one or more parameters passed to a first function executing on a first node, may be collected within an instance of a computing application. Second call data, comprising one or more parameters passed to a second function executing on a second node, may be collected within an instance of a computing application. The first call data and the second call data may be compared such that the comparison is provided via one or more call graphs representing the instance.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for classifying entities. Data representing an observation of an entity is received. One or more features of the entity are identified. A first classification for the entity is assigned based on the identified features, and a best fit analysis of the identified features to existing classifications. In response to identifying one or more additional features of the entity and determining that the identified additional features meet an update criterion, or in response to determining that the identified features meet an update criterion based on a modified best fit analysis, the assigned first classification for the entity is changed to a second classification for the entity.

Abstract: A method of runtime analysis for a computer program can include generating runtime data relating to memory usage for an instrumented computer program and creating a memory map comprising a plurality of memory ranges of different types according to the runtime data. At least a portion of the memory map can be presented to indicate selected ones of the plurality of memory ranges.

Abstract: A computer-implemented distributed data processing method for a software application that includes no code that targets a distributed data processing system, the method comprising: executing a software application that has been designed with a single-node operation to operate in a distributed fashion by automatically arranging for components of the software application to execute across a plurality of nodes.

Abstract: A distributed data processing method, system, and computer program product include distribution of production software automatically without being designed for such distribution by the developers of the software and consideration of breakdown, automatic or otherwise, of a production software application into its components such that execution of the components can be distributed across nodes.

Abstract: Aspects of the present disclosure relate to associating chat history with versions of software development artifacts such as source code files. A version of an artifact is identified. The identified version is analyzed by a natural language processor to determine a set of features associated with the version. The set of features associated with the version is compared to a portion of chat history. Based on the comparison, a match certainty is calculated. In response to the calculated match certainty satisfying a match certainty threshold, a determination is made that the version and the portion of chat history correspond. In response to the determination that the version and portion of chat history correspond, an association between the version and the portion of chat history is stored.

Abstract: Embodiments for profiling an instance of a computing program distributed across a plurality of nodes in a distributed computing environment. First call data, comprising one or more parameters passed to a first function executing on a first node, may be collected within an instance of a computing application. Second call data, comprising one or more parameters passed to a second function executing on a second node, may be collected within an instance of a computing application. The first call data and the second call data may be compared such that the comparison is provided via one or more call graphs representing the instance.