Migratable unit based application migration

• US 8,893,118 B2
• Filed: 01/30/2006
• Issued: 11/18/2014
• Est. Priority Date: 01/30/2006
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Guminy, Scott M., Sharma, Sanjeev, Tjong, Anthony L., Yuan, David Yu
• Primary Examiner(s): Dao, Thuy
• Assistant Examiner(s): Chowdhury, Ziaul A
• Application Number:
  US11/343,120
• Publication Number:
  US 20070240143A1
• Time in Patent Office: 3,214 Days
• Field of Search: 717/172, 717/175, 717/177, 717/168, 717/137, 717/141, 717/121, 717/174, 717/204, 715/251, 713/100, 703/27, 719/310
• US Class Current: 717/175
• CPC Class Codes: G06F 8/70 Software maintenance or management

Abstract

Embodiments of the present invention address deficiencies of the art in respect to application migration and provide a novel and non-obvious method, system and computer program product for application migration through migratable units. In one embodiment, an application migration method can include decomposing an application migration into a plurality of migratable units (MUs). The MUs can be prioritized for migration to a target platform. Thereafter, each of the MUs can be migrated in an order defined by the prioritization. Finally, a stateful wizard can be provided which can reduce the complexity of the migration by providing a dashboard to the migration process.

Claims

1. A computer implemented application migration method comprising:

decomposing an application migration into a plurality of migratable units (MUs);

prioritizing the MUs for migration to a target platform;

displaying a stateful wizard; and

migrating each of the MUs in an order defined by the prioritization, wherein

state stateful wizard includes

a hierarchical view of migration tasks corresponding to the MUs,

a detail view of a selected migration task in the hierarchical view, and

a progress view showing a representation of the application migration.

2. The method of claim 1, wherein prioritizing the MUs for migration to the target platform, comprises:

identifying autonomous migratable units (AMUs) and non-autonomous migratable units (NAMUs) among the plurality of MUs; and

,

prioritizing the AMUs over the NAMUs for migration to the target platform.

3. The method of claim 1, wherein prioritizing the MUs for migration to the target platform, comprises grouping sets of the MUs in different tiers, each tier corresponding to a different priority level, each tier comprising MUs dependent upon MUs only in higher priority tiers.

4. The method of claim 2, wherein prioritizing the MUs for migration to the target platform, comprises:

grouping all AMUs in a highest priority tier; and

,

grouping sets of the NAMUs in different lower priority tiers, each lower priority tier corresponding to a different priority, each lower priority tier comprising NAMUs dependent upon MUs only in higher priority tiers.

5. The method of claim 3, wherein grouping sets of the MUs in different tiers, further comprises:

grouping MUs having a greater number of dependencies at higher priority tiers; and

,

grouping MUs having a lower number of dependencies at lower priority tiers.

6. The method of claim 3, wherein migrating each of the MUs in an order defined by the prioritization, comprises migrating in parallel each of the MUs for each tier.

7. The method of claim 1, further comprising:

defining a plurality of migration phases, each for a different migration behavior of the MUs; and

,

performing a migration of the MUs for each of the migration phases.

8. The method of claim 1, further comprising managing the migration to the target platform through a stateful wizard.

9. An application migration data processing system comprising:

a host computing platform comprising a processor and a memory; and

,

a migratable unit based migration processing logic coupled to the host computing platform and configured to

decompose an application migration into a plurality of migratable units (MUs) for prioritization and migration to a target platform in an order defined by the prioritization, and

generate a state stateful wizard including

a hierarchical view of migration tasks corresponding to the MUs,

a detail view of a selected migration task in the hierarchical view, and

a progress view showing a representation of the application migration.

10. The system of claim 9, wherein the MUs comprise autonomous migratable units (AMUs) and non-autonomous migratable units (NAMUs).

11. The system of claim 9, wherein the order defined by the prioritization comprises a plurality of tiers, each tier corresponding to a priority associated with maximum parallelization for migrating MUs in the tier.

12. The system of claim 9, further comprising a stateful wizard, the stateful wizard comprising each of a hierarchical view of the MUs, a detail view for a selected one of the MUs, and a progress view of progress for the migration to the target platform.

13. A computer program product comprising a computer usable storage memory embodying computer usable program code for application migration, said computer program product including computer usable program code, which when executed by a computer hardware system, causing the computer hardware system to perform the operations of

decomposing an application migration into a plurality of migratable units (MUs);

prioritizing the MUs for migration to a target platform;

displaying a stateful wizard; and

migrating each of the MUs in an order defined by the prioritization, wherein

state stateful wizard includes

a hierarchical view of migration tasks corresponding to the MUs,

a detail view of a selected migration task in the hierarchical view, and

a progress view showing a representation of the application migration.

14. The computer program product of claim 13, wherein the prioritizing the MUs for migration comprises:

identifying autonomous migratable units (AMUs) and non-autonomous migratable units (NAMUs) among the MUs; and

prioritizing the AMUs over the NAMUs for migration to the target platform.

15. The computer program product of claim 13, wherein the prioritizing the MUs for migration, comprises grouping sets of the MUs in different tiers, each tier corresponding to a different priority, each tier comprising MUs dependent upon MUs only in higher priority tiers.

16. The computer program product of claim 14, wherein the prioritizing the MUs for migration, comprises:

grouping all AMUs in a highest priority tier; and

,

grouping sets of the NAMUs in different lower priority tiers, each lower priority tier corresponding to a different priority, each lower priority tier comprising NAMUs dependent upon MUs only in higher priority tiers.

17. The computer program product of claim 15, wherein the grouping sets of the MUs, further comprises:

grouping MUs having a greater number of dependencies at higher priority tiers; and

grouping MUs having a lower number of dependencies at lower priority tiers.

18. The computer program product of claim 15, wherein each of the MUs for each tier are migrated in parallel.

19. The computer program product of claim 13, further comprising:

defining a plurality of migration phases, each for a different migration behavior of the MUs; and

performing a migration of the MUs for each of the migration phases.

20. The computer program product of claim 13, further comprising

managing the migration to the target platform through a stateful wizard.