Wanli Chang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Wanli Chang has a total of 155 co-authors. Here are the top co-authors by number of shared publications:
- Yu Jiang
Tsinghua University, Beijing, China
10 shared publications - Renfa Li
Key Laboratory for Embedded and Network Computing of Hunan Province, College of Computer Science and Electronic Engineering, Hunan University, Changsha, China
6 shared publications - Samarjit Chakraborty
University of North Carolina at Chapel Hill
6 shared publications - Zhuo Su
Beihang University, Beijing, China
6 shared publications - Dongyan Wang
Information Technology Center, Renmin University of China, Beijing, China
5 shared publications Debayan Roy
Huawei Dresden Research Center, München, Germany
4 shared publications
Latest Publications
- Open Access
- 24 August 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 25 (5) , 1-3
Introduction to the Special Issue on Industrial Real-Time Systems (Part I)
- 24 August 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 25 (5) , 1-3
Open AccessIntroduction to the Special Issue on Industrial Real-Time Systems (Part I)
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
Retention-Based Energy-Efficient and High-Core-Utilization Scheduling for Arbitrary-Deadline DAGs
Modern clustered (power-island) multicore processors increasingly expose retention as a low-overhead low-power state, yet exploiting it in real-time systems critically depends on whether the scheduler can create sufficiently long cluster-level all-cores-idle windows that exceed a break-even length. This feasibility bottleneck is particularly acute for always-on arbitrary-deadline Directed Acyclic Graph (DAG) workloads, where precedence-induced execution fluctuations fragment idle times and the relative deadline may exceed the period. This paper proposes a retention-oriented scheduling framework for such workloads, consisting of two algorithms with a clear progression. PRES performs design-time planning and constructs a postponable division for each DAG, reshaping execution to aggregate slack into contiguous cluster-level idle windows; a lightweight event-driven runtime then enforces the plan and triggers retention without increasing online scheduling complexity. Building on PRES, PREHS further improves core utilization via multi-DAG merging and intra-cluster spatial sharing, consolidating workload onto fewer active clusters to reduce static/leakage energy while preserving deadline guarantees. We conduct extensive experiments across diverse cluster configurations and DAG structural characteristics, and further include a case study based on an application-derived DAG from a real-world communication/signal-processing pipeline. The results show that, compared with a representative work-conserving baseline with automatic retention/PG, PREHS reduces static energy consumption by up to 65.62%; moreover, under the same resource constraints, PREHS improves task acceptance ratio over PRES by up to 43 percentage points, with the largest gains observed in resource-tight configurations.
- 8 August 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
Open AccessRetention-Based Energy-Efficient and High-Core-Utilization Scheduling for Arbitrary-Deadline DAGs
Modern clustered (power-island) multicore processors increasingly expose retention as a low-overhead low-power state, yet exploiting it in real-time systems critically depends on whether the scheduler can create sufficiently long cluster-level all-cores-idle windows that exceed a break-even length. This feasibility bottleneck is particularly acute for always-on arbitrary-deadline Directed Acyclic Graph (DAG) workloads, where precedence-induced execution fluctuations fragment idle times and the relative deadline may exceed the period. This paper proposes a retention-oriented scheduling framework for such workloads, consisting of two algorithms with a clear progression. PRES performs design-time planning and constructs a postponable division for each DAG, reshaping execution to aggregate slack into contiguous cluster-level idle windows; a lightweight event-driven runtime then enforces the plan and triggers retention without increasing online scheduling complexity. Building on PRES, PREHS further improves core utilization via multi-DAG merging and intra-cluster spatial sharing, consolidating workload onto fewer active clusters to reduce static/leakage energy while preserving deadline guarantees. We conduct extensive experiments across diverse cluster configurations and DAG structural characteristics, and further include a case study based on an application-derived DAG from a real-world communication/signal-processing pipeline. The results show that, compared with a representative work-conserving baseline with automatic retention/PG, PREHS reduces static energy consumption by up to 65.62%; moreover, under the same resource constraints, PREHS improves task acceptance ratio over PRES by up to 43 percentage points, with the largest gains observed in resource-tight configurations.
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Hierarchical Pareto-Prompted Optimization for Probabilistic DAG Scheduling on Real-Time Systems
Real-time automotive workloads modeled as directed acyclic graphs (DAGs) with probabilistic execution times face severe latency bottlenecks, where shared tasks couple multiple sensor-to-actuator paths. Minimizing end-to-end latency under such variability requires navigating a complex joint space of task mappings and offsets. To address this, we propose a Pareto-prompted metaheuristic with hierarchical mapping-then-offset refinement, utilizing Pareto dominance to search for non-dominated schedules. Evaluated on production navigation-on-autopilot workloads running on NVIDIA Orin-N-based vehicles, our method satisfies all constraints and significantly outperforms an industrial static baseline, reducing mean latency by up to 12% and 99th-percentile latency by up to 15%.
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessHierarchical Pareto-Prompted Optimization for Probabilistic DAG Scheduling on Real-Time Systems
Real-time automotive workloads modeled as directed acyclic graphs (DAGs) with probabilistic execution times face severe latency bottlenecks, where shared tasks couple multiple sensor-to-actuator paths. Minimizing end-to-end latency under such variability requires navigating a complex joint space of task mappings and offsets. To address this, we propose a Pareto-prompted metaheuristic with hierarchical mapping-then-offset refinement, utilizing Pareto dominance to search for non-dominated schedules. Evaluated on production navigation-on-autopilot workloads running on NVIDIA Orin-N-based vehicles, our method satisfies all constraints and significantly outperforms an industrial static baseline, reducing mean latency by up to 12% and 99th-percentile latency by up to 15%.
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-6
RM-CIMA: An Analog Computing-in-Memory Accelerator for a Robust UAV Trajectory Tracking Framework
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessRM-CIMA: An Analog Computing-in-Memory Accelerator for a Robust UAV Trajectory Tracking Framework
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
CPA-BNN: A Secure and Efficient CIM and PUF Architecture for BNN Accelerator
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessCPA-BNN: A Secure and Efficient CIM and PUF Architecture for BNN Accelerator
- Open Access
- 28 November 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 25 (5) , 1-25
Directed Acyclic Graph Topology Generators: A Survey
Directed Acyclic Graphs (DAGs) are essential for modelling task dependencies across various domains, including industrial automation, autonomous systems, and many-core processors. DAG generators are widely used to evaluate the performance of scheduling algorithms. This survey systematically analyzes existing DAG generation algorithms, evaluating their search space, efficiency, and uniformity. We categorize existing DAG generators into three primary methodologies: Triangular Matrix-Based (TMB), Layer-by-Layer (LBL), and Poset-Based (POB) methods. Furthermore, we introduce a dedicated testing tool that quantitatively assesses various DAG generators’ performance. Experimental results show each DAG generator’s strengths and limitations, offering insights into their applicability in real-world scheduling and resource allocation problems. These findings provide a foundation for selecting suitable DAG generation methods for benchmarking scheduling heuristics and improving DAG task modelling.
- 28 November 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 25 (5) , 1-25
Open AccessDirected Acyclic Graph Topology Generators: A Survey
Directed Acyclic Graphs (DAGs) are essential for modelling task dependencies across various domains, including industrial automation, autonomous systems, and many-core processors. DAG generators are widely used to evaluate the performance of scheduling algorithms. This survey systematically analyzes existing DAG generation algorithms, evaluating their search space, efficiency, and uniformity. We categorize existing DAG generators into three primary methodologies: Triangular Matrix-Based (TMB), Layer-by-Layer (LBL), and Poset-Based (POB) methods. Furthermore, we introduce a dedicated testing tool that quantitatively assesses various DAG generators’ performance. Experimental results show each DAG generator’s strengths and limitations, offering insights into their applicability in real-world scheduling and resource allocation problems. These findings provide a foundation for selecting suitable DAG generation methods for benchmarking scheduling heuristics and improving DAG task modelling.
- Open Access
- 26 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 24 (5s) , 1-25
FT-DAG: An Efficient Full-Topology DAG Generator with Controllable Parameters
Directed Acyclic Graph (DAG) models are extensively utilized across fields such as automotive, wireless communication, and deep learning, to capture the inherent functional dependencies. Topology of DAG has a significant impact on the performance of scheduling and resource management algorithms applied to it. Hence, it is imperative to generate all DAG topologies within the parameter ranges pertinent to an application domain, for impartial evaluation of such algorithms. Unfortunately, the existing DAG generators that are capable of offering full topology coverage have limited scalability and controllable parameters. This work reports open-source FT-DAG, an efficient and formally verified full-topology DAG generator that is able to control all major parameters, including the longest length, shortest length, width, jump layer, jump level, in-degree, out-degree, shape value as well as the number of nodes and edges. Experiments show that when the number of nodes is larger than 20, FT-DAG provides at least two orders of magnitude speedup compared to the state of the art and more orders to other generators. FT-DAG scales to 100 nodes in a typical industrial case study within hours.
- 26 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 24 (5s) , 1-25
Open AccessFT-DAG: An Efficient Full-Topology DAG Generator with Controllable Parameters
Directed Acyclic Graph (DAG) models are extensively utilized across fields such as automotive, wireless communication, and deep learning, to capture the inherent functional dependencies. Topology of DAG has a significant impact on the performance of scheduling and resource management algorithms applied to it. Hence, it is imperative to generate all DAG topologies within the parameter ranges pertinent to an application domain, for impartial evaluation of such algorithms. Unfortunately, the existing DAG generators that are capable of offering full topology coverage have limited scalability and controllable parameters. This work reports open-source FT-DAG, an efficient and formally verified full-topology DAG generator that is able to control all major parameters, including the longest length, shortest length, width, jump layer, jump level, in-degree, out-degree, shape value as well as the number of nodes and edges. Experiments show that when the number of nodes is larger than 20, FT-DAG provides at least two orders of magnitude speedup compared to the state of the art and more orders to other generators. FT-DAG scales to 100 nodes in a typical industrial case study within hours.
- 10 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (5) , 2794-2808
MobiPTP: Mobile Precision Time Protocol for Ubiquitous Communication Scenarios
5G mobile communication techniques are widely applied in ubiquitous communication scenarios (e.g., smart navigation and smart transportation), which require time synchronization among mobile devices. However, the built-in time synchronization software of Android phones presents large time offsets with hundreds of milliseconds (ms), and the mainstream time synchronization techniques have specific limitations: 1) the Network Time Protocol (NTP) has too large offset to meet the real-time information interaction among mobile devices; 2) the Linux Precision Time Protocol (LinuxPTP) exists hardware dependence and cannot be implemented on Android and 5G networks; and 3) the Global Navigation Satellite System (GNSS) requires installing a hardware receiver on each mobile device. In this study, we develop a Mobile Precision Time Protocol (MobiPTP), which is hardware-independent and compatible with various network types, including Wide-Area Network (WAN), Local-Area Network (LAN), wired and wireless networks. The main challenges include signal strength instability and uplink-downlink asymmetry. We propose a dynamic time synchronization algorithm and an asymmetry compensation strategy to overcome these challenges. Regardless of high-speed mobile or crowded conditions in 5G networks, MobiPTP demonstrates an average offset of 9 ms, outperforming the NTP-based open-source software Chrony (about 30 ms). MobiPTP has been successfully deployed in multiple real-world ubiquitous communication scenarios and always demonstrates much lower offsets than Chrony.
- 10 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (5) , 2794-2808
MobiPTP: Mobile Precision Time Protocol for Ubiquitous Communication Scenarios
5G mobile communication techniques are widely applied in ubiquitous communication scenarios (e.g., smart navigation and smart transportation), which require time synchronization among mobile devices. However, the built-in time synchronization software of Android phones presents large time offsets with hundreds of milliseconds (ms), and the mainstream time synchronization techniques have specific limitations: 1) the Network Time Protocol (NTP) has too large offset to meet the real-time information interaction among mobile devices; 2) the Linux Precision Time Protocol (LinuxPTP) exists hardware dependence and cannot be implemented on Android and 5G networks; and 3) the Global Navigation Satellite System (GNSS) requires installing a hardware receiver on each mobile device. In this study, we develop a Mobile Precision Time Protocol (MobiPTP), which is hardware-independent and compatible with various network types, including Wide-Area Network (WAN), Local-Area Network (LAN), wired and wireless networks. The main challenges include signal strength instability and uplink-downlink asymmetry. We propose a dynamic time synchronization algorithm and an asymmetry compensation strategy to overcome these challenges. Regardless of high-speed mobile or crowded conditions in 5G networks, MobiPTP demonstrates an average offset of 9 ms, outperforming the NTP-based open-source software Chrony (about 30 ms). MobiPTP has been successfully deployed in multiple real-world ubiquitous communication scenarios and always demonstrates much lower offsets than Chrony.
- 18 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 44 (9) , 3303-3312
LIDS: A Lightweight Intrusion Detection System for Controller Area Network
Controller area network (CAN) is widely adopted in automobiles and susceptible to cyber attacks with the development of intelligent connected vehicles. While neural networks have demonstrated high accuracy in detection of such attacks, they consume a large amount of resources, hence unsuitable to be directly used for the automotive domain. In this work, we propose a lightweight intrusion detection system (LIDS) for CAN. It first filters out denial-of-service (DoS) and Fuzzy attacks through list screening, following which, a multilayer perceptron (MLP) model is deployed to predict Impersonation attacks. Leveraging this combination, the detection accuracy is kept and the resources required are significantly reduced. LIDS is able to run on small hardware with 520-kB memory and CPU of 240 MHz. Its power consumption is one order of magnitude lower than the existing works, thus an excellent candidate for protection of CAN in automobiles.
- 18 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 44 (9) , 3303-3312
LIDS: A Lightweight Intrusion Detection System for Controller Area Network
Controller area network (CAN) is widely adopted in automobiles and susceptible to cyber attacks with the development of intelligent connected vehicles. While neural networks have demonstrated high accuracy in detection of such attacks, they consume a large amount of resources, hence unsuitable to be directly used for the automotive domain. In this work, we propose a lightweight intrusion detection system (LIDS) for CAN. It first filters out denial-of-service (DoS) and Fuzzy attacks through list screening, following which, a multilayer perceptron (MLP) model is deployed to predict Impersonation attacks. Leveraging this combination, the detection accuracy is kept and the resources required are significantly reduced. LIDS is able to run on small hardware with 520-kB memory and CPU of 240 MHz. Its power consumption is one order of magnitude lower than the existing works, thus an excellent candidate for protection of CAN in automobiles.