A method for continuous processing of two-level data (ID, HLD, LLD) on a system with a plurality of nodes for processing said data (ID, HLD, LLD), wherein two-level data represents different data types of data linked with each other characterized by the steps of a) Determining a system state representing at least actual and/or possible performance capabilities of the system, b) Determining already processed data on the nodes, c) Splitting the high-level input data (ID/HLD) and assigning the high-level input data (ID/HLD) for processing with lower level data on one or more of the nodes according to the determined system state, processing requirements of the data, and said already processed data in form of at least of lower level data on the nodes such that in case of said already processed data, c1) the data to be processed is compared with said already processed data and c2) where the input data (ID/HLD) of a next time window is split and assigned to said nodes based on an assignment matrix for a next time window, said assignment matrix for the next time window being determined such that - a difference between the assignment matrix for the next time window and the assignment matrix of the current time window is determined and - said difference is minimized by computing a solution to an optimization problem such that the amount of data to be exchanged for processing the input data on the respective nodes is minimized. d) Distributing the split input data to said one or more nodes for processing with said corresponding lower level data, and e) Processing the distributed data on said one or more nodes. a) Determining a system state representing at least actual and/or possible performance capabilities of the system, b) Determining already processed data on the nodes, c) Splitting the high-level input data (ID/HLD) and assigning the high-level input data (ID/HLD) for processing with lower level data on one or more of the nodes according to the determined system state, processing requirements of the data, and said already processed data in form of at least of lower level data on the nodes such that in case of said already processed data, c1) the data to be processed is compared with said already processed data and c2) where the input data (ID/HLD) of a next time window is split and assigned to said nodes based on an assignment matrix for a next time window, said assignment matrix for the next time window being determined such that - a difference between the assignment matrix for the next time window and the assignment matrix of the current time window is determined and - said difference is minimized by computing a solution to an optimization problem such that the amount of data to be exchanged for processing the input data on the respective nodes is minimized. c1) the data to be processed is compared with said already processed data and c2) where the input data (ID/HLD) of a next time window is split and assigned to said nodes based on an assignment matrix for a next time window, said assignment matrix for the next time window being determined such that - a difference between the assignment matrix for the next time window and the assignment matrix of the current time window is determined and - said difference is minimized by computing a solution to an optimization problem such that the amount of data to be exchanged for processing the input data on the respective nodes is minimized. - a difference between the assignment matrix for the next time window and the assignment matrix of the current time window is determined and - said difference is minimized by computing a solution to an optimization problem such that the amount of data to be exchanged for processing the input data on the respective nodes is minimized. d) Distributing the split input data to said one or more nodes for processing with said corresponding lower level data, and e) Processing the distributed data on said one or more nodes.