Application Migration Scheduling Using Usage Patterns and Dependencies
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing computing environments require significant manual effort and coordination for replication and migration, which is inefficient and time-consuming.
Innovation Solution
A method and system that utilize a relationship matrix and reduced use times to organize and prioritize applications for migration, incorporating a migrator with components like an application relationship mapper and dynamic strategizer to automate the process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Extent of automation
If manual replication and migration processes are used, then coordination and control can be performed, but significant manual effort and time are required
Solution Approach 1:
The system performs self-service by automatically discovering application relationships, generating migration plans, and executing migrations without human intervention. The migrator autonomously identifies dependencies between applications, determines optimal migration sequences, and coordinates the actual migration process, eliminating the need for manual administration while reducing migration time through automated parallel processing of independent applications.
Solution Approach 2:
The system performs preliminary action by pre-analyzing application relationships and generating a relationship matrix before migration begins. The migrator identifies all dependencies and creates an optimized migration plan in advance, determining the correct sequence and timing for each application migration. This preliminary analysis enables efficient execution without manual coordination during the actual migration process.
2Productivity
If applications are migrated independently without considering relationships, then migration speed increases, but application dependencies cause failures
Solution Approach 1:
The system segments the migration process into distinct phases: relationship discovery, dependency analysis, plan generation, and execution. The relationship matrix divides applications into groups based on their dependencies, allowing independent migration of unrelated applications while maintaining proper sequencing for related applications. This segmentation enables parallel processing of independent groups while ensuring reliability within each dependency chain.
Solution Approach 2:
The system implements feedback by continuously monitoring migration progress and using the relationship matrix to dynamically adjust the migration sequence. The migrator receives feedback about completed migrations and uses this information to determine the next applications to migrate, ensuring that dependency requirements are always satisfied. This feedback mechanism maintains high migration speed while guaranteeing reliability through real-time coordination.
Data Source
AI summary
Embodiments described herein relate to methods, systems, and non-transitory computer readable mediums storing instructions for creating and executing migration workflows to replicate or migrate data (collectively referred to herein as ‘migration’) from one device or set of devices to another device or set of devices (e.g., from one computing environment to another). The method of migration involves determining periods of time when the application has decreased use or idle time. This decreased use or idle time is used to determine the optimal time to perform a migration of the application. Based on the calculated migration time as well as the time it takes to load the application after migration, the maintenance planner can alert users and help insure a successful migration.