Abstract: One or more processors analyze interaction data for two or more nodes within a plurality of nodes processing a computing transaction. One or more processors determine a number of inbound requests and a number of outbound requests for the two or more nodes within the plurality of nodes. One or more processors determine whether one or more nodes within the plurality of nodes are limiting computing performance.

Abstract: One or more processors analyze interaction data for two or more nodes within a plurality of nodes processing a computing transaction. One or more processors determine a number of inbound requests and a number of outbound requests for the two or more nodes within the plurality of nodes. One or more processors determine whether one or more nodes within the plurality of nodes are limiting computing performance.

Abstract: One or more processors analyze interaction data for two or more nodes within a plurality of nodes processing a computing transaction. One or more processors determine a number of inbound requests and a number of outbound requests for the two or more nodes within the plurality of nodes. One or more processors determine whether one or more nodes within the plurality of nodes are limiting computing performance.

Abstract: A method for processing data includes performing an extract-transform-load operation on a set of application activity data to provide a topology index comprising a plurality of unique entries, extracting node information and connection information for an application data structure and building a data structure corresponding to the application therefrom, and providing information from the application topology data structure to a user. A computer program product corresponding to the method is also disclosed herein. Also disclosed is an apparatus for processing data comprising a processing module configured to perform an extract-transform-load operation on application activity data, an extraction module configured to extract node and connection information for the application, and a topology calculator configured to build a topology data structure corresponding to the application. The apparatus may additionally include a persistent data store configured to store the topology index.

Abstract: One or more processors analyze interaction data for two or more nodes within a plurality of nodes processing a computing transaction. One or more processors determine a number of inbound requests and a number of outbound requests for the two or more nodes within the plurality of nodes. One or more processors determine whether one or more nodes within the plurality of nodes are limiting computing performance.

Abstract: A method for processing data includes performing an extract-transform-load operation on a set of application activity data to provide a topology index comprising a plurality of unique entries, extracting node information and connection information for an application data structure and building a data structure corresponding to the application therefrom, and providing information from the application topology data structure to a user. A computer program product corresponding to the method is also disclosed herein. Also disclosed is an apparatus for processing data comprising a processing module configured to perform an extract-transform-load operation on application activity data, an extraction module configured to extract node and connection information for the application, and a topology calculator configured to build a topology data structure corresponding to the application. The apparatus may additionally include a persistent data store configured to store the topology index.

Abstract: In a method for generating test transactions across computing systems, a first test function of a first program on a first computing system of a plurality of computing systems receives a plurality of instructions, wherein a first instruction of the plurality of instructions is to invoke a first transaction between a second function of the first program and a second program on a second computing system of the plurality of computing systems. The first test function of the first program causes the transaction between the second function of the first program on the first computing system and the second program on the second computing system. The first test function of the first program sends the plurality of instructions to a second test function on a third computing system of the plurality of computing systems, based on a second instruction of the plurality of instructions.

Abstract: In a method for generating test transactions across computing systems, a first test function of a first program on a first computing system of a plurality of computing systems receives a plurality of instructions, wherein a first instruction of the plurality of instructions is to invoke a first transaction between a second function of the first program and a second program on a second computing system of the plurality of computing systems. The first test function of the first program causes the transaction between the second function of the first program on the first computing system and the second program on the second computing system. The first test function of the first program sends the plurality of instructions to a second test function on a third computing system of the plurality of computing systems, based on a second instruction of the plurality of instructions.

Abstract: In a method for generating test transactions across computing systems, a first test function of a first program on a first computing system of a plurality of computing systems receives a plurality of instructions, wherein a first instruction of the plurality of instructions is to invoke a first transaction between a second function of the first program and a second program on a second computing system of the plurality of computing systems. The first test function of the first program causes the transaction between the second function of the first program on the first computing system and the second program on the second computing system. The first test function of the first program sends the plurality of instructions to a second test function on a third computing system of the plurality of computing systems, based on a second instruction of the plurality of instructions.

Abstract: In a method for generating test transactions across computing systems, a first test function of a first program on a first computing system of a plurality of computing systems receives a plurality of instructions, wherein a first instruction of the plurality of instructions is to invoke a first transaction between a second function of the first program and a second program on a second computing system of the plurality of computing systems. The first test function of the first program causes the transaction between the second function of the first program on the first computing system and the second program on the second computing system. The first test function of the first program sends the plurality of instructions to a second test function on a third computing system of the plurality of computing systems, based on a second instruction of the plurality of instructions.

Abstract: A mechanism is provided that utilizes the attributes of the nodes to build a target list and creates filters based on the node attributes. The filters are installed on the mediators. Each mediator then applies that filter to its own local node list to create a local target list. This local target list will then contain the list of local nodes that need to have a targeted action applied, such as software installed, on them. The mediator then carries out the targeted action, such as software installation, on those nodes. By extending discovered node information with arbitrary attributes, the resolution of target lists defined by filters applied to the master node list is increased.

Abstract: The system and method of the present invention utilize the attributes of the nodes to build a target list and filters are created based on the node attributes. The filters are installed on the mediators. Each mediator then applies that filter to its own local node list to create a local target list. This local target list will then contain the list of local nodes that need to have a targeted action applied, such as software installed, on them. The mediator then carries out the targeted action, such as software installation, on those nodes. By extending discovered node information with arbitrary attributes, the resolution of target lists defined by filters applied to the master node list is increased.