# Patent

## Title
Data integration on retargetable engines in a networked environment

## Abstract

Techniques are disclosed for data integration on retargetable engines in a networked environment. The networked environment includes data processing engines of different types and having different sets of characteristics. A request is received execute a data flow model in the networked environment. The data flow model includes data flow objects. A first data processing engine is programmatically selected based on a predefined set of criteria and the sets of characteristics of the data processing engines. The data flow model is executed using the selected data processing engine and responsive to the request.

## Background
BACKGROUND
1. Field of the Invention
Embodiments disclosed herein relate to data integration. More specifically, embodiments disclosed herein relate to data integration on retargetable engines in a networked environment.
2. Description of the Related Art
Cloud computing environments often include a master computing device and multiple worker computing devices. Work is distributed from the master computing device into the cloud and to the worker computing devices within the cloud. The worker computing devices perform the work and return the results to the master computing device. The master computing device then assembles the results received from the worker computing devices.
SUMMARY
Embodiments presented in this disclosure provide a computer-implemented method for data integration on retargetable engines in a networked environment. The method includes receiving a first request to execute a data flow model in the networked environment. The networked environment includes data processing engines of different types, where each of the data processing engines has a different set of characteristics, and where the data flow model includes a plurality of data flow objects. The method also includes programmatically selecting a first data processing engine from the data processing engines, based on a first predefined set of criteria and the sets of characteristics of the data processing engines. The method also includes executing the data flow model using the first data processing engine and responsive to the first request.
Other embodiments presented in this disclosure provide a computer program product for data integration on retargetable engines in a networked environment. The computer program product includes a computer-readable storage medium having program code embodied therewith. The program code is executable by one or more computer processors to receive a first request to execute a data flow model in the networked environment. The networked environment includes data processing engines of different types, where each of the data processing engines has a different set of characteristics, and where the data flow model includes a plurality of data flow objects. The program code is also executable to programmatically select a first data processing engine from the data processing engines, based on a first predefined set of criteria and the sets of characteristics of the data processing engines. The program code is also executable in order to execute the data flow model using the first data processing engine and responsive to the first request.
Still other embodiments presented in this disclosure provide a system for data integration on retargetable engines in a networked environment. The system includes one or more computer processors and a memory containing a program which, when executed by the one or more computer processors, is configured to perform an operation that includes receiving a first request to execute a data flow model in the networked environment. The networked environment includes data processing engines of different types, where each of the data processing engines has a different set of characteristics, and where the data flow model includes a plurality of data flow objects. The operation also includes programmatically selecting a first data processing engine from the data processing engines, based on a first predefined set of criteria and the sets of characteristics of the data processing engines. The operation also includes executing the data flow model using the first data processing engine and responsive to the first request.



BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS
So that the manner in which the above recited aspects are attained and can be understood in detail, a more particular description of embodiments of the invention, briefly summarized above, may be had by reference to the appended drawings.
It is to be noted, however, that the appended drawings illustrate only typical embodiments of this invention and are therefore not to be considered limiting of its scope, for the invention may admit to other equally effective embodiments.
FIG. 1 is a block diagram illustrating components of an application for data integration on retargetable engines in a networked environment, according to one embodiment presented in this disclosure.
FIG. 2 is a data flow diagram depicting processing logic of a request handler component of the application, according to one embodiment presented in this disclosure.
FIG. 3 is a flowchart depicting processing logic of an engine manager component of the application, according to one embodiment presented in this disclosure.
FIG. 4 is a flowchart depicting processing logic of a score composer component of the application, according to one embodiment presented in this disclosure.
FIG. 5 is a flowchart depicting processing logic of an execution manager component of the application, according to one embodiment presented in this disclosure.
FIG. 6 is a flowchart depicting processing logic of an engine selector component of the application, according to one embodiment presented in this disclosure.
FIG. 7 is a table depicting predefined correlations between elements of a decision matrix and job success rate, according to one embodiment presented in this disclosure.
FIG. 8 depicts a data flow model of a sequential job, according to one embodiment presented in this disclosure.
FIG. 9 depicts a job success rate model for the data flow model, according to one embodiment presented in this disclosure.
FIG. 10 depicts a job success rate model for parallel execution of two instances of the data flow model, according to one embodiment presented in this disclosure.
FIG. 11 depicts a job success rate model for parallel execution of two instances of the data flow model that further includes additional operators, according to one embodiment presented in this disclosure.
FIG. 12 depicts a job success rate model for parallel execution of two instances of the data flow model with a system startup element, according to one embodiment presented in this disclosure.
FIG. 13 depicts a parallel engine data flow, according to one embodiment presented in this disclosure.
FIG. 14 illustrates a data flow model for a distributed computing data flow, according to one embodiment presented in this disclosure.
FIG. 15 illustrates a data flow model that includes additional tasks performed for a distributed computing data flow, according to one embodiment presented in this disclosure.
FIG. 16 is a flowchart depicting a method to determine an appropriate processing engine for a desired task, according to one embodiment presented in this disclosure.
FIG. 17 is a flowchart depicting a method for data integration on retargetable engines in a networked environment, according to one embodiment presented in this disclosure.
FIG. 18 is a flowchart depicting a subsequent method for data integration on retargetable engines in a networked environment, according to one embodiment presented in this disclosure.
FIG. 19 is a block diagram illustrating components of a networked system configured for data integration on retargetable engines, according to one embodiment presented in this disclosure.
FIG. 20 is a block diagram illustrating a cloud computing node for data integration on retargetable engines, according to one embodiment presented in this disclosure.
FIG. 21 illustrates a cloud computing environment for data integration on retargetable engines, according to one embodiment presented in this disclosure.
FIG. 22 illustrates abstraction model layers of the cloud computing environment for data integration on retargetable engines, according to one embodiment presented in this disclosure.



DETAILED DESCRIPTION
Efforts of organizations in meeting business requirements while lowering cost may often be aided by cloud computing, which provides infrastructure, platform, software, and process as services, and which may often simplify adoption by the organizations. A cloud computing environment, also referred to herein as a cloud environment, may include different types of applications, of which one example is data integration applications. Data integration applications may often be designed to run in networked environments, such as symmetric multiprocessing (SMP), massively parallel processing (MPP), cluster, or grid environments, that include only a single data processing engine, also referred to herein as a processing engine. On the other hand, in a cloud computing environment, multiple data processing engines may coexist and share common resources. A client may submit a job request to the cloud computing environment, without needing to know or specify any particular data processing engine for running the desired job. An example of a job request is a request to execute a desired data flow. Programmatically choosing an appropriate data processing engine to run the desired job may be one of the challenges posed in migrating data integration to the cloud computing environment.
In some embodiments and as discussed in further detail herein, one approach to resolve this challenge involves a perspective of retargetable engines. In one embodiment, an application is provided that is configured to select a data processing engine based on job characteristics and execution requirements. The data processing engine may be selected from a set of data processing engines of different types. Examples of different types of data processing engines include parallel processing engines and distributed computing engines. For example, a parallel processing engine may be a scalable data integration processing engine, while an example of a distributed computing engine is a scalable distributed computing engine for cloud computing environments, such as HadoopTM, available from Apache Software Foundation. The distributed computing engine may also include a MapReduce model, which provides an interface to facilitate meeting various data integration needs.
At least in some embodiments, the respective paradigms of parallel processing engines and MapReduce each involves parallelizing programs by partitioning data across multiple processes in both a pipeline and partitioned manner. However, the two execution mechanisms may differ dramatically in terms latency, because the parallel processing engines may use inter-process communication (IPC) mechanisms for data transfer, whereas MapReduce applications may use file-system mechanisms for data transfer. As a result, jobs that do not cause pipeline breaks or stalls may often run faster—even an order of magnitude faster in some cases—on parallel processing engines than on MapReduce applications.
On the other hand, the MapReduce paradigm may provide a higher level of fault tolerance than parallel processing engines at least in some embodiments, because all state information is stored on the file system. Doing so may at least in some cases avoid job failures caused by failure of a single mapper process. The higher level of fault tolerance may be especially important for any single, significantly large-scale parallel jobs, where the likelihood of a particular process failing may be relatively higher.
In some embodiments, data processing engines of multiple paradigms may be available to run a desired job. Accordingly, at least some embodiments disclosed herein provide empirical models for programmatically selecting an appropriate data processing engine for running the desired job and without requiring any user input specifying any desired data processing engine. The data processing engine may be selected based on predefined criteria. Examples of the predefined criteria include input data, job design complexity, application logic, performance requirement, latency requirement, fault tolerance, checkpoint restart, parallelism, resource utilization, parallel execution setup cost, etc. Further, due to the dynamic nature of the predefined criteria, the appropriate data processing engine may vary from execution to execution, even for the same desired job. By providing retargetable engines, the needs of desired jobs may be more readily met, even as the needs change over time, such as in terms of data volume, required execution time, number of partitions, etc.
One embodiment provides a decision-making job-execution system for efficiently running a data flow using a selected data processing engine in a networked environment, such as a cloud environment. The data processing engine may be selected upon determining that the data processing engine best satisfies predefined criteria, such as one or more of speed, efficiency, resource consumption, job execution success rate, user-specified execution time constraints, etc. In some embodiments, the application may also include multiple application components, also referred to herein as components.
FIG. 1 is a block diagram 100 illustrating components of an application 108 for data integration on retargetable engines in a networked environment, according to one embodiment presented in this disclosure. As shown, the application 108 includes a request handler 114, an engine selector 116, an engine manager 118, a score composer 120, and an execution manager 122, also referred to herein as a process manager. In one embodiment, the application 108 receives a job run request 104 from a client 102. The application 108 may also receive additional information 106 associated with the job run request 104, such as a data flow description, a job execution requirement, etc. Based on the job run request 104 and the additional information 106, the application 108 selects one of the parallel engines 112 in the execution environment 110, for running the desired job. The desired job may then run on the selected parallel engine 112. As described above, because the needs of the same job may vary from execution to execution, the application 108 may select a different parallel engine 112 for a subsequent execution of the application 108 in the execution environment 110.
In one embodiment, the request handler 114 manages integration of and interaction among all the components of the application 108. The request handler 114 may be responsible for invoking a series of operations needed for processing the job run request 104. The engine manager 118 may be responsible for running the desired job on the appropriate processing engine. To this end, the engine manager 118 may invoke the engine selector 116 to select the appropriate processing engine based on predefined criteria. The engine manager 118 may also invoke the score composer 120 to generate an execution plan for the selected processing engine. The engine manager 118 may also invoke the execution manager 122 to implement the generated execution plan on the selected processing engine.
In one embodiment, the engine selector 116 may be responsible for selecting an appropriate processing engine for running a desired job. At least in some embodiments, the processing engine may be selected based on a predefined model that has predefined criteria as inputs to the model. Examples of the predefined criteria include the job toplogy associated with the desired job, the parallelization capacity for each operator in the topology, the unit cost of reading and writing a fixed block of data to the backing store, the expected mean time between failures (MTBF) for the desired job, etc. The parallelization capacity, also referred to herein as parallelization potential, represents a measure of scalability of an individual component in a data flow.
Accordingly, the engine selector 116 may automatically select an appropriate processing engine on which to run a desired job, based on a size of the input data associated with the desired job and based further on the computing resources available in the cloud environment. Further, the same job may be submitted with different execution requirements, which may in turn result in selection of a different processing engine for running the job.
In one embodiment, the score composer 120 is responsible for generating the execution plan for the given job on the selected processing engine. As stated above, the execution manager 122 may be configured to implement the execution plan of the given job on the selected processing engine. Accordingly, the techniques disclosed herein may be adopted to facilitate migrating data integration processes to desired network environments, such as cloud computing environments. At least in some embodiments, the data integration processes may be migrated to a unified networked environment that supports multiple data processing engines, such as parallel processing engine and distributed computing engine. Further, the target, or selected, processing engine may vary from execution to execution of the same data flow, thereby providing the retargetable property of each processing engine in the networked environment. The desired job is executed on a processing engine that is deemed by the application 108 as being most suitable for executing the desired job, based on predefined criteria such as job characteristics and execution requirements. To this end, a job execution plan for the desired job and that is specific to the selected processing engine is generated, and execution of the desired job commences on the selected processing engine based on the job execution plan. Consequently, desired jobs may be executed more efficiently in the networked environment at least in some cases.
In some embodiments, in order to evaluate the predefined criteria to select a processing engine, the application 108 generates a decision matrix that may include multiple elements. In a particular embodiment, the decision matrix includes a job topology complexity index, a job application logic complexity index, a job performance index, and a job high availability index. Depending on the embodiment, each index may be represented as a numerical or string value. Based on the decision matrix, a job success rate may also be determined. Depending on the embodiment, the job success rate may be considered part of or external to the decision matrix. Further, each of the elements other than the job success rate may be individually examined to determine its impact on the job success rate. An appropriate processing engine may then be selected based on the decision matrix. The job success rate may also be referred to as a job success likelihood or a job success probability.
In one embodiment, the application 108 uses empirical modeling to determine the job success rate and to select the appropriate processing engine. For example, in a particular empirical model, a data flow includes one or more branches, and each branch is either independent, which is characterized by no sharing of operators, or correlated with another branch via one or more operators. A branch contains a chain of operators arranged in terms of producing and consuming sequences. The failure rate of an operator is equal to the estimated execution time divided by the MTBF, whereas the success rate of an operator is equal to one minus its failure rate. The success rate of a branch on one partition is equal to the multiplication of the success rate of each operator on that partition, while the success rate of a branch on all partitions is equal to the average success rate of all partitions. The success rate of a branch counting startup is equal to the average success rate of all partitions multiplied by the success rate of branch startup. The success rate of a data flow is equal to the minimum success rate among all branches. On the other hand, in an alternative empirical model, the success rate is determined by the success rate of all physical nodes and an extra cost needed for maintaining a desired level of high availability.
FIG. 2 is a data flow diagram 200 depicting processing logic of the request handler 114 of FIG. 1, according to one embodiment presented in this disclosure. As shown, upon receiving a request 210, the request handler 114 determines the type of the received request (step 220). In one embodiment, the request handler 114 supports different types of requests, including a check engine request, a validate job request, and a run job request. If the request is a check engine request, then the request handler 114 invokes a check engine handler 250 in order to generate a list of available processing engines. If the request is a validate job request, then the request handler 114 invokes a validate job handler 230 in order to verify the design and configuration of a specified data flow to ensure that the data flow is valid. If the request is a run job request, then the request handler 114 invokes a run job handler 240 to manage aspects pertaining to executing a desired job. The processing logic and the types of requests supported by the request handler 114 may be tailored to suit the needs of a particular case.
FIG. 3 is a flowchart 300 depicting processing logic of the engine manager 118 of FIG. 1, according to one embodiment presented in this disclosure. As shown, the flowchart 300 begins at step 310, where the engine manager 118 receives request information such as a data flow description, job execution requirements, etc. At step 320, the engine manager 118 determines whether a processing engine is pre-selected. If not, then the engine manager 118 selects a suitable processing engine based on the request information and according to the empirical model described above (step 325). At step 330, the engine manager 118 generates an execution plan for the desired job and specific to the selected or preselected processing engine. At step 340, the engine manager 118 executes the desired job by running the execution plan. After the step 340, the flowchart 300 ends.
FIG. 4 is a flowchart 400 depicting processing logic of the score composer 120 of FIG. 1, according to one embodiment presented in this disclosure. As shown, the flowchart 400 begins at step 410, where the score composer 120 receives request information such as a data flow description, job execution requirements, a target engine specification, etc. At step 420, the score composer 120 determines whether the target engine is the parallel processing engine. If so, the score composer 120 generates a parallel execution plan for the desired job (step 425). On the other hand, if the score composer 120 determines that the target engine is the distributed processing engine rather than the parallel processing engine (step 430), then the score composer 120 generates a distributed execution plan for the desired job (step 435). The score composer 120 then serializes and stores the generated parallel or distributed execution plan to storage (step 440). After the step 440 or if no processing engine is selected, the flowchart 400 ends. The number and specific types of processing engines supported may be tailored to suit the needs of a particular case.
FIG. 5 is a flowchart 500 depicting processing logic of the execution manager 122 of FIG. 1, according to one embodiment presented in this disclosure. As shown, the flowchart 500 begins at step 510, where the execution manager 122 receives a job execution plan for the desired job. The execution manager 122 then determines the type of the target engine based on the job execution plan. If the target engine is the parallel processing engine (step 520), the execution manager 122 commences execution of the job execution plan on the parallel processing engine in the networked environment (step 525). On the other hand, if the target engine is the distributed processing engine rather than the parallel processing engine (530), then the execution manager 122 commences execution of the job execution plan on the distributed computing engine in the networked environment (step 535). After the steps 525 or 535 or if no matching processing engine is identified, the flowchart 500 ends.
FIG. 6 is a flowchart 600 depicting processing logic of the engine selector 116 of FIG. 1, according to one embodiment presented in this disclosure. As shown, the flowchart 600 begins at step 601, where the engine selector 116 receives request information such as a data flow description, job execution requirements, etc. The engine selector 116 then selects a processing engine based on predefined criteria. At least in some embodiments, the predefined criteria may be a job success rate that is determined based on a decision matrix generated by the engine selector 116. In such embodiments, the processing engine having the highest job success rate is selected. Apart from the job success rate, the decision matrix may include four elements cover various factors associated with a job run request, where the factors may be static or dynamic. For example, as described above, the decision matrix may include the job topology complexity index, the job application complexity index, the job performance index, and the job high availability index.
In one embodiment, the engine selector 116 performs one or more of the following steps to generate the decision matrix. The engine selector 116 analyzes the data flow topology of the desired job (step 602) and application logic of each stage in the data flow (step 604). The engine selector 116 then estimates resource utilization associated with the desired job (step 606). The engine selector 116 then examines job execution requirements (step 608) and considers fault tolerance checkpoints and restart requirements, if any (step 610). In performing these steps, the engine selector 116 may determine one or more of a job topology complexity index 616, a job application logic complexity index 620, a job performance index 624, and a job high availability index 628. Depending on the embodiment, a single index of each type may be generated for a given job, or multiple indices of the same type may be generated for the available processing environment, each index specific to a different processing environment. Based on the generated indices, the engine selector 116 may generate one or more of a startup cost 618 associated with the job topology complexity index 616, a runtime cost 622 associated with the job application logic complexity index 620, a runtime cost 626 associated with the job performance index 624, and a startup and runtime cost 630 associated with the job high availability index 628. The engine selector 116 may then determine a job success rate 614 for each available processing environment, based on the decision matrix (step 612). After the step 612, the flowchart 600 ends.
In one embodiment, the job topology complexity index is determined as a predefined function of one or more of number of branches in the data flow of the desired job, the number of operators in each branch, the number of data sources, the number of data sinks, and the number of operators requiring intermediate storage. The job application logic complexity index is determined as a predefined function of one or more of the number of operators that require data be sorted and the number of operators which processing logic includes mapping, merging, aggregation, transformation, passthrough, etc. The job performance index is determined as a measure of estimated resource consumption and as a function of job statistics obtained from previous executions of the desired job. The job high availability index is determined based on whether a given processing engine supports fault tolerance and job restart. The elements of the decision matrix and the predefined functions may be tailored to suit the needs of a particular case.
FIG. 7 is a table 700 depicting predefined correlations 706 between elements of the decision matrix 702 and job success rate, according to one embodiment presented in this disclosure. The job success rate may be determined by the empirical model described above. In the table 700, the correlation between the job success rate and each element in the decision matrix is represented as a down arrow (↓) to indicate that the job success rate decreases and an up arrow (↑) to indicate that the success rate increases, when the each element of the decision matrix changes according to values 704. Accordingly, as shown by the values 704 and the correlations 706, the job success rate is inversely correlated with the job topology complexity index and the job application logic complexity index, respectively. Further, the job success rate is directly correlated with the job performance index and the job high available index, respectively. Further still, in some embodiments, the job high availability index may affect the other indices. For instance, in order to maintain high availability, a processing engine may in some cases need to incur input/output (I/O) costs from reading and writing data to and from storage before incurring processing costs in sending the data to the next process. Adding extra tasks for data transport increases the values of the job topology complexity index and the job application logic complexity index and decreases the value of the job performance index. The elements of the decision matrix and the correlations may be tailored to suit the needs of a particular case.
FIG. 8 depicts a data flow model 800 of a sequential job, according to one embodiment presented in this disclosure. At least in some embodiments, the data flow model 800 is a distributed processing data flow rather than a parallel processing data flow. As shown, the data flow model 800 has two data flow objects including a first operator 802 and a second operator 804. In one embodiment, to determine a job success rate of executing the data flow model 800, a model may first be generated based on the data flow model 800.
FIG. 9 depicts a job success rate model 900 for the data flow model 800 of FIG. 8, according to one embodiment presented in this disclosure. As shown, the job success rate model 900 includes multiple scenarios. The scenarios include a scenario 902 in which the first operator 802 succeeds, a scenario in which the first operator 802 fails, a scenario 906 in which the second operator 804 succeeds, and a scenario 908 in which the second operator 804 fails. Let FA represent the failure rate of the first operator 802, and let FB represent the failure rate of the second operator 804. In one embodiment, the success rate of the data flow as a whole may then be given by:

SuccessRate=(1−FA)*(1−FB)  (Equation 1)

In cases where an application is installed but is not running and hence cannot fail, the above model may be further expressed as:

SuccessRate=(1−TA/MTBFA)*(1−TB/MTBFB)  (Equation 2)

Where TA refers to total execution time of the first operator 802, TB refers to the total execution time of the second operator 804, MTBFA refers to the mean time between failures of operator A, and MTBFB refers to the mean time between failures of operator B. In some embodiments, there could be many causes of operator failure. For instance, a network switch may time out when an operator is making a network call, or the file system may hang when an operator is writing to the file system. In one embodiment, assuming that the environment is configured correctly and is in an operational state, the MTBF describes the expected time it takes, on average, for the operator to fail due to a hardware or software problem.

FIG. 10 depicts a job success rate model 1000 for parallel execution of two instances 1002 of the data flow model 800 of FIG. 8, according to one embodiment presented in this disclosure. Assume that the entire job is successful only if both pipelines are successful, each pipeline executing a separate instance 1002 of the data flow model. Assuming further that inputs are equally partitioned, then in one embodiment, the success rate for the entire job may be modeled as:

SuccessRate=0.5*(1−TA1/MTBFA)*(1−TB1/MTBFB)+0.5*(1−TA2/MTBFA)*(1−TB2/MTBFB)  (Equation 3)

In one embodiment, to generalize the above equation further, the job success rate for a data flow with n-way parallel equal partition may be modeled as:

SuccessRate=Σ1/n *(1−TA1/MTBFA)*(1−TB1/MTBFB)  (Equation 4)

where i is from 1 to n.

FIG. 11 depicts a job success rate model 1100 for parallel execution of two instances 1102 of the data flow model 800 that further includes additional operators, according to one embodiment presented in this disclosure. As shown, the additional operators may include at least operators 1104 and 1106. The job success rate model 1100 generalizes the number of operators in the data flow to an arbitrary number of operators N. In one embodiment, the job success rate may be given by:

SuccessRate=Σ1/n*(1−TAi/MTBFA)*(1−TBi/MTBFB)* . . . *(1−TNi/MTBFN)  (Equation 5)

FIG. 12 depicts a job success rate model 1200 for parallel execution of two instances of the data flow model with a system startup element 1202, according to one embodiment presented in this disclosure. At least in some embodiments, a parallel processing engine has an initial startup phase, during which the parallel processing engine parses an Orchestrate Shell (OSH) script, invokes the score composer 120 to generate a parallel engine score to represent the parallel execution plan, and instantiates a network of processes on a set of nodes that form a parallel engine cluster for the parallel processing engine. The initial startup phase is represented as the system startup element 1202 in FIG. 12. After establishing all required processes, the data processing phase is entered. In one embodiment, the processes of different types include a conductor process, section leader processes, and player processes, which are communicatively organized into a hierarchy, with the conductor process as the root node in the hierarchy and with the player processes as leaf nodes in the hierarchy. At least in some embodiments, the player processes are also communicatively connected to one another. In order to more accurately model the job success rate, the potential startup failure is also taken into account. To this end, the job success rate may be expressed as:

SuccessRate=(1−StartupFailureRate)*Σ1/n*(1−TAi/MTBFA)*(1−TBi/MTBFB)* . . . *(1−TNi/MTBFN)  (Equation 6)

FIG. 13 depicts a parallel engine data flow 1300, according to one embodiment presented in this disclosure. At least in some embodiments, a parallel engine data flow may contain any number of branches, each branch including a chain of operators of selected from a set of operators 1302. The success rate for each branch may be determined using the empirical model described above. The success rate for the entire parallel engine data flow 1300 may then be determined as the minimum success rate among all branches contained in the parallel engine data flow 1300. As shown, the parallel engine data flow 1300 merges and branches out at an operator 13023. In one embodiment, the parallel engine data flow 1300 may be considered to include the following distinct branches:







TABLE I





Branches in the parallel engine data flow


















Branch 1:
{Op1, Op2, Op3, Op4, Op5, . . . , OpN}



Branch 2:
{Op1, Op2, Op3, OpK4, OpK5, . . . , OpKn}



Branch 3:
{OpK1, OpK2, Op3, Op4, Op5, . . . , OpN}



Branch 4:
{OpK1, OpK2, Op3, OpK4, OpK5, . . . , OpKn}










The job success rate of the parallel engine data flow 1300 may be determined by performing a set of operations including identifying all the branches in the parallel engine data flow. The set of operations further includes determining a success rate for each branch using the empirical model described above. The set of operations further includes designating the minimum success rate among the branches as the job success rate for the parallel engine data flow 1300.

In one embodiment, the success rate for each branch in the parallel engine data flow may be determined based on a predefined algorithm. One such algorithm is illustrated in Table II.







TABLE II





Algorithm for identifying branches in the parallel engine data flow
















1.
Select an input data source operator that has not yet been searched.


2.
Select one of output links that has not yet been checked.


3.
Follow the output link to its consuming operator, marking the output



link as checked.


4.
If the current operator is a data sink or does not have any unchecked



output links, go to step 6.


5.
Repeat steps 2 to 4.


6.
Start from the current operator.


7.
Follow the most recently traversed input link to its producing



operator.


8.
If the producing operator has at least another consuming operator



attached to it, go to that operator and repeat steps 2 to 7.


9.
Repeat steps 7 to 8 until the input data source operator from step 1 is



reached.


10.
Repeat steps 2 to 9 until all output links of the input data source



operator from step 1 are checked.


11.
Mark the input data source operator as searched.


12.
Unmark all links that are checked.


13.
Repeat steps 1 to 12 until all input data source operators have been



searched.









Hence, the job success rate of any parallel engine data flow may be determined more efficiently or conveniently at least in some cases. Further, the operations for determining the job success rate and for identifying branches may be tailored to suit the needs of a particular case.

FIG. 14 illustrates a data flow model 1400 for a distributed computing data flow, according to one embodiment presented in this disclosure. The data flow model 1400 is described in conjunction with the MapReduce model of Hadoop. As shown, the data flow model 1400 includes a map wrapper 1402 for a first operator and further includes a reducer wrapper 1404 for a second operator. In one embodiment, the map wrapper 1402 is a wrapper function for a map operation, while the reduce wrapper 1404 is a wrapper function for a reduce operation. Further, in one embodiment, the map operation accepts a series of key/value pairs, processes each pair, and generates zero or more output key/value pairs, while the reduce operation iterates through the values associated with each key and produces zero or more outputs. At least in some embodiments, the Hadoop framework performs additional tasks to manage input split, output serialization, replication, deserialization, etc.
FIG. 15 illustrates a data flow model 1500 that includes additional tasks performed for a distributed computing data flow, according to one embodiment presented in this disclosure. The additional tasks are represented by split operations 1502, sort operations 1504 and merge operations 1506. The Hadoop engine may include checkpoint/resume capability and speculative execution mode, such that if one task fails on one physical node, the failed task may be moved to a different node for retry. In some embodiments, the default replication factor of the file-system component of Hadoop, Hadoop Distributed File System (HDFS), may be configured to an arbitrarily high value, such that ever job eventually succeeds unless each physical node in the cluster fails. Accordingly, in one embodiment, the job success rate for the Hadoop engine may be modeled as:

SuccessRate=1−F1*F2* . . . *Fn  (Equation 7)

where Fi has a value range of (0, 1) and represents a failure rate of a physical node i.

Consequently, in one embodiment, distributed computing jobs, such as Hadoop jobs, may have a higher job success rate, because job failure often only occurs when all nodes fail, as compared to parallel processing jobs, where job failure occurs if any of the nodes fails. In one embodiment, the criteria used in selecting the appropriate processing engine further takes into consideration other factors such as a service level agreement associated with a requesting client, a hardware investment factor, a system response time factor, a job complexity factor, etc.
FIG. 16 is a flowchart depicting a method 1600 to determine an appropriate processing engine for a desired task, according to one embodiment presented in this disclosure. As shown, the method 1600 begins at step 1610, where the application 108 reads a predefined script and builds a predefined object to represent the data flow. An example of the predefined script is an OSH script, while an example of a predefined object is an Applied Parallel Technologies step object, also referred to as an APT_Step object. At step 620, the application 108 reads a predefined configuration file, such as an operator reliability profile. In some embodiments, each operator not having any entry in the operator reliability profile is assumed to have a failure rate of 1*10−6. At step 1630, the application 108 evaluates the job against one or more predefined rules. To this end, the application 108 may determine whether the desired job is a real-time job that requires low latency, whether the desired job contains message queuing (MQ) (i.e., the data flow contains an MQ connector that requires guaranteed message delivery), and whether the desired job involves database writes. If so, the application 108 runs the data flow on the parallel processing engine (step 1690). Otherwise, the method 1600 proceeds to step 1640.
In one embodiment, for any other type of data flow, the application 108 may take into account resource utilization estimates, e.g., CPU utilization, total execution time for individual operators, I/O activity estimates, etc. Using the resource utilization estimates as input into the job success rate model for the parallel processing engine, in order to determine a job success rate. To this end, the application 108 may generate a decision matrix for the parallel processing engine (step 1640) and then computes a job success rate for the parallel processing engine and by using the empirical model described above (step 1650). The application 108 may then generate a decision matrix for the distributed computing engine (step 1660) and then computes a job success rate for the distributed computing engine and by using the empirical model described above (step 1670). The application 108 then determines which job success rate is higher (step 1680). If the job success rate for the parallel processing engine is higher, then the application 108 runs the desired job on the parallel processing engine (step 1690). On the other hand, if the job success rate of the distributed computing engine is higher, then the application 108 runs the desired job on the distributed computing engine (step 1695). After the step 1690 or 1695, the method 1600 terminates.
Although some embodiments are herein described in conjunction with parallel processing engines and distributed computing engines, other engine types are broadly contemplated. In this regard, the number and specific types of engines may also be tailored to suit the needs of a particular case. In cases where there are more than two available types of engines available, the application 108 selects the engine having a highest job success rate as determined via the steps described above, or via similar embodiments.
FIG. 17 is a flowchart depicting a method 1700 for data integration on retargetable engines in a networked environment, according to one embodiment presented in this disclosure. As shown, the method 1700 begins at step 1710, where the application 108 receives a first request to execute a data flow model in the networked environment. The networked environment includes data processing engines of different types. Each of the data processing engines has a different set of characteristics. Further, the data flow model includes one or more data flow objects. At step 1720, the application 108 programmatically selects a first data processing engine from the data processing engines, based on a first predefined set of criteria and the sets of characteristics of the data processing engines. At step 1730, the application 108 executes the data flow model using the first data processing engine and responsive to the first request. After the step 1730, the method 1700 terminates.
FIG. 18 is a flowchart depicting a subsequent method 1800 for data integration on retargetable engines in a networked environment, according to one embodiment presented in this disclosure. As shown, the method 1800 begins at step 1810 where, subsequent to executing the data flow model using the first data processing engine, the application 108 receives a second request to execute the data flow model in the networked environment. At step 1820, the application 108 programmatically selects a second data processing engine of a different type than the first data processing engine, based on a second predefined set of criteria and the sets of characteristics of the data processing engines. At step 1830, the application 108 executes the data flow model using the second data processing engine and responsive to the second request. After the step 1830, the method 1800 terminates.
Embodiments disclosed herein provide techniques for data integration on retargetable engines in desired network environments, such as cloud computing environments. By selecting data processing engines based on the predefined criteria and according to the empirical models disclosed herein, data flows may be executed more efficiently at least in some cases—at least relative to alternative approaches that rely on other bases for selecting data processing engines. Examples of alternative approaches include approaches that do not consider the predefined criteria disclosed herein and approaches that rely on user input specifying a desired data processing engine to use.
FIG. 19 is a block diagram illustrating components of a networked system 1900 configured for data integration on retargetable engines, according to one embodiment presented in this disclosure. The networked system 1900 includes a computer 1902. The computer 1902 may also be connected to other computers via a network 1930. In general, the network 1930 may be a telecommunications network and/or a wide area network (WAN). In a particular embodiment, the network 1930 is the Internet.
The computer 1902 generally includes a processor 1904 connected via a bus 1912 to a memory 1906, a network interface device 1910, a storage 1908, an input device 1914, and an output device 1916. The computer 1902 is generally under the control of an operating system. Examples of operating systems include IBM z/OS®, UNIX, versions of the Microsoft Windows® operating system, and distributions of the Linux® operating system. More generally, any operating system supporting the functions disclosed herein may be used. The processor 1904 is included to be representative of a single CPU, multiple CPUs, a single CPU having multiple processing cores, and the like. Similarly, the memory 1906 may be a random access memory. While the memory 1906 is shown as a single identity, it should be understood that the memory 1906 may comprise a plurality of modules, and that the memory 1906 may exist at multiple levels, from high speed registers and caches to lower speed but larger DRAM chips. The network interface device 1910 may be any type of network communications device allowing the computer 1902 to communicate with other computers via the network 1930.
The storage 1908 may be a persistent storage device. Although the storage 1908 is shown as a single unit, the storage 1908 may be a combination of fixed and/or removable storage devices, such as fixed disc drives, solid state drives, floppy disc drives, tape drives, removable memory cards or optical storage. The memory 1906 and the storage 1908 may be part of one virtual address space spanning multiple primary and secondary storage devices.
The input device 1914 may be any device for providing input to the computer 1902. For example, a keyboard, a mouse, a touchpad, voice commands, or any combination thereof may be used. The output device 1916 may be any device for providing output to a user of the computer 1902. For example, the output device 1916 may be any display screen or set of speakers. Although shown separately from the input device 1914, the output device 1916 and input device 1914 may be combined. For example, a display screen with an integrated touch-screen may be used.
As shown, the memory 1906 of the computer 1902 includes the application 108 of FIG. 1. Depending on the embodiment, one or more of the components of the application 108 as depicted in FIG. 1 may execute on the computer 1902 or on one or more other computers operatively connected to the computer 1902 via the network 1930. Further, the client 102 and the execution environment 110 of FIG. 1 may each also execute on one or more other computers operatively connected to the computer 1902 via the network 1930.
In the preceding, reference is made to embodiments presented in this disclosure. However, the scope of the present disclosure is not limited to specific described embodiments. Instead, any combination of the following features and elements, whether related to different embodiments or not, is contemplated to implement and practice contemplated embodiments. Furthermore, although embodiments disclosed herein may achieve advantages over other possible solutions or over the prior art, whether or not a particular advantage is achieved by a given embodiment is not limiting of the scope of the present disclosure. Thus, the preceding aspects, features, embodiments and advantages are merely illustrative and are not considered elements or limitations of the appended claims except where explicitly recited in a claim(s). Likewise, reference to “the invention” shall not be construed as a generalization of any inventive subject matter disclosed herein and shall not be considered to be an element or limitation of the appended claims except where explicitly recited in a claim(s).
Aspects presented in this disclosure may be embodied as a system, method or computer program product. Accordingly, aspects disclosed herein may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects disclosed herein may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects disclosed herein may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the computer of a user, partly on the computer of the user, as a stand-alone software package, partly on the computer of the user and partly on a remote computer, or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the computer of the user via any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects presented in this disclosure are described above with reference to flowchart illustrations or block diagrams of methods, apparatus (systems) and computer program products according to embodiments disclosed herein. It will be understood that each block of the flowchart illustrations or block diagrams, and combinations of blocks in the flowchart illustrations or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart or block diagram block or blocks.
It is understood in advance that although this disclosure includes a detailed description on cloud computing, implementation of the teachings recited herein are not limited to a cloud computing environment. Rather, embodiments of the present invention are capable of being implemented in conjunction with any other type of computing environment now known or later developed.
For convenience, the Detailed Description includes the following definitions which have been derived from the “Draft NIST Working Definition of Cloud Computing” by Peter Mell and Tim Grance, dated Oct. 7, 2009.
Cloud computing is a model of service delivery for enabling convenient, on-demand network access to a shared pool of configurable computing resources (e.g., networks, network bandwidth, servers, processing, memory, storage, applications, virtual machines, and services) that can be rapidly provisioned and released with minimal management effort or interaction with a provider of the service. This cloud model may include at least five characteristics, at least three service models and at least four deployment models.
Characteristics are as follows:
On-demand self-service: a cloud consumer can unilaterally provision computing capabilities, such as server time and network storage, as needed automatically without requiring human interaction with the service's provider.
Broad network access: capabilities are available over a network and accessed through standard mechanisms that promote use by heterogeneous thin or thick client platforms (e.g., mobile phones, laptops and PDAs).
Resource pooling: the provider's computing resources are pooled to serve multiple consumers using a multi-tenant model, with different physical and virtual resources dynamically assigned and reassigned according to demand. There is a sense of location independence in that the consumer generally has no control or knowledge over the exact location of the provided resources but may be able to specify location at a higher level of abstraction (e.g., country, state or datacenter).
Rapid elasticity: capabilities can be rapidly and elastically provisioned, in some cases automatically, to quickly scale out and rapidly released to quickly scale in. To the consumer, the capabilities available for provisioning often appear to be unlimited and can be purchased in any quantity at any time.
Measured service: cloud systems automatically control and optimize resource use by leveraging a metering capability at some level of abstraction appropriate to the type of service (e.g., storage, processing, bandwidth and active user accounts). Resource usage can be monitored, controlled and reported providing transparency for both the provider and consumer of the utilized service.
Service Models are as follows:
Software as a Service (SaaS): the capability provided to the consumer is to use the provider's applications running on a cloud infrastructure. The applications are accessible from various client devices through a thin client interface such as a web browser (e.g., web-based e-mail). The consumer does not manage or control the underlying cloud infrastructure including network, servers, operating systems, storage or even individual application capabilities, with the possible exception of limited user-specific application configuration settings.
Platform as a Service (PaaS): the capability provided to the consumer is to deploy onto the cloud infrastructure consumer-created or acquired applications created using programming languages and tools supported by the provider. The consumer does not manage or control the underlying cloud infrastructure including networks, servers, operating systems or storage, but has control over the deployed applications and possibly application hosting environment configurations.
Infrastructure as a Service (IaaS): the capability provided to the consumer is to provision processing, storage, networks and other fundamental computing resources where the consumer is able to deploy and run arbitrary software, which can include operating systems and applications. The consumer does not manage or control the underlying cloud infrastructure but has control over operating systems storage, deployed applications, and possibly limited control of select networking components (e.g., host firewalls).
Deployment Models are as follows:
Private cloud: the cloud infrastructure is operated solely for an organization. It may be managed by the organization or a third party and may exist on-premises or off-premises.
Community cloud: the cloud infrastructure is shared by several organizations and supports a specific community that has shared concerns (e.g., mission, security requirements, policy and compliance considerations). It may be managed by the organizations or a third party and may exist on-premises or off-premises.
Public cloud: the cloud infrastructure is made available to the general public or a large industry group and is owned by an organization selling cloud services.
Hybrid cloud: the cloud infrastructure is a composition of two or more clouds (private, community, or public) that remain unique entities but are bound together by standardized or proprietary technology that enables data and application portability (e.g., cloud bursting for load-balancing between clouds).
A cloud computing environment is service oriented with a focus on statelessness, low coupling, modularity and semantic interoperability. At the heart of cloud computing is an infrastructure comprising a network of interconnected nodes.
Referring now to FIG. 20, a schematic of an example of a cloud computing node for data integration on retargetable engines is shown. Cloud computing node 10 is only one example of a suitable cloud computing node and is not intended to suggest any limitation as to the scope of use or functionality of embodiments of the invention described herein. Regardless, cloud computing node 10 is capable of being implemented and/or performing any of the functionality set forth hereinabove.
In cloud computing node 10 there is a computer system/server 12, which is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well-known computing systems, environments, and/or configurations that may be suitable for use with computer system/server 12 include, but are not limited to, personal computer systems, server computer systems, thin clients, thick clients, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputer systems, mainframe computer systems, and distributed cloud computing environments that include any of the above systems or devices, and the like.
Computer system/server 12 may be described in the general context of computer system-executable instructions, such as program modules, being executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, and so on that perform particular tasks or implement particular abstract data types. Computer system/server 12 may be practiced in distributed cloud computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed cloud computing environment, program modules may be located in both local and remote computer system storage media including memory storage devices.
As shown in FIG. 20, computer system/server 12 in cloud computing node 10 is shown in the form of a general-purpose computing device. The components of computer system/server 12 may include, but are not limited to, one or more processors or processing units 16, a system memory 28, and a bus 18 that couples various system components including system memory 28 to processor 16.
Bus 18 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus and Peripheral Component Interconnects (PCI) bus.
Computer system/server 12 typically includes a variety of computer system readable media. Such media may be any available media that is accessible by computer system/server 12, and it includes both volatile and non-volatile media, removable and non-removable media.
System memory 28 can include computer system readable media in the form of volatile memory, such as random access memory (RAM) 30 and/or cache memory 32. Computer system/server 12 may further include other removable/non-removable, volatile/non-volatile computer system storage media. By way of example only, storage system 34 can be provided for reading from and writing to a non-removable, non-volatile magnetic media (not shown and typically called a “hard drive”). Although not shown, a magnetic disk drive for reading from and writing to a removable, non-volatile magnetic disk (e.g., a “floppy disk”), and an optical disk drive for reading from or writing to a removable, non-volatile optical disk such as a CD-ROM, DVD-ROM or other optical media can be provided. In such instances, each can be connected to bus 18 by one or more data media interfaces. As will be further depicted and described below, memory 28 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of embodiments of the invention.
Program/utility 40, having a set (at least one) of program modules 42, may be stored in memory 28 by way of example, and not limitation, as well as an operating system, one or more application programs, other program modules, and program data. Each of the operating system, one or more application programs, other program modules and program data or some combination thereof, may include an implementation of a networking environment. Program modules 42 generally carry out the functions and/or methodologies of embodiments of the invention as described herein.
Computer system/server 12 may also communicate with one or more external devices 14 such as a keyboard, a pointing device, a display 24, etc.; one or more devices that enable a user to interact with computer system/server 12; and/or any devices (e.g., network card, modem, etc.) that enable computer system/server 12 to communicate with one or more other computing devices. Such communication can occur via I/O interfaces 22. Still yet, computer system/server 12 can communicate with one or more networks such as a local area network (LAN), a general wide area network (WAN), and/or a public network (e.g., the Internet) via network adapter 20. As depicted, network adapter 20 communicates with the other components of computer system/server 12 via bus 18. It should be understood that although not shown, other hardware and/or software components could be used in conjunction with computer system/server 12. Examples, include, but are not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data archival storage systems, etc.
Referring now to FIG. 21, illustrative cloud computing environment 50 for data integration on retargetable engines is depicted. As shown, cloud computing environment 50 comprises one or more cloud computing nodes 10 with which local computing devices used by cloud consumers, such as, for example, personal digital assistant (PDA) or cellular telephone 54A, desktop computer 54B, laptop computer 54C and/or automobile computer system 54N may communicate. Nodes 10 may communicate with one another. They may be grouped (not shown) physically or virtually, in one or more networks, such as Private, Community, Public, or Hybrid clouds as described hereinabove, or a combination thereof. This allows cloud computing environment 50 to offer infrastructure, platforms and/or software as services for which a cloud consumer does not need to maintain resources on a local computing device. It is understood that the types of computing devices 54A-N shown in FIG. 21 are intended to be illustrative only and that computing nodes 10 and cloud computing environment 50 can communicate with any type of computerized device over any type of network and/or network addressable connection (e.g., using a web browser).
Referring now to FIG. 22, a set of functional abstraction layers provided by cloud computing environment 50 (FIG. 21) for data integration on retargetable engines is shown. It should be understood in advance that the components, layers and functions shown in FIG. 21 are intended to be illustrative only and embodiments of the invention are not limited thereto. As depicted, the following layers and corresponding functions are provided:
Hardware and software layer 60 includes hardware and software components. Examples of hardware components include mainframes, in one example IBM® zSeries® systems; RISC (Reduced Instruction Set Computer) architecture based servers, in one example IBM pSeries® systems; IBM xSeries® systems; IBM BladeCenter® systems; storage devices; networks and networking components. Examples of software components include network application server software, in one example IBM WebSphere® application server software; and database software, in one example IBM DB2® database software. (IBM, zSeries, pSeries, xSeries, BladeCenter, WebSphere, and DB2 are trademarks of International Business Machines Corporation registered in many jurisdictions worldwide)
Virtualization layer 62 provides an abstraction layer from which the following examples of virtual entities may be provided: virtual servers; virtual storage; virtual networks, including virtual private networks; virtual applications and operating systems; and virtual clients.
In one example, management layer 64 may provide the functions described below. Resource provisioning provides dynamic procurement of computing resources and other resources that are utilized to perform tasks within the cloud computing environment. Metering and Pricing provide cost tracking as resources are utilized within the cloud computing environment, and billing or invoicing for consumption of these resources. In one example, these resources may comprise application software licenses. Security provides identity verification for cloud consumers and tasks, as well as protection for data and other resources. User portal provides access to the cloud computing environment for consumers and system administrators. Service level management provides cloud computing resource allocation and management such that required service levels are met. Service Level Agreement (SLA) planning and fulfillment provide pre-arrangement for, and procurement of, cloud computing resources for which a future requirement is anticipated in accordance with an SLA. The SLA generally specifies the services, priorities, responsibilities, guarantees and/or warranties that exist between a service provider and a customer.
Workloads layer 66 provides examples of functionality for which the cloud computing environment may be utilized. Examples of workloads and functions which may be provided from this layer include: mapping and navigation; software development and lifecycle management; virtual classroom education delivery; data analytics processing; transaction processing; and mobile desktop.
Embodiments disclosed herein may be provided to end users through a cloud computing infrastructure. Cloud computing generally refers to the provision of scalable computing resources as a service over a network. More formally, cloud computing may be defined as a computing capability that provides an abstraction between the computing resource and its underlying technical architecture (e.g., servers, storage, networks), enabling convenient, on-demand network access to a shared pool of configurable computing resources that can be rapidly provisioned and released with minimal management effort or service provider interaction. Thus, cloud computing allows a user to access virtual computing resources (e.g., storage, data, applications, and even complete virtualized computing systems) in “the cloud,” without regard for the underlying physical systems (or locations of those systems) used to provide the computing resources.
Typically, cloud computing resources are provided to a user on a pay-per-use basis, where users are charged only for the computing resources actually used (e.g., an amount of storage space consumed by a user or a number of virtualized systems instantiated by the user). A user can access any of the resources that reside in the cloud at any time, and from anywhere across the Internet. In context of the embodiments presented herein, a user may request a data flow to be executed on an appropriate data processing engine available in the cloud. The application 108 may determine the appropriate data processing engine based on predefined criteria and according to an empirical model disclosed herein. Thus, the user may request execution of data flows and access results thereof, from any computing system attached to a network connected to the cloud (e.g., the Internet) and be charged based on the processing environment(s) used.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments disclosed herein. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. Each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special-purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
While the foregoing is directed to embodiments presented in this disclosure, other and further embodiments may be devised without departing from the basic scope of contemplated embodiments, and the scope thereof is determined by the claims that follow.

## Claims

1. A computer-implemented method for data integration on retargetable engines in a networked environment, the computer-implemented method comprising:
receiving a first request specifying to execute a data flow model in the networked environment and based on a first engine property selected from execution efficiency and fault tolerance, wherein the networked environment includes a plurality of data processing engines of different types, wherein each of the plurality of data processing engines has a different set of properties, wherein the data flow model includes a plurality of data flow objects and represents one or more data integration operations;
upon determining that a first data processing engine has a highest capability of the first engine property among the plurality of data processing engines, commencing execution of the data flow model using the first data processing engine, responsive to the first request;
subsequent to commencing execution of the data flow model using the first data processing engine, receiving a second request specifying to execute the data flow model in the networked environment based on a second engine property selected from execution efficiency and fault tolerance, different from the first engine property; and
upon determining, by operation of one or more computer processors, that a second data processing engine, different from the first data processing engine, has a highest capability of the second engine property among the plurality of data processing engines, suspending execution of the data flow model using the first data processing engine and resuming execution of the data flow model using the second data processing engine, wherein execution of the data flow model is retargeted from the first data processing engine to the second data processing engine.

2. The computer-implemented method of claim 1, wherein the first data processing engine is selected for commencing execution, based further on execution speed, data volume, number of partitions, input data, job design complexity, application logic, checkpoint restart, parallelism, resource utilization, and parallel execution setup cost, of which at least one is determined based on job statistics obtained from at least one previous execution of the data flow model.

3. The computer-implemented method of claim 2, wherein the computer-implemented method is for data integration based on retargeting data flow execution between data processing engines of execution efficiency and fault tolerance, respectively, wherein the computer-implemented method is performed by a retargetable engine system having a plurality of components including a request handler component, an engine manager component, an engine selector component, a score composer component, and an execution manger component; wherein the request handler component is configured to: (i) manage interaction among the plurality of components and (ii) invoke one or more predefined operations to process the first request to execute the data flow model; wherein the engine manager component is configured to: (i) invoke the engine selector component to select the first data processing engine and (ii) execute the data flow model using the first data processing engine; wherein the engine selector component is configured to select the first data processing engine to commence execution of the data flow model and further configured to select the second data processing engine to resume execution of the data flow model, based on a plurality of flow properties including job topology complexity, job application logic complexity, resource utilization, job performance, job high availability, and job success probability wherein the score composer component is configured to generate an execution plan for the first data processing engine, based on the data flow model; wherein the execution manager component is configured to implement the generated execution plan for each of the first data processing engine and the second data processing engine.

4. The computer-implemented method of claim 1, wherein the first and second data processing engines are selected by an application comprising at least one of a plurality of components, the plurality of components including a request handler component, an engine manager component, an engine selector component, a score composer component, and an execution manger component.

5. The computer-implemented method of claim 1, wherein at least one of the first and second data processing engines is selected based on at least one flow property selected from job topology complexity, job application logic complexity, resource utilization, job performance, job high availability, and job success probability.

6. The computer-implemented method of claim 1, wherein at least one of the first and second data processing engines is selected based on at least two flow properties selected from job topology complexity, job application logic complexity, resource utilization, job performance, job high availability, and job success probability.

7. A computer program product for data integration on retargetable engines in a networked environment, the computer program product comprising:
a computer-readable storage medium having program code embodied therewith, the program code executable by one or more computer processors to:
receive a first request specifying to execute a data flow model in the networked environment and based on a first engine property selected from execution efficiency and fault tolerance, wherein the networked environment includes a plurality of data processing engines of different types, wherein each of the plurality of data processing engines has a different set of properties, wherein the data flow model includes a plurality of data flow objects and represents one or more data integration operations;
upon determining that a first data processing engine has a highest capability of the first engine property among the plurality of data processing engines, commencing execution of the data flow model using the first data processing engine, responsive to the first request;
subsequent to commencing execution of the data flow model using the first data processing engine, receive a second request specifying to execute the data flow model in the networked environment based on a second engine property selected from execution efficiency and fault tolerance, different from the first engine property; and
upon determining that a second data processing engine, different from the first data processing engine, has a highest capability of the second engine property among the plurality of data processing engines, suspend execution of the data flow model using the first data processing engine and resume execution of the data flow model using the second data processing engine, wherein execution of the data flow model is retargeted from the first data processing engine to the second data processing engine.

8. The computer program product of claim 7, wherein the first data processing engine is selected for commencing execution, based further on execution speed, data volume, number of partitions, input data, job design complexity, application logic, checkpoint restart, parallelism, resource utilization, and parallel execution setup cost, of which at least one is determined based on job statistics obtained from at least one previous execution of the data flow model.

9. The computer program product of claim 8, wherein the computer program product is for data integration based on retargeting data flow execution between data processing engines of execution efficiency and fault tolerance, respectively, wherein the program code is included in a retargetable engine system having a plurality of components including a request handler component, an manager component, an engine selector component, a score composer component, and an execution manger component; wherein the request handler component is configured to: (i) manage interaction among the plurality of components and (ii) invoke one or more predefined operations to process the first request to execute the data flow model; wherein the engine manager component is configured to: (i) invoke the engine selector component to select the first data processing engine and (ii) execute the data flow model using the first data processing engine; wherein the engine selector component is configured to select the first data processing engine to commence execution of the data flow model and further configured to select the second data processing engine to resume execution of the data flow model; wherein the score composer component is configured to generate an execution plan for the first data processing engine, based on the data flow model; wherein the execution manager component is configured to implement the generated execution plan for each of the first data processing engine and the second data processing engine.

10. The computer program product of claim 7, wherein the first and second data processing engines are selected by an application having the program code and comprising at least one of a plurality of components, the plurality of components including a request handler component, an engine manager component, an engine selector component, a score composer component, and an execution manger component.

11. The computer program product of claim 7, wherein at least one of the first and second data processing engines is selected based on at least one flow property selected from job topology complexity, job application logic complexity, resource utilization, job performance, job high availability, and job success probability.

12. The computer program product of claim 7, wherein at least one of the first and second data processing engines is selected based on at least two flow properties selected from job topology complexity, job application logic complexity, resource utilization, job performance, job high availability, and job success probability.

13. A system for data integration on retargetable engines in a networked environment, the system comprising:
one or more computer processors;
a memory containing a program which, when executed by the one or more computer processors, performs an operation comprising:
receiving a first request specifying to execute a data flow model in the networked environment and based on a first engine property selected from execution efficiency and fault tolerance, wherein the networked environment includes a plurality of data processing engines of different types, wherein each of the plurality of data processing engines has a different set of properties, wherein the data flow model includes a plurality of data flow objects and represents one or more data integration operations;
upon determining that a first data processing engine has a highest capability of the first engine property among the plurality of data processing engines, commencing execution of the data flow model using the first data processing engine, responsive to the first request;
subsequent to commencing execution of the data flow model using the first data processing engine, receiving a second request specifying to execute the data flow model in the networked environment based on a second engine property selected from execution efficiency and fault tolerance, different from the first engine property; and
upon determining that a second data processing engine, different from the first data processing engine, has a highest capability of the second engine property among the plurality of data processing engines, suspending execution of the data flow model using the first data processing engine and resuming execution of the data flow model using the second data processing engine, wherein execution of the data flow model is retargeted from the first data processing engine to the second data processing engine.

14. The system of claim 13, wherein the first data processing engine is selected for commencing execution, based further on execution speed, data volume, number of partitions, input data, job design complexity, application logic, checkpoint restart, parallelism, resource utilization, and parallel execution setup cost, of which at least one is determined based on job statistics obtained from at least one previous execution of the data flow model.

15. The system of claim 13, wherein the program comprises at least one of a plurality of components, the plurality of components including a request handler component, an engine manager component, an engine selector component, a score composer component, and an execution manger component.

16. The system of claim 13, wherein at least one of the first and second data processing engines is selected based on at least one flow property selected from job topology complexity, job application logic complexity, resource utilization, job performance, job high availability, and job success probability.

17. The system of claim 13, wherein at least one of the first and second data processing engines is selected based on at least two flow properties selected from job topology complexity, job application logic complexity, resource utilization, job performance, job high availability, and job success probability.