International Business Machines Corporation

Luke Matthew Browning

Larry Bert Brenner

Suresh Eswara Warrier

Kenneth Bernard Rozendal

Jeffrey Scott Peek

Bruce Gerard Mealey

Paul Edward McKenney

Steven Mark Thurber

Randal Craig Swanberg

Richard Louis Arndt

Basu Vaidyanathan

Mysore Sathyanarayana Srinivas

Thomas Stanley Mathews

Dean J Burdick

James Bernard Moody

Douglas Marvin Benignus

Rodrigo Ceron Ferreira De Castro

James William VanFleet

Alex Zanetti De Lima

Murillo Fernandes Bernardes

Andre Fernandes De Macedo

Paulo Ricardo Paz Vital

John Thomas O'Quinn, Ii

Olivier Alain Cremel

Jeffrey Scot Peek

Embodiments of the present invention provide a method, system and computer program product for automated LAMP stack data migration. In an embodiment of the invention, a method for automated LAMP stack data migration can be provided. The method can include retrieving a profile for a LAMP stack executing in a source operating platform, selecting a LAMP stack for deployment onto a target operating platform and deploying the selected LAMP stack onto the target operating platform. The method further can include translating the retrieved profile for compatibility with the selected LAMP stack, directing a reboot of the target operating platform, and applying the translated profile to the target operating platform.

Automated lamp stack migration

A data processing system allows processes to be checkpointed and restarted. The system saves the old process and thread identifications in a process table. When an application makes a system call passing the old process and/or thread identifications as parameters, the system performs a mapping algorithm to supply the system call with the new process and/or thread identifications. When a system call returns a new identification, the system performs a remapping algorithm to return the old identifications to the calling application program. When a group of process is restarted for which the process group leader was not checkpointed, the system creates a ghost process group leader.

Method and apparatus for allowing restarted programs to use old process identification

A computer implemented method, apparatus, and computer usable program code for processing breakpoints. A breakpoint is detected during execution of a process. A thread that is currently executing is identified as an identified thread. A determination is made as to whether the breakpoint is applicable to the identified thread. In response to the determination that the breakpoint is applicable to the identified thread, the execution of the process is halted. Execution of the process continues without halting execution of the process if the breakpoint is inapplicable to the identified thread.

Operating system support for thread-level breakpoints

A method, apparatus, and computer instructions for executing a handler in a multi-threaded process handling a number of threads in a manner that avoids deadlocks. A value equal to the number of threads executing in the data processing system is set. The value is decremented each time a lock count for a thread within the number of threads is zero. A thread within the number of threads is suspended if the thread requests a lock and has a lock count of zero. A procedure, such as a handler, is executed in response to all of the threads within the number of threads having no locks.

Method and apparatus for thread-safe handlers for checkpoints and restarts

Apparatus for thread-safe handlers for checkpoints and restarts

A data processing system allows processes to be checkpointed and restarted. The system saves the old process and thread identifications in a process table. When an application makes a system cell passing the old process and/or thread identifications as parameters, the system performs a mapping algorithm to supply the system call with the new process and/or thread identifications. When a system call returns a new identification, the system performs a remapping algorithm to return the old identifications to the calling application program. When a group of process is restarted for which the process group leader was not checkpointed, the system creates a ghost process group leader.

Method and apparatus for allowing restarted programs to use old process identifications and thread identifications

An apparatus and methods for periodic load balancing in a multiple run queue system are provided. The apparatus includes a controller, memory, initial load balancing device, idle load balancing device, periodic load balancing device, and starvation load balancing device. The apparatus performs initial load balancing, idle load balancing, periodic load balancing and starvation load balancing to ensure that the workloads for the processors of the system are optimally balanced.

System for preventing periodic load balancing if processor associated with lightest local run queue has benefited from idle processor load balancing within a determined time period

Method for determining idle processor load balancing in a multiple processors system

A method and apparatus allow a programmer to repeatedly debug a program from the same starting point. The entire process state of the process can be saved at any time in the course of a debugging session to a disk file, called the checkpoint file. Now registers or memory may be modified, if necessary, and the program may be brought back to the same starting point where the state had been previously saved by resuming from the checkpoint file. The method and apparatus allow the state of all the programs to be saved multiple times and resumed from any one of those states. The debugging of a problem is considerably facilitated by not having to start from scratch to debug the problem as the last saved state of the program can be used to start the debugging.

Method and apparatus to debug a program from a predetermined starting point

A computer system has physical pages of memory subject to access by input/output ('I/O') devices, and a certain table with entries associating the physical pages with the I/O devices. Responsive to a request for data be moved from a first physical page to a second physical page, an entry is selected for the first physical page in the table. The selected entry indicates an association of the first physical page and one of the I/O devices. Arbitration is temporarily disabled for the selected I/O device so that I/O operations for the I/O device are temporarily disabled. Once arbitration is disabled for the device the data is moved from the first physical page to a second one of the physical pages and the entry is updated in the table to reflect a new association between the I/O device and the second physical page.

Method, apparatus, and computer program product for migrating data subject to access by input/output devices

A system, method, and computer program product are disclosed for invalidating specified pretranslations maintained in a data processing system which maintains decentralized copies of pretranslations. A centralized mapping of virtual addresses to their associated physical addresses is established. The centralized mapping includes a listing of pretranslations of the virtual addresses to their associated physical addresses. Multiple lists of pretranslations are generated. Control of the lists may be passed from one entity to another, such that the lists are not owned by any particular entity. Each one of the lists includes a copy of pretranslations for virtual addresses. A particular one of the physical addresses is specified. Each list that includes a pretranslation of a virtual address to the specified physical addresses is located. The pretranslation of the virtual address to the specified physical address is then invalidated within each one of the lists.

Method, system, and computer program product for invalidating pretranslations for dynamic memory removal

An apparatus and method for performing workload management is provided. In particular, an apparatus and method for performing workload management using class shares and tiers is provided. In the apparatus and method, each process is associated with a particular class of workload. Each class has an associated number of shares representing the importance of the class relative to other classes. Each class, in turn, is associated with a particular tier of workload importance. Classes of processes compete with other classes of processes in their same tier for system resources based on the number of shares that they have. These shares are representative of the percentage of the system resource the process is provided relative to the other classes in the same tier. Classes in one tier compete with classes in other tiers for system resources based on the priority assigned to the tiers.

Apparatus and method for workload management using class shares and tiers

An apparatus, method and computer program product for minimizing the negative effects that occur when simple locks are highly contended among processors which may or may not have identical latencies to the memory that represents a given lock, are provided. The apparatus, method and computer program product minimize these effects by converting simple locks such that they act as standard simple locks when there is no contention and act as krlocks when there is contention for a lock. In this way, the number of processors spinning on a lock is limited to a single processor, thereby reducing the number of processors that are in a wait state and not performing any useful work.

Growing community of inventors

Austin, TX, United States of America

Luke Matthew Browning