Bingting Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Bingting Jiang has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Kenli Li
Hunan University
3 shared publications - Zhuo Tang
Hunan University
3 shared publications Jing Yao
School of Computer Science and engineering, Central South University, Changsha, China
2 shared publications- Xiong Xiao
Hunan University, Changsha, China
2 shared publications - Baolong Guo
Institute of Intelligent Control and Image Engineering, Xidian University, Xian, China
1 shared publication - Chuanying Li
College of Computer Science and Electronic Engineering, Hunan University, Changsha, China
1 shared publication
Latest Publications
- Open Access
- 13 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 22 (4) , 1-26
ASSG: Enhanced Workload Balancing via Adaptive State Scheduling Granularity Approach for Stateful Distributed Stream Processing
The dynamic changes in the distribution of data attributes within the data stream lead to unbalanced workloads in stream processing operators, often necessitating state migration in these operators. However, significant time overhead associated with state migration results in latency peaks and interruptions in stream applications. Ignoring the impact of state scheduling granularity exacerbates the time overhead during migration. Focusing on state migration efficiency, this article presents the Adaptive State Scheduling Granularity (ASSG) approach for stateful distributed stream processing. The ASSG conducts dynamic workload balancing at the granularity of state subgroups, where the number and size of any subgroup can be adaptively adjusted to reduce the time of collecting workloads and generating balancing plans. Moreover, since the idle instances may experience higher workloads than average due to receiving the migrated states, we propose a parallel migration strategy. They are enabled to post low states to other instances while receiving the high ones, alleviating the workload imbalance without extending migration duration. ASSG has been fully implemented on Apache Flink, which demonstrates a 23.84% reduction in average latency compared to state-of-the-art workload balancing schemes and achieves at least a 10.91% reduction in the time required for state migration through adaptive granularity adjustment.
- 13 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 22 (4) , 1-26
Open AccessASSG: Enhanced Workload Balancing via Adaptive State Scheduling Granularity Approach for Stateful Distributed Stream Processing
The dynamic changes in the distribution of data attributes within the data stream lead to unbalanced workloads in stream processing operators, often necessitating state migration in these operators. However, significant time overhead associated with state migration results in latency peaks and interruptions in stream applications. Ignoring the impact of state scheduling granularity exacerbates the time overhead during migration. Focusing on state migration efficiency, this article presents the Adaptive State Scheduling Granularity (ASSG) approach for stateful distributed stream processing. The ASSG conducts dynamic workload balancing at the granularity of state subgroups, where the number and size of any subgroup can be adaptively adjusted to reduce the time of collecting workloads and generating balancing plans. Moreover, since the idle instances may experience higher workloads than average due to receiving the migrated states, we propose a parallel migration strategy. They are enabled to post low states to other instances while receiving the high ones, alleviating the workload imbalance without extending migration duration. ASSG has been fully implemented on Apache Flink, which demonstrates a 23.84% reduction in average latency compared to state-of-the-art workload balancing schemes and achieves at least a 10.91% reduction in the time required for state migration through adaptive granularity adjustment.
- 6 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Network
- Vol. 39 (3) , 285-292
Decentralized Unlearning for Trustworthy AI-Generated Content (AIGC) Services
The widespread adoption of AI-Generated Content (AIGC) has captured remarkable interests from academia and industry. However, this advancement brings forth challenges in data ownership, as emphasized by the General Data Protection Regulation’s right to be forgotten. The right to be forgotten allows participants to erase their data contributions from well-trained AIGC models. Training AIGC models demands an extensive amount of data and computations, often surpassing the capabilities of individual participants. As a solution, Federated Learning (FL) is employed to collaboratively train an AIGC model without sharing raw data directly. To protect the right to be forgotten in FL, “federated unlearning” has been introduced to eradicate the data contributions of unlearning participants from fully trained AIGC models, achieved by deleting historical model updates. However, given that historical updates are distributed among various participants, they may still hold contributions from the unlearning participants. This presents a challenge to the trustworthiness of federated unlearning. In this paper, we first provide an overview of both centralized and federated learning and unlearning methods. We survey relevant works and classify four main categories for federated unlearning. Subsequently, we introduce a comprehensive decentralized unlearning architecture designed for trustworthy AIGC services. To address the challenge of participants retaining historical contributions from unlearning participants, we integrate a coded computing-based interaction mechanism, ensuring both scalability and security. We further present a case study using NanoGPT to demonstrate the effectiveness of the proposed framework for decentralized unlearning. We conclude by identifying potential future research directions.
- 6 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Network
- Vol. 39 (3) , 285-292
Decentralized Unlearning for Trustworthy AI-Generated Content (AIGC) Services
The widespread adoption of AI-Generated Content (AIGC) has captured remarkable interests from academia and industry. However, this advancement brings forth challenges in data ownership, as emphasized by the General Data Protection Regulation’s right to be forgotten. The right to be forgotten allows participants to erase their data contributions from well-trained AIGC models. Training AIGC models demands an extensive amount of data and computations, often surpassing the capabilities of individual participants. As a solution, Federated Learning (FL) is employed to collaboratively train an AIGC model without sharing raw data directly. To protect the right to be forgotten in FL, “federated unlearning” has been introduced to eradicate the data contributions of unlearning participants from fully trained AIGC models, achieved by deleting historical model updates. However, given that historical updates are distributed among various participants, they may still hold contributions from the unlearning participants. This presents a challenge to the trustworthiness of federated unlearning. In this paper, we first provide an overview of both centralized and federated learning and unlearning methods. We survey relevant works and classify four main categories for federated unlearning. Subsequently, we introduce a comprehensive decentralized unlearning architecture designed for trustworthy AIGC services. To address the challenge of participants retaining historical contributions from unlearning participants, we integrate a coded computing-based interaction mechanism, ensuring both scalability and security. We further present a case study using NanoGPT to demonstrate the effectiveness of the proposed framework for decentralized unlearning. We conclude by identifying potential future research directions.
- 23 August 2023
- Published by Springer Nature in The Visual Computer
- Vol. 40 (4) , 2599-2614
Fast shape recognition via a bi-level restraint reduction of contour coding
- 23 August 2023
- Published by Springer Nature in The Visual Computer
- Vol. 40 (4) , 2599-2614
Fast shape recognition via a bi-level restraint reduction of contour coding
- 24 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Big Data
- Vol. 10 (6) , 827-838
SBPA: Sybil-Based Backdoor Poisoning Attacks for Distributed Big Data in AIoT-Based Federated Learning System
Federated learning (FL) enables a great deal of distributed independent participants to collaborate in training without sharing data. Malicious adversary can poison the local model by backdoor poisoning attacks and utilize the characteristic that server cannot trace original data to make the poisoned model directly aggregated. Especially in the AIoT-FL network that generates large amounts of data in real-time, such an attack is more powerful. In this paper, we design a sybil-based backdoor poisoning attacks (SBPA) against the above vulnerability. Malicious participants inject backdoor triggers into distributed Big Data to covertly complete data poisoning. During subsequent iterative aggregation, the joint model activates the backdoor during testing to achieve misclassification for the backdoor images. Besides, malicious participants create some sybil nodes to join the aggregation by taking advantage of the vulnerability of system devices to be easily disconnected. They are committed to making the poisoned local models aggregated with higher probability. Their goal works on making the final global model misclassify backdoor images while keeping high classification accuracy on the other non-backdoor samples. We conduct extensive experiments on multiple datasets and exhibit more robust performance than the state-of-the-art in various metrics under both data distribution including i.i.d. and non-i.i.d. scenarios.
- 24 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Big Data
- Vol. 10 (6) , 827-838
SBPA: Sybil-Based Backdoor Poisoning Attacks for Distributed Big Data in AIoT-Based Federated Learning System
Federated learning (FL) enables a great deal of distributed independent participants to collaborate in training without sharing data. Malicious adversary can poison the local model by backdoor poisoning attacks and utilize the characteristic that server cannot trace original data to make the poisoned model directly aggregated. Especially in the AIoT-FL network that generates large amounts of data in real-time, such an attack is more powerful. In this paper, we design a sybil-based backdoor poisoning attacks (SBPA) against the above vulnerability. Malicious participants inject backdoor triggers into distributed Big Data to covertly complete data poisoning. During subsequent iterative aggregation, the joint model activates the backdoor during testing to achieve misclassification for the backdoor images. Besides, malicious participants create some sybil nodes to join the aggregation by taking advantage of the vulnerability of system devices to be easily disconnected. They are committed to making the poisoned local models aggregated with higher probability. Their goal works on making the final global model misclassify backdoor images while keeping high classification accuracy on the other non-backdoor samples. We conduct extensive experiments on multiple datasets and exhibit more robust performance than the state-of-the-art in various metrics under both data distribution including i.i.d. and non-i.i.d. scenarios.
- 10 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 33 (8) , 1811-1824
Efficient and Automated Deployment Architecture for OpenStack in TianHe SuperComputing Environment
Recently, with the large-scale outbreak of the global financial crisis and public safety incidents (such as COVID-19), high-performance computing has been widely applied to risk prediction, vaccine development, and other fields. In scenarios where high-performance computing infrastructure responds to the instantaneous explosion of computing demands, a crucial issue is to provide large-scale flexible allocation and adjustment of computing capability by rapidly constructing computing clusters. Existing large-scale computing cluster deployment solutions usually utilize source code deployment or other deployment tools. The great challenge of existing deployment methods is to reduce excessive image distribution time and refrain from configuration defects. In this article, we design an intelligent distributed registry deployment (IDRD) architecture based on the OpenStack cloud platform, which adaptively places distributed image repositories using the containerized deployment of multiple registries. We propose a server load priority algorithm to solve multiple registries placement problems in IDRD. Furthermore, we devise a clustering algorithm based on demand density that can optimize the global performance of IDRD and improve large-scale cluster load balancing capabilities, which has been implemented in the TianHe Supercomputing environment. Extensive experimental results demonstrate that IDRD can effectively reduce$30\%$ -$50\%$ of the distribution time of component images and significantly improve the efficiency of large-scale cluster deployment.- 10 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 33 (8) , 1811-1824
Efficient and Automated Deployment Architecture for OpenStack in TianHe SuperComputing Environment
Recently, with the large-scale outbreak of the global financial crisis and public safety incidents (such as COVID-19), high-performance computing has been widely applied to risk prediction, vaccine development, and other fields. In scenarios where high-performance computing infrastructure responds to the instantaneous explosion of computing demands, a crucial issue is to provide large-scale flexible allocation and adjustment of computing capability by rapidly constructing computing clusters. Existing large-scale computing cluster deployment solutions usually utilize source code deployment or other deployment tools. The great challenge of existing deployment methods is to reduce excessive image distribution time and refrain from configuration defects. In this article, we design an intelligent distributed registry deployment (IDRD) architecture based on the OpenStack cloud platform, which adaptively places distributed image repositories using the containerized deployment of multiple registries. We propose a server load priority algorithm to solve multiple registries placement problems in IDRD. Furthermore, we devise a clustering algorithm based on demand density that can optimize the global performance of IDRD and improve large-scale cluster load balancing capabilities, which has been implemented in the TianHe Supercomputing environment. Extensive experimental results demonstrate that IDRD can effectively reduce$30\%$ -$50\%$ of the distribution time of component images and significantly improve the efficiency of large-scale cluster deployment.