Understanding data flow graph for improving big data stream computing environments
Summary: High throughput issue is one of the major obstacles for opening up the new big data stream computing era. A high throughput big data stream computing system is need, optimising the data flow graph is an important way to offer a high throughput computing environment in big data stream computing system. In this paper, the definition of data flow graph in big data stream computing is given and the properties of data flow graph are systematically analysed by referring to the stream computing theories. A series of optimisation strategies for data flow graph in big data stream computing environments are put forward, all those strategies will greatly improve the structure of data flow graph, and provide a high throughput environment for big data stream computing.
- Building a fault tolerant framework with deadline guarantee in big data stream computing environments
- Optimizing end-to-end performance of data-intensive computing pipelines in heterogeneous network environments
- Formalizing compute-aggregate problems in cloud computing
- Distributed Resource Allocation in Stream Processing Systems
- Exploring complex and big data
- Formalisation of the multigrid computations
- Mathematical modelling and computer simulation of steady state heat conduction in anisotropic multi-layered bodies
- MHD flow and heat transfer over a stretching porous sheet subject to power law heat flux in the presence of chemical reaction and viscous dissipation
- Study of convergence of homotopy perturbation method for two-dimensional linear Volterra integral equations of the first kind
This page was built for publication: Understanding data flow graph for improving big data stream computing environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2221573)