SYSTEMS AND METHODS FOR DATAFLOW GRAPH OPTIMIZATION

(19)

(11)

EP 4 250 135 A8

(12)	CORRECTED EUROPEAN PATENT APPLICATION
	Note: Bibliography reflects the latest situation

(15)	Correction information:
	Corrected version no 1 (W1 A2)

(48)	Corrigendum issued on:
	13.12.2023 Bulletin 2023/50

(43)	Date of publication:
	27.09.2023 Bulletin 2023/39

(21)	Application number: 23191246.0

(22)	Date of filing: 22.05.2019

(51)

International Patent Classification (IPC):

G06F 16/901^(2019.01)

(52)	Cooperative Patent Classification (CPC):
	G06F 8/433; G06F 8/443; G06F 16/9024

(84)	Designated Contracting States:
	AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

(30)

Priority:

30.05.2018 US 201815993284

(62)	Application number of the earlier application in accordance with Art. 76 EPC:
	19730617.8 / 3803570

(71)	Applicant: AB Initio Technology LLC
	Lexington, Massachusetts 02421 (US)

(72)	Inventor:
	DICKIE, Garth Allen Framingham, MA 01702 (US)

(74)	Representative: Herrmann, Daniel et al
	Boehmert & Boehmert Anwaltspartnerschaft mbB Pettenkoferstrasse 22 80336 München 80336 München (DE)


	Remarks:
	This application was filed on 14-08-2023 as a divisional application to the application mentioned under INID code 62.

(54)	SYSTEMS AND METHODS FOR DATAFLOW GRAPH OPTIMIZATION

(57) At least one non-transitory computer-readable storage medium storing processor-executable instructions that, when executed by at least one computer hardware processor, cause the at least one computer hardware processor to perform: obtaining an automatically generated initial dataflow graph, the initial dataflow graph comprising a first plurality of nodes representing a first plurality of data processing operations and a first plurality of links representing flows of data among nodes in the first plurality of nodes; and generating an updated dataflow graph by iteratively applying dataflow graph optimization rules to update the initial dataflow graph, the updated dataflow graph comprising a second plurality of nodes representing a second plurality of data processing operations and a second plurality of links representing flows of data among nodes in the second plurality of nodes.