Abstract: Systems and techniques to manage tasks in a data processing environment. In general, in one implementation, the technique includes monitoring a task in a data processing environment and, using an instance of a distributed application, assessing when to initiate recovery of the monitored task based on an expected execution time derived using the task's associated class and historical execution times. In another implementation, the technique includes forecasting an execution time of a task in a data processing environment using a class of the task and historical task execution times as input into a statistical analysis tool comprising multiple interconnected processing elements and servicing the task based on the forecast execution time.

Abstract: A method for associating related electronic messages in computer storage. A first transportable application is created and stored. User input requesting creation of a link from the first transportable application to another transportable application is received. User input that selects a second transportable application from among a plurality of previously created transportable applications is received. A link from the first transportable application to the second transportable application is created and stored. As a result, transportable application may be inter-related in complex message webs. The message webs may also be inter-related in message web rings. Links may be generated manually or automatically, based on context, workflow processes, or other known relationships among applications. Recipient lists and data may propagate among fields of linked transportable applications, directly or according to abstract business rules. Further, multiple-part electronic messages are disclosed.

Abstract: Systems and techniques to manage tasks in a data processing environment. In general, in one implementation, the technique includes monitoring a task in a data processing environment and, using an instance of a distributed application, assessing when to initiate recovery of the monitored task based on an expected execution time derived using the task's associated class and historical execution times. In another implementation, the technique includes forecasting an execution time of a task in a data processing environment using a class of the task and historical task execution times as input into a statistical analysis tool comprising multiple interconnected processing elements and servicing the task based on the forecast execution time.

Abstract: A method for associating related electronic messages in computer storage. A first transportable application is created and stored. User input requesting creation of a link from the first transportable application to another transportable application is received. User input that selects a second transportable application from among a plurality of previously created transportable applications is received. A link from the first transportable application to the second transportable application is created and stored. As a result, transportable application may be inter-related in complex message webs. The message webs may also be inter-related in message web rings. Links may be generated manually or automatically, based on context, workflow processes, or other known relationships among applications. Recipient lists and data may propagate among fields of linked transportable applications, directly or according to abstract business rules. Further, multiple-part electronic messages are disclosed.