International Business Machines Corporation

Joshua H Armitage

Andrew Wright

Michael Paul Clarke

King-Yan Kwan

John A W Kaputin

Mohammad Zanjani

Michael C Froend

Christine A Jenkins

John A Kaputin

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.

Agent flow arrangement management

A method, computer system, and a computer program product for altering a written communication based on a dress style associated with a recipient is provided. The present invention may include receiving a plurality of visual data associated with the recipient. The present invention may also include analyzing the received plurality of visual data. The present invention may then include determining the dress style associated with the recipient based on the analyzed plurality of visual data. The present invention may further include retrieving a writing style associated with the recipient from a knowledge base based on the determined dress style. The present invention may also include generating a plurality of writing guidelines based on the retrieved writing style associated with the recipient.

Assisting with written communication style based on recipient dress style

Aspects include receiving, at a pass-through server executing in a replay mode, a request directed to a backend resource. The request is received from an application that is connected to the pass-through server. The pass-through server executing in the replay mode identifies a response that corresponds to the request by: forming a key that includes an identifier of the current execution phase of the application and at least a subset of the request; accessing trace data that includes a plurality of keys and corresponding responses that were previously recorded in the trace data by the pass-through server executing in a recording mode; and using the key to locate, in the trace data, the response corresponding to the request. The identified response is relayed, by the pass-through server executing in the replay mode, to the application.

Resuming applications using pass-through servers and trace data

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.

Scheduling downloads based on metadata in a client-server topology

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.

Program execution without the use of bytecode modification or injection

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.

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.

Growing community of inventors

Ellenbrook, Australia

Joshua H Armitage