JOINING OPERATOR GRAPH ELEMENTS VIA WHOLE PROGRAM OPTIMIZATION

• US 20160364218A1
• Filed: 07/02/2015
• Published: 12/15/2016
• Est. Priority Date: 06/10/2015
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: BARSNESS, Eric Lawrence, BRANSON, Michael John, CAREY, James Edward, SANTOSUOSSO, John M.
• Granted Patent: US 10,175,962 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 8/41 Compilation
• CPC Class Codes: G06F 8/43 Checking; Contextual analysis
• CPC Class Codes: G06F 9/46 Multiprogramming arrangements
• CPC Class Codes: G06F 9/5027 the resource being a machine, e.g. CPUs, Servers, Terminals

Abstract

Techniques disclosed herein describe joining processing elements (e.g., of a streams processing environment) using optimization techniques, such as by whole program optimization. An optimization tool evaluates multiple processing elements based on one or more optimization rules. The optimization tool identifies, based on the evaluation, processing elements that can be merged. The optimization tool joins the identified processing elements together.

Claims

1. A method comprising:

evaluating a plurality of processing elements organized in an operator graph, wherein the plurality of processing elements includes at least a first processing element and a second processing element;

determining, based on the evaluation, that the first processing element and the second processing element satisfy at least one optimization rule; and

joining the first processing element with the second processing element.

2. The method of claim 1, further comprising, prior to joining the first processing element with the second processing element:

generating a suggestion to join the first processing element with the second processing element; and

presenting the suggestion in an interface associated with the operator graph.

3. The method of claim 2, further comprising, prior to joining the first processing element with the second processing element:

receiving, via the interface, a selection of the first processing element and the second processing element in response to the suggestion.

4. The method of claim 1, wherein the at least one optimization rule specifies that the first processing element should be joined with the second processing element based on at least (i) a type of the first processing element being compatible with a type of the second processing element, (ii) a function performed by the first processing element being identical to a function performed by the second processing element, and (iii) input data processed by the first processing element and the second processing element.

5. The method of claim 1, wherein the processing elements are of a streams processing environment.

6. The method of claim 1, wherein evaluating the plurality of processing elements comprises:

evaluating the first processing element relative to each of the plurality of processing elements in the operator graph based on the one or more optimization rules.

7. The method of claim 1, wherein joining the first processing element with the second processing element comprises:

merging instruction code of the first processing element and the second processing element into a third processing element.