Abstract: This disclosure relates generally to method and system for predicting batch processes. Conventional batch schedulers provide a single point of control for defining and monitoring background executions in a distributed network. The method of the present disclosure obtains a set of batch jobs from one or more users to generate a set of batch graphs by deriving a metadata. Further, a set of batch models is generated for the set of batch graphs. The set of batch models includes at least one of a forecasting model, a job-job regression model, and a job-workload regression model. Further, a batch job schedule is generated for the set of batch graphs to predict a revised batch job schedule with a real time feed and the set of batch models. Additionally, a proactive notification is sent to each user alarming one or more unexpected delays indicating the revised batch job schedule.

Abstract: A system for smart alerts in a batch system for an IT enterprise. The method includes alert configuration by identifying recent steady state of a batch job and deriving schedules for the steady state. The normal behaviour is then computed within the schedules. The method further includes aggregating the one or more alerts by identifying correlated group of alerts by pruning of one or more jobs and alerts, detecting correlations between the two or more alerts and deriving causality of the grouped alerts. The method finally includes predicting of future alerts of a batch job.

Abstract: A method for managing alerts generated in an enterprise environment is described. The method comprises discarding, by a processor, one or more duplicate alerts based on one or more predetermined rules, wherein a duplicate alert is an instance of an alert occurring within a duplicate alert arrival time associated with the alert. The method further comprises obtaining an alert correlation signature associated with the alert from a database, wherein the alert correlation signature comprises information associated with one or more alerts correlated to the alert. The method further comprises, obtaining, from the database, a temporal signature associated with the alert, wherein the temporal signature indicates a probable time of occurrence of the alert. Further, the alert, the alert correlation signature, and the temporal signature are transmitted to a computing device of a user of the enterprise environment.

Abstract: Systems and methods for generating a blueprint for an enterprise is provided. The system obtains information pertaining to an enterprise from data sources, extracts entities from the information, and identifies relationships across the entities, performs conflict resolution check on the information received from the data sources based on pre-defined rules, identifies one or more missing links in the information. The system further computes a completeness score for the information based on at least one of the conflict resolution check and the missing links, and generates a blueprint of the information and the one or more entities for the enterprise. Authentic data sources are identified from the data sources based on at least one of assigned weight, and one or more instances of, and contribution by, the data sources in the information. The completeness score is computed based on the instances and contribution of the sources in the information.

Abstract: System and method for analyzing and prioritizing issues for automation are disclosed. In an embodiment, a method for addressing issues associated with automation, and more particularly to, system and method for analyzing and prioritizing issues for automation is disclosed. The problem of analyzing and prioritizing issues for automation that result in benefits is disclosed. The present disclosure proposes to select only those issues for automation that are expected to last long enough to repay cost invested in their automation. Further, the proposed approach prioritizes the issues on the basis of benefits realized by automation of an issue with respect to cost of implementing automation and savings in the cost of resolution of the issue due to automation. Furthermore, the proposed approach compares and contrasts two case studies and demonstrates how the inherent differences about the domain get captured through this approach and are reflected in various steps of automation prioritization.

Abstract: Systems and methods for generating a blueprint for an enterprise is provided. The system obtains information pertaining to an enterprise from data sources, extracts entities from the information, and identifies relationships across the entities, performs conflict resolution check on the information received from the data sources based on pre-defined rules, identifies one or more missing links in the information. The system further computes a completeness score for the information based on at least one of the conflict resolution check and the missing links, and generates a blueprint of the information and the one or more entities for the enterprise. Authentic data sources are identified from the data sources based on at least one of assigned weight, and one or more instances of, and contribution by, the data sources in the information. The completeness score is computed based on the instances and contribution of the sources in the information.

Abstract: System and method for prioritizing and planning issues in automation is disclosed. The system and method prioritizes the issues by considering various cost and benefit factors associated with automation of the issues. The issues that are best suited for automation are identified and a plan for automation prioritization of the issues is presented. An approach to evaluate day-zero automation potential is disclosed. Further, a comprehensive blueprint of each issue is built in the form of an operations graph. The blueprint of each issue is analyzed and the issue is evaluated on various aspects of cost, quality, and risk. Further, a systematic plan for automation is made and a business case is generated.

Abstract: A system for smart alerts in a batch system for an IT enterprise. The method includes alert configuration by identifying recent steady state of a batch job and deriving schedules for the steady state. The normal behaviour is then computed within the schedules. The method further includes aggregating the one or more alerts by identifying correlated group of alerts by pruning of one or more jobs and alerts, detecting correlations between the two or more alerts and deriving causality of the grouped alerts. The method finally includes predicting of future alerts of a batch job.

Abstract: A method for managing alerts generated in an enterprise environment is described. The method comprises discarding, by a processor, one or more duplicate alerts based on one or more predetermined rules, wherein a duplicate alert is an instance of an alert occurring within a duplicate alert arrival time associated with the alert. The method further comprises obtaining an alert correlation signature associated with the alert from a database, wherein the alert correlation signature comprises information associated with one or more alerts correlated to the alert. The method further comprises, obtaining, from the database, a temporal signature associated with the alert, wherein the temporal signature indicates a probable time of occurrence of the alert. Further, the alert, the alert correlation signature, and the temporal signature are transmitted to a computing device of a user of the enterprise environment.

Abstract: This disclosure relates generally to computing devices, and more particularly to transition of IT operations. In one embodiment, a method and system is provided for generating an efficient transition plan for IT operations while addressing aspects such as coverage, risk, time, and cost. The IT operations are modeled through graphs and use well-defined problems in graph theory to build solutions. Heavy hitter issues are identified to maximize coverage. To minimize risk, severity of an issue is determined, wherein the severity is based on the instability caused or penalties associated with the issue. Further, transition time is minimized by finding issue-communities for parallel transition by finding maximum cliques. Yet further, the bin-packing algorithm is used to optimize the teams of resolvers and thus minimize cost. Finally, a transition plan is generated by systematically identifying issue communities for transition using the minimum hitting set and minimum vertex cover problem.