Abstract: Disclosed aspects relate to agent flow arrangement management in a distributed commit processing environment. A first set of agent utilization data may be collected with respect to a first commit processing agent. A second set of agent utilization data may be collected with respect to a second commit processing agent. An agent flow arrangement may be determined based on a first value with respect to the first set of agent utilization data exceeding a second value with respect to the second set of agent utilization data. The agent flow arrangement may have the first commit processing agent subsequent to the second commit processing agent. The distributed commit operation may be processed using the agent flow arrangement which has the first commit processing agent subsequent to the second commit processing agent.

Abstract: A method, a computer program product, and a computer system for scheduling downloads based on metadata in a client-server topology. A server receives from a client application a request for scheduling a download of a file, wherein the request for scheduling the download of the file comprises a requirement of a time period for downloading the file. The server fetches information from one or more metadata sources. The server determines an optimal time for downloading the file, based on the requirement of the time period and information from one or more metadata sources. The server sends a response with the optimal time and information for downloading the file. The server receives from the client a request for downloading the file at the optimal time. The server serves, at the optimal time, the file to the client application.

Abstract: Disclosed aspects relate to agent flow arrangement management in a distributed commit processing environment. A first set of agent utilization data may be collected with respect to a first commit processing agent. A second set of agent utilization data may be collected with respect to a second commit processing agent. An agent flow arrangement may be determined based on a first value with respect to the first set of agent utilization data exceeding a second value with respect to the second set of agent utilization data. The agent flow arrangement may have the first commit processing agent subsequent to the second commit processing agent. The distributed commit operation may be processed using the agent flow arrangement which has the first commit processing agent subsequent to the second commit processing agent.

Abstract: A method for registering a plurality of callbacks. The method may include receiving at least one callback function in a virtual machine, which includes a plurality of callback registration information. The method may include registering each at least one received callback function in a virtual machine tool interface within the virtual machine to a list of callback functions for an event based on the plurality of callback registration information. The method may include monitoring the virtual machine for an occurrence of the event. The method may include determining the event has occurred. The method may also include generating a local frame for each at least one registered callback function within the list of callback functions for the determined event. The method may include executing each at least one registered callback function based on each generated local frame associated with each at least one registered callback function.

Abstract: Disclosed aspects relate to agent flow arrangement management in a distributed commit processing environment. A first set of agent utilization data may be collected with respect to a first commit processing agent. A second set of agent utilization data may be collected with respect to a second commit processing agent. An agent flow arrangement may be determined based on a first value with respect to the first set of agent utilization data exceeding a second value with respect to the second set of agent utilization data. The agent flow arrangement may have the first commit processing agent subsequent to the second commit processing agent. The distributed commit operation may be processed using the agent flow arrangement which has the first commit processing agent subsequent to the second commit processing agent.

Abstract: Disclosed aspects relate to agent flow arrangement management in a distributed commit processing environment. A first set of agent utilization data may be collected with respect to a first commit processing agent. A second set of agent utilization data may be collected with respect to a second commit processing agent. An agent flow arrangement may be determined based on a first value with respect to the first set of agent utilization data exceeding a second value with respect to the second set of agent utilization data. The agent flow arrangement may have the first commit processing agent subsequent to the second commit processing agent. The distributed commit operation may be processed using the agent flow arrangement which has the first commit processing agent subsequent to the second commit processing agent.

Abstract: A computer system for scheduling downloads based on metadata in a client-server topology. A server receives from a client application a request for scheduling a download of a file, wherein the request for scheduling the download of the file comprises a requirement of a time period for downloading the file. The server fetches information from one or more metadata sources. The server determines an optimal time for downloading the file, based on the requirement of the time period and information from one or more metadata sources. The server sends a response with the optimal time and information for downloading the file. The server receives from the client a request for downloading the file at the optimal time. The server serves, at the optimal time, the file to the client application.

Abstract: Disclosed aspects relate to agent flow arrangement management in a distributed commit processing environment. A first set of agent utilization data may be collected with respect to a first commit processing agent. A second set of agent utilization data may be collected with respect to a second commit processing agent. An agent flow arrangement may be determined based on a first value with respect to the first set of agent utilization data exceeding a second value with respect to the second set of agent utilization data. The agent flow arrangement may have the first commit processing agent subsequent to the second commit processing agent. The distributed commit operation may be processed using the agent flow arrangement which has the first commit processing agent subsequent to the second commit processing agent.

Abstract: Disclosed aspects relate to agent flow arrangement management in a distributed commit processing environment. A first set of agent utilization data may be collected with respect to a first commit processing agent. A second set of agent utilization data may be collected with respect to a second commit processing agent. An agent flow arrangement may be determined based on a first value with respect to the first set of agent utilization data exceeding a second value with respect to the second set of agent utilization data. The agent flow arrangement may have the first commit processing agent subsequent to the second commit processing agent. The distributed commit operation may be processed using the agent flow arrangement which has the first commit processing agent subsequent to the second commit processing agent.

Abstract: A method for registering a plurality of callbacks. The method may include receiving at least one callback function in a virtual machine, which includes a plurality of callback registration information. The method may include registering each at least one received callback function in a virtual machine tool interface within the virtual machine to a list of callback functions for an event based on the plurality of callback registration information. The method may include monitoring the virtual machine for an occurrence of the event. The method may include determining the event has occurred. The method may also include generating a local frame for each at least one registered callback function within the list of callback functions for the determined event. The method may include executing each at least one registered callback function based on each generated local frame associated with each at least one registered callback function.

Abstract: A computer system for scheduling downloads based on metadata in a client-server topology. A server receives from a client application a request for scheduling a download of a file, wherein the request for scheduling the download of the file comprises a requirement of a time period for downloading the file. The server fetches information from one or more metadata sources. The server determines an optimal time for downloading the file, based on the requirement of the time period and information from one or more metadata sources. The server sends a response with the optimal time and information for downloading the file. The server receives from the client a request for downloading the file at the optimal time. The server serves, at the optimal time, the file to the client application.

Abstract: A method, a computer program product, and a computer system for scheduling downloads based on metadata in a client-server topology. A server receives from a client application a request for scheduling a download of a file, wherein the request for scheduling the download of the file comprises a requirement of a time period for downloading the file. The server fetches information from one or more metadata sources. The server determines an optimal time for downloading the file, based on the requirement of the time period and information from one or more metadata sources. The server sends a response with the optimal time and information for downloading the file. The server receives from the client a request for downloading the file at the optimal time. The server serves, at the optimal time, the file to the client application.

Abstract: A computer program product for scheduling downloads based on metadata in a client-server topology. A server receives from a client application a request for scheduling a download of a file, wherein the request for scheduling the download of the file comprises a requirement of a time period for downloading the file. The server fetches information from one or more metadata sources. The server determines an optimal time for downloading the file, based on the requirement of the time period and information from one or more metadata sources. The server sends a response with the optimal time and information for downloading the file. The server receives from the client a request for downloading the file at the optimal time. The server serves, at the optimal time, the file to the client application.

Abstract: A computer program product for scheduling downloads based on metadata in a client-server topology. A server receives from a client application a request for scheduling a download of a file, wherein the request for scheduling the download of the file comprises a requirement of a time period for downloading the file. The server fetches information from one or more metadata sources. The server determines an optimal time for downloading the file, based on the requirement of the time period and information from one or more metadata sources. The server sends a response with the optimal time and information for downloading the file. The server receives from the client a request for downloading the file at the optimal time. The server serves, at the optimal time, the file to the client application.

Abstract: A method for registering a plurality of callbacks. The method may include receiving at least one callback function in a virtual machine, which includes a plurality of callback registration information. The method may include registering each at least one received callback function in a virtual machine tool interface within the virtual machine to a list of callback functions for an event based on the plurality of callback registration information. The method may include monitoring the virtual machine for an occurrence of the event. The method may include determining the event has occurred. The method may also include generating a local frame for each at least one registered callback function within the list of callback functions for the determined event. The method may include executing each at least one registered callback function based on each generated local frame associated with each at least one registered callback function.

Abstract: A method, a computer program product, and a computer system for scheduling downloads based on metadata in a client-server topology. A server receives from a client application a request for scheduling a download of a file, wherein the request for scheduling the download of the file comprises a requirement of a time period for downloading the file. The server fetches information from one or more metadata sources. The server determines an optimal time for downloading the file, based on the requirement of the time period and information from one or more metadata sources. The server sends a response with the optimal time and information for downloading the file. The server receives from the client a request for downloading the file at the optimal time. The server serves, at the optimal time, the file to the client application.

Abstract: One or more processors execute one or more software commands that are capable of command failure on one or more computing devices. One or more processors detect one or more failed commands as a result of executing the one or more software commands. One or more processors determine whether the one or more failed commands are a first type of command failures that result from a first type of software commands. One or more processors reissue the one or more failed commands that are determined to be the first type of software commands at least once while at least one diagnostic program is executing. One or more processors capture diagnostic data for the one or more failed commands that are determined to be the first type of software commands.

Abstract: A method for registering a plurality of callbacks. The method may include receiving at least one callback function in a virtual machine, which includes a plurality of callback registration information. The method may include registering each at least one received callback function in a virtual machine tool interface within the virtual machine to a list of callback functions for an event based on the plurality of callback registration information. The method may include monitoring the virtual machine for an occurrence of the event. The method may include determining the event has occurred. The method may also include generating a local frame for each at least one registered callback function within the list of callback functions for the determined event. The method may include executing each at least one registered callback function based on each generated local frame associated with each at least one registered callback function.

Abstract: One or more processors execute one or more software commands that are capable of command failure on one or more computing devices. One or more processors detect one or more failed commands as a result of executing the one or more software commands. One or more processors determine whether the one or more failed commands are a first type of command failures that result from a first type of software commands. One or more processors reissue the one or more failed commands that are determined to be the first type of software commands at least once while at least one diagnostic program is executing. One or more processors capture diagnostic data for the one or more failed commands that are determined to be the first type of software commands.

Abstract: A method for a distributed computing system managing vertically partitioned data includes receiving a query for a first row of data, where a first column of the first row of data is stored in a first data server and a second column of the first row of data is stored a second data server. The method translates the query for the first row of data into two queries, wherein a first translated query is for the first column of the first row of data and a second translated query is for the second column of the first row of data. The method sends the first translated query to the first data server and the second translated query to the second data server. Responsive to receiving the first column and the second column of the first row of data, the method sends the first column and the second column of the first row of data.