Tengteng Cheng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Tengteng Cheng has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Guosun Zeng
Department of Computer Science and Technology, Tongji University, Shanghai, China
3 shared publications - Zhipeng Sun
School of Cyber Science and Engineering, Ningbo University of Technology, Ningbo, China
2 shared publications Chunling Ding
College of Chemical Science and Engineering, Tongji University, Shanghai, China
1 shared publicationGuosun Zeng
Department of Computer Science and Technology Tongji University Shanghai China
1 shared publicationShun Wang
College of Information and Management Science Henan Agricultural University Zhengzhou China
1 shared publication- Yufei Jin
School of Computer Science and Technology, Tongji University, Shanghai 201804, China
1 shared publication
Latest Publications
- Open Access
- 22 October 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (21) , 10457
A Star-Based Graph Partitioning Approach to Support “Master–Slave” Parallel Computing
Graph partitioning is a key step in the parallel and distributed processing of big graphs, aimed at improving efficiency while balancing load and reducing communication overhead. However, conventional partitioning methods often produce irregular inter-block communication patterns, leading to complex coordination costs. To address this issue, we propose a star-based graph partitioning approach that organizes partition blocks into a master–slave topology, where all inter-block communication is centralized through a master block. This structured design simplifies communication patterns and enhances parallel execution efficiency. Based on a cost-aware representation of graph processing, we formulate a partitioning objective that minimizes the overhead of the master block while maintaining balanced slave partitions. To achieve this, we develop a two-stage framework including initial partition generation and iterative refinement. The refinement stage incorporates a master minimization strategy and a slave balancing strategy to further improve partition quality. Extensive experiments on multiple benchmark datasets demonstrate that the proposed method effectively reduces communication overhead, improves parallelism, and provides an interpretable partitioning structure for distributed graph processing.
- 22 October 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (21) , 10457
Open AccessA Star-Based Graph Partitioning Approach to Support “Master–Slave” Parallel Computing
Graph partitioning is a key step in the parallel and distributed processing of big graphs, aimed at improving efficiency while balancing load and reducing communication overhead. However, conventional partitioning methods often produce irregular inter-block communication patterns, leading to complex coordination costs. To address this issue, we propose a star-based graph partitioning approach that organizes partition blocks into a master–slave topology, where all inter-block communication is centralized through a master block. This structured design simplifies communication patterns and enhances parallel execution efficiency. Based on a cost-aware representation of graph processing, we formulate a partitioning objective that minimizes the overhead of the master block while maintaining balanced slave partitions. To achieve this, we develop a two-stage framework including initial partition generation and iterative refinement. The refinement stage incorporates a master minimization strategy and a slave balancing strategy to further improve partition quality. Extensive experiments on multiple benchmark datasets demonstrate that the proposed method effectively reduces communication overhead, improves parallelism, and provides an interpretable partitioning structure for distributed graph processing.
- 28 September 2025
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 37 (25-26)
A Balanced Partitioning Method for Big Graphs via Coarsen‐Partition‐Refining Steps With Preserving Atomic Subgraphs
Atomic subgraphs are inherent and functionally meaningful structures in real‐world graphs, capturing cohesive units such as social communities, molecular functional groups, or neural circuits. Preserving these atomic subgraphs during graph partitioning is crucial for maintaining semantic integrity, improving algorithmic interpretability, and reducing communication overhead in parallel processing. However, traditional partitioning methods often overlook this structural prior, leading to fragmentation of such subgraphs and degradation in downstream analytical quality. In this work, we propose a novel balanced graph partitioning approach that explicitly preserves atomic subgraphs through a coarsen‐partition‐refine framework. In the coarsening phase, smaller subgraphs are merged into a larger one based on the maximum edge‐to‐vertex weight ratio between subgraphs. In the partitioning phase, a spectral k ‐way method divides the coarsened graph into k balanced blocks. In the refinement phase, boundary subgraphs are exchanged between target blocks via designed rules, reducing cut‐edge weights and ultimately yielding higher‐quality balanced partitions. We evaluate our method on real‐world and synthetic datasets by generating graphs with diverse subgraph distributions. The experimental results demonstrate the feasibility and effectiveness of our method.
- 28 September 2025
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 37 (25-26)
A Balanced Partitioning Method for Big Graphs via Coarsen‐Partition‐Refining Steps With Preserving Atomic Subgraphs
Atomic subgraphs are inherent and functionally meaningful structures in real‐world graphs, capturing cohesive units such as social communities, molecular functional groups, or neural circuits. Preserving these atomic subgraphs during graph partitioning is crucial for maintaining semantic integrity, improving algorithmic interpretability, and reducing communication overhead in parallel processing. However, traditional partitioning methods often overlook this structural prior, leading to fragmentation of such subgraphs and degradation in downstream analytical quality. In this work, we propose a novel balanced graph partitioning approach that explicitly preserves atomic subgraphs through a coarsen‐partition‐refine framework. In the coarsening phase, smaller subgraphs are merged into a larger one based on the maximum edge‐to‐vertex weight ratio between subgraphs. In the partitioning phase, a spectral k ‐way method divides the coarsened graph into k balanced blocks. In the refinement phase, boundary subgraphs are exchanged between target blocks via designed rules, reducing cut‐edge weights and ultimately yielding higher‐quality balanced partitions. We evaluate our method on real‐world and synthetic datasets by generating graphs with diverse subgraph distributions. The experimental results demonstrate the feasibility and effectiveness of our method.
- 22 August 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (2) , 2838-2861
A big graph clustering method to support parallel processing by perceiving graph’s application algorithm semantics
- 22 August 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (2) , 2838-2861
A big graph clustering method to support parallel processing by perceiving graph’s application algorithm semantics
- 15 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (1) , 803-814
A Streaming Graph Partitioning Method to Achieve High Cohesion and Equilibrium via Multiplayer Repeated Game
With the advent of 5G era, Internet-of-Things will become possible, and a large amount of correlative data, namely the streaming graph (SG), is continuously generated in various application fields, which poses a great challenge to analyze and make good use of such graph data. The balanced partition of a big graph, especially a dynamic SG, has always been basic research in graph theory, and there are many classical methods. However, this article explores a novel method, that is, an SG $k$ -way partitioning via a multiplayer repeated game so as to realize the equilibrium of the total number of nodes in different partitions and achieve high cohesion or low edge-cut in each partition. We regard the SG partitioning process during each time window as a multiplayer game process, treat $k$ target partitions as game players, and use all possible actions that players select new nodes as the strategy set. Some effective constraints are given to reduce the strategy space and accelerate the game process. Moreover, we define equilibrium degree (ED) and modularity degree (MD), which are used to design the utility function of game players. All game players finally reach the Nash equilibrium via multiplayer repeated games. At this time, each player corresponds to a strategy. Under the guidance of these strategies, the new nodes are added to each target partition, and then the goal of optimal partitioning is achieved. The above operations are carried out in each time window. The subsequent time windows can reuse the partitioning results of the previous time window in order to realize dynamic incremental partitioning for an SG. Extensive experiments indicate that while ensuring the partition quality of an SG, our proposed algorithm also greatly improves the speed of online partitioning. Even compared with the state-of-the-art SG partitioning algorithm PLDG, our algorithm still obtains better performance.
- 15 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (1) , 803-814
A Streaming Graph Partitioning Method to Achieve High Cohesion and Equilibrium via Multiplayer Repeated Game
With the advent of 5G era, Internet-of-Things will become possible, and a large amount of correlative data, namely the streaming graph (SG), is continuously generated in various application fields, which poses a great challenge to analyze and make good use of such graph data. The balanced partition of a big graph, especially a dynamic SG, has always been basic research in graph theory, and there are many classical methods. However, this article explores a novel method, that is, an SG $k$ -way partitioning via a multiplayer repeated game so as to realize the equilibrium of the total number of nodes in different partitions and achieve high cohesion or low edge-cut in each partition. We regard the SG partitioning process during each time window as a multiplayer game process, treat $k$ target partitions as game players, and use all possible actions that players select new nodes as the strategy set. Some effective constraints are given to reduce the strategy space and accelerate the game process. Moreover, we define equilibrium degree (ED) and modularity degree (MD), which are used to design the utility function of game players. All game players finally reach the Nash equilibrium via multiplayer repeated games. At this time, each player corresponds to a strategy. Under the guidance of these strategies, the new nodes are added to each target partition, and then the goal of optimal partitioning is achieved. The above operations are carried out in each time window. The subsequent time windows can reuse the partitioning results of the previous time window in order to realize dynamic incremental partitioning for an SG. Extensive experiments indicate that while ensuring the partition quality of an SG, our proposed algorithm also greatly improves the speed of online partitioning. Even compared with the state-of-the-art SG partitioning algorithm PLDG, our algorithm still obtains better performance.