Abstract: Automatic optimization of application performance parameters is provided. This optimization may be provided by identifying the resource demands of applications using virtual resources, identifying the virtual resources that can be available to the applications, and allocating the virtual resources to the applications to be run on a virtual machine.

Abstract: Automatic optimization of application performance parameters is provided. This optimization may be provided by identifying the resource demands of applications using virtual resources, identifying the virtual resources that can be available to the applications, and allocating the virtual resources to the applications to be run on a virtual machine.

Abstract: The present invention is an enhanced staged event-driven architecture (SEDA) stage. The enhanced SEDA stage can include an event queue configured to enqueue a plurality of events, an event handler programmed to process events in the event queue, and a thread pool coupled to the event handler. A resource manager further can be coupled to the thread pool and the event queue. Moreover, the resource manager can be programmed to allocate additional threads to the thread pool where a number of events enqueued in the event queue exceeds a threshold value and where all threads in the thread pool are busy.

Abstract: An invention is disclosed for a computer software timeout algorithm that reduces the amount of list manipulation needed to satisfy system or network requirements for scheduling and cancelling timeout requests to determine whether the expiration time has been reached for execution of an input/output (I/O) request, thereby requiring action to cancel the I/O operation if it has not yet been completed.

Abstract: An invention is disclosed for a computer software timeout algorithm that reduces the amount of list manipulation needed to satisfy system or network requirements for scheduling and cancelling timeout requests to determine whether the expiration time has been reached for execution of an input/output (I/O) request, thereby requiring action to cancel the I/O operation if it has not yet been completed.

Abstract: An invention is disclosed for a computer software timeout algorithm that reduces the amount of list manipulation needed to satisfy system or network requirements for scheduling and cancelling timeout requests to determine whether the expiration time has been reached for execution of an input/output (I/O) request, thereby requiring action to cancel the I/O operation if it has not yet been completed.

Abstract: The present invention is an enhanced staged event-driven architecture (SEDA) stage. The enhanced SEDA stage can include an event queue configured to enqueue a plurality of events, an event handler programmed to process events in the event queue, and a thread pool coupled to the event handler. A resource manager further can be coupled to the thread pool and the event queue. Moreover, the resource manager can be programmed to allocate additional threads to the thread pool where a number of events enqueued in the event queue exceeds a threshold value and where all threads in the thread pool are busy.

Abstract: The present invention is an enhanced staged event-driven architecture (SEDA) stage. The enhanced SEDA stage can include an event queue configured to enqueue a plurality of events, an event handler programmed to process events in the event queue, and a thread pool coupled to the event handler. A resource manager further can be coupled to the thread pool and the event queue. Moreover, the resource manager can be programmed to allocate additional threads to the thread pool where a number of events enqueued in the event queue exceeds a threshold value and where all threads in the thread pool are busy.

Abstract: An invention is disclosed for improved computer system or network efficiency in use of “just-in-time” (JIT) buffer allocation for “event completion” style input/output (I/O) models. Specifically, a method and system are disclosed for use of JIT programming techniques to overcome excessive memory usage and performance problems caused by large numbers of buffer allocations during completion of I/O events, through the use of buffers allocated “just-in-time” when I/O events are ready to be processed instead of at the time when the I/O request is initially made, in order to allow buffers allocated prior to (or at the time of) an initial I/O request to be released for other uses if they are not needed immediately to complete the requested I/O event.

Abstract: An invention is disclosed for a computer software timeout algorithm that reduces the amount of list manipulation needed to satisfy system or network requirements for scheduling and cancelling timeout requests to determine whether the expiration time has been reached for execution of an input/output (I/O) request, thereby requiring action to cancel the I/O operation if it has not yet been completed.

Abstract: The present invention is an enhanced staged event-driven architecture (SEDA) stage. The enhanced SEDA stage can include an event queue configured to enqueue a plurality of events, an event handler programmed to process events in the event queue, and a thread pool coupled to the event handler. A resource manager further can be coupled to the thread pool and the event queue. Moreover, the resource manager can be programmed to allocate additional threads to the thread pool where a number of events enqueued in the event queue exceeds a threshold value and where all threads in the thread pool are busy.

Abstract: A technique, system, and computer program for run-time translation of procedurally-oriented Emulator High Level Language Application Programming Interface (EHLLAPI) calls into object-based host access calls (such as those provided with IBM's Host Access Control Library or the Open Host Interface Objects under development by the IETF), without requiring changes to the workstation EHLLAPI applications. This translation, in addition to generating the appropriate method invocation, reconciles the operational differences between EHLLAPI's sequential function call model and the event-driven approach used in the object-oriented model.

Abstract: A technique, system, and computer program for enabling workstation software applications to efficiently and reliably use legacy host application data streams, without requiring change to the host applications. This is achieved by defining attributes of presentation spaces (screens or parts of screens) that are of interest to the workstation application, defining target objects to process the legacy host data, registering these attribute definitions and corresponding target objects with a screen recognition object, using the screen recognition object to monitor the host data streams for occurrence of a registered screen, and generating an asynchronous event to invoke the target object when a registered screen is detected. The efficiency is obtained because the workstation application programmer no longer has to write code to monitor the host data streams for the screens of interest.

Abstract: Methods, systems and computer program products are provided which control execution of an application executing on a data processing system by receiving a first request for entry of sleep mode and determining a location in an application requesting entry of sleep mode. Execution of the application is suspended for a first predetermined time period based upon the application and location in the application requesting entry of sleep mode. A sleep history associated with the location in the application may also be generated based on previous durations of sleep associated with the location in the application and the first predetermined time adjusted based upon the sleep history associated with the location in the application so as to control the number of requests for entry of sleep mode associated with the location in the application.