Abstract: Technology for isolating suspicious activity on a plurality of servers for the purpose of mitigating damage (for example, unauthorized access to server data) to a network of computers and eliciting information about any suspicious clients involved in the suspicious activity. A suspicious client is identified, isolated, and permitted to continue interacting with the computer network to elicit information about the activity (for example, the identify of a suspicious client). Suspicious activity is defined by network administrators and determined using conventional techniques. The suspicious activity is isolated to prevent the suspicious client(s) from unauthorized and/or harmful actions on the network. The suspicious client(s) are permitted to resume network requests, in isolation, to covertly elicit information about the suspicious activity.

Abstract: Technology for isolating suspicious activity on a plurality of servers for the purpose of mitigating damage (for example, unauthorized access to server data) to a network of computers and eliciting information about any suspicious clients involved in the suspicious activity. A suspicious client is identified, isolated, and permitted to continue interacting with the computer network to elicit information about the activity (for example, the identify of a suspicious client). Suspicious activity is defined by network administrators and determined using conventional techniques. The suspicious activity is isolated to prevent the suspicious client(s) from unauthorized and/or harmful actions on the network. The suspicious client(s) are permitted to resume network requests, in isolation, to covertly elicit information about the suspicious activity.

Abstract: A computer-implemented method includes generating a new management application based on a first management application, where the first management application operates a first management system. A first set of resources of the first management system are assigned to the new management application, where the first set of resources support a first request server and a first worker server. A new worker server of the new management system is started, where the new worker server utilizes the first set of resources. The first request server is instructed to send a first set of future requests of the first request server to the new worker server. The first request server is further instructed to redirect a remainder of the future requests of the first request server to a new request server of the new management application. The new management application operates a new management system based on the first management system.

Abstract: A computer-implemented method includes generating a new management application based on a first management application, where the first management application operates a first management system. A first set of resources of the first management system are assigned to the new management application, where the first set of resources support a first request server and a first worker server. A new worker server of the new management system is started, where the new worker server utilizes the first set of resources. The first request server is instructed to send a first set of future requests of the first request server to the new worker server. The first request server is further instructed to redirect a remainder of the future requests of the first request server to a new request server of the new management application. The new management application operates a new management system based on the first management system.

Abstract: A processor-implemented method for a concurrent software service upgrade is provided. The processor implemented method may include receiving a type of service request corresponding to the software service upgrade, determining, by the processor, the type of service request and then generating a plurality of subpartitions corresponding to a hypervisor. The method may further include applying the service request to at least one subpartition within the plurality of subpartitions, wherein the service request is applied to the at least one subpartition based on the type of service request and balancing the system resources among the plurality of subpartitions upon the applying of the service request to the at least one subpartition.

Abstract: A processor-implemented method for a concurrent software service upgrade is provided. The processor implemented method may include receiving a type of service request corresponding to the software service upgrade, determining, by the processor, the type of service request and then generating a plurality of subpartitions corresponding to a hypervisor. The method may further include applying the service request to at least one subpartition within the plurality of subpartitions, wherein the service request is applied to the at least one subpartition based on the type of service request and balancing the system resources among the plurality of subpartitions upon the applying of the service request to the at least one subpartition.

Abstract: Computer system, method and program for defining first and second virtual machines and a memory shared by the first and second virtual machines. A filesystem cache resides in the shared memory. A lock structure resides in the shared memory to record which virtual machine, if any, currently has an exclusive lock for writing to the cache. The first virtual machine includes a first program function to acquire the exclusive lock when available by manipulation of the lock structure, and a second program function active after the first virtual machine acquires the exclusive lock, to write to the cache. The lock structure is directly accessible by the first program function. The cache is directly accessible by the second program function. The second virtual machine includes a third program function to acquire the exclusive lock when available by manipulation of the lock structure, and a fourth program function active after the second virtual machine acquires the exclusive lock, to write to the cache.

Abstract: A system, method and program product for migrating a first virtual machine from a first real computer to a second real computer or from a first LPAR to a second LPAR in a same real computer. Before migration, the first virtual machine comprises an operating system and an application in a first private memory private to the first virtual machine. A communication queue of the first virtual machine resides in a shared memory shared by the first and second computers or the first and second LPARs. The operating system and application are copied from the first private memory to the shared memory. The operating system and application are copied from the shared memory to a second private memory private to the first virtual machine in the second computer or second LPAR. Then, the first virtual machine is resumed in the second computer or second LPAR.

Abstract: A request server automatically detects, in response to initialization of the request server, if there are previous generations of requests outstanding for the request server, and if so, immunizes itself against those requests. The request server starts one or more threads that are designed to gather messages associated with requests from previous incarnations of the server and handles those messages without affecting the requestors. While the request server is immunized from earlier generations of requests, the request server is capable of processing new requests.

Abstract: A system, computer program product and method for managing a cache of a virtual machine. A cache is defined in memory, and a virtual machine is assigned to the cache. An identity of the cache is recorded in storage. The virtual machine terminates, and the cache and contents of the cache are preserved despite the termination of the virtual machine, such that if the virtual machine subsequently resumes operating, the virtual machine can access the cache and its contents. There is also a system, method and computer program product for managing a cache of an LPAR. A cache is defined in memory, and assigned to an LPAR. A record is made of an identity of the cache in storage. The LPAR terminates, and the cache and contents of the cache are preserved despite the termination of the LPAR, such that if the LPAR subsequently resumes operating, the LPAR can access the cache and its contents.

Abstract: Management of virtual memory allocated by a virtual machine control program to a plurality of virtual machines. Each of the virtual machines has an allocation of virtual private memory divided into working memory, cache memory and swap memory. The virtual machine control program determines that it needs additional virtual memory allocation, and in response, makes respective requests to the virtual machines to convert some of their respective working memory and/or cache memory to swap memory. At another time, the virtual machine control program determines that it needs less virtual memory allocation, and in response, makes respective requests to the virtual machines to convert some of their respective swap memory to working memory and/or cache memory.

Abstract: Generally, piping applications defined by combining stages of programming with a sequence control program and specifying to the sequence control program piping commands. The stages may be functions to send data to a shared queue. The piping commands identify current stages, and parameters for the current stages identify the queue and a key for the data to be sent to the queue. The piping commands do not identify preceding and/or subsequent piping applications.

Abstract: Computer system, method and program for defining first and second virtual machines and a memory shared by the first and second virtual machines. A filesystem cache resides in the shared memory. A lock structure resides in the shared memory to record which virtual machine, if any, currently has an exclusive lock for writing to the cache. The first virtual machine includes a first program function to acquire the exclusive lock when available by manipulation of the lock structure, and a second program function active after the first virtual machine acquires the exclusive lock, to write to the cache. The lock structure is directly accessible by the first program function. The cache is directly accessible by the second program function. The second virtual machine includes a third program function to acquire the exclusive lock when available by manipulation of the lock structure, and a fourth program function active after the second virtual machine acquires the exclusive lock, to write to the cache.

Abstract: Computer system, method and program for defining first and second virtual machines and a memory shared by the first and second virtual machines. A filesystem cache resides in the shared memory. A lock structure resides in the shared memory to record which virtual machine, if any, currently has an exclusive lock for writing to the cache. The first virtual machine includes a first program function to acquire the exclusive lock when available by manipulation of the lock structure, and a second program function active after the first virtual machine acquires the exclusive lock, to write to the cache. The lock structure is directly accessible by the first program function. The cache is directly accessible by the second program function. The second virtual machine includes a third program function to acquire the exclusive lock when available by manipulation of the lock structure, and a fourth program function active after the second virtual machine acquires the exclusive lock, to write to the cache.

Abstract: A request server automatically detects, in response to initialization of the request server, if there are previous generations of requests outstanding for the request server, and if so, immunizes itself against those requests. The request server starts one or more threads that are designed to gather messages associated with requests from previous incarnations of the server and handles those messages without affecting the requestors. While the request server is immunized from earlier generations of requests, the request server is capable of processing new requests.

Abstract: Management of virtual memory allocated by a virtual machine control program to a plurality of virtual machines. Each of the virtual machines has an allocation of virtual private memory divided into working memory, cache memory and swap memory. The virtual machine control program determines that it needs additional virtual memory allocation, and in response, makes respective requests to the virtual machines to convert some of their respective working memory and/or cache memory to swap memory. At another time, the virtual machine control program determines that it needs less virtual memory allocation, and in response, makes respective requests to the virtual machines to convert some of their respective swap memory to working memory and/or cache memory.

Abstract: A first piping application is defined by combining first and second stages of programming with a first sequence control program and specifying to the first sequence control program a first piping command. The second stage is a function to send data to a shared queue. The first piping command identifies the first stage, the second stage and parameters for the second stage identifying the queue and a key for the data to be sent to the queue. A second piping application is defined by combining third and fourth stages of programming with a second sequence control program, and specifying to the second sequence control program a second piping command. The third stage is a function to read the data from the queue. The second piping command identifies the fourth stage, the third stage, and parameters for the third stage identifying the queue and the key for the data to be read from the queue.

Abstract: A method for communication between first and second computer programs having a shared memory. The first computer program has a first work dispatcher for a first work queue. The second computer program has a second work dispatcher for a second work queue. Without causing an interrupt, a message or data is written for the second program from the first program to the shared memory and the second work queue is updated with a work item indicating a message or data for the second program. In association with the updating step, it is determined if the second program is currently busy. If so, the second program is not interrupted regarding the message or data. When the second program subsequently becomes not busy, the second program receives, without an interrupt, and executes the work item to receive the message or data. If the second program was not currently busy, the second program is interrupted to process the message or data on its work queue. This imposes a minimal burden on the second program.

Abstract: A technique to collectively manage locks by multiple virtual machines and then access shared data protected by the locks. A computer system defines first and second virtual machines and a memory shared by the first and second virtual machines. A lock structure is defined in the shared memory. The lock structure is capable of listing a holder of a lock for shared data in the shared memory. The first virtual machine acquires a lock for the shared data when available by manipulation of the lock structure. After acquiring the lock, the first virtual machine accesses the shared data. The lock structure and the shared data are directly accessible by the first virtual machine. The second virtual machine acquires a lock for the shared data when available by manipulation of the lock structure. After acquiring the lock, the second virtual machine accesses the shared data. The lock structure and shared data are directly accessible by the second virtual machine.

Abstract: A technique for utilizing resources in a virtual machine operating system. The virtual machine operating system comprises a multiplicity of virtual machines. A share of resources is allocated to each of the virtual machines. Utilization by one of the virtual machines of the resources allocated to the one virtual machine is automatically monitored. If the one virtual machine needs additional resources, the one virtual machine is automatically cloned. The clone is allocated a share of the resources taken from the shares of other of the virtual machines, such that the resultant shares allocated to the one virtual machine and the clone together are greater than the share allocated to the one virtual machine before the one virtual machine was cloned. The clone performs work with its resources that would have been performed by the one virtual machine if not for the existence of said clone.