EDBT 2026 Demo / reviewers in the wild / expert
Rong-Kun Chen
dblp:321/6500
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2025
0000-0001-6057-0492ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 4 · 4 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Energy-Efficient Partitioned-RM Scheduling for Shared Resources Imprecise Mixed-Criticality TasksabstractShared resources and energy consumption are important factors to consider in the design of mixed-criticality systems. Existing works have studied these two factors separately. In this article, we simultaneously focus on shared resources and energy consumption on multiprocessor platforms. Firstly, we address the problem of energy-aware scheduling for the fixed-priority imprecise mixed-criticality tasks with shared resources and propose a schedulability test based on the Multiprocessor Priority Ceiling Protocol for a given task-to-processor mapping. Secondly, we calculate the energy-efficient speed of each processor based on the schedulability test and propose the corresponding task-to-processor mapping algorithm, called IMCPA. Finally, we conduct experiments on a real-world case and synthetic tasksets. The experimental results show that IMCPA can improve the schedulability ratio by about 13.76% and save energy consumption by about 34.89% compared to the existing algorithms. Yiwen Zhang 0002, Rong-Kun Chen |
ACM Trans. Embed. Comput. Syst. | 2 |
| 2023 | Energy-efficient scheduling of imprecise mixed-criticality real-time tasks based on genetic algorithm
Yiwen Zhang 0002, Rong-Kun Chen |
J. Syst. Archit. | 2 |
| 2023 | Energy-Aware Partitioned Scheduling of Imprecise Mixed-Criticality SystemsabstractWe consider partitioned scheduling of an imprecise mixed-criticality (IMC) taskset on a uniform multiprocessor platform, with the earliest deadline first-virtual deadline (EDF-VD) as the uniprocessor task scheduling algorithm, and address the optimization problem of finding a feasible task-to-processor assignment and low-criticality (LO) mode processor speed with the objective of minimizing the system’s average energy consumption in LO mode. We propose a task-to-processor assignment algorithm criticality-unaware worst-fit decreasing (CU-WFD) algorithm, which allocates tasks with the worst-fit decreasing (WFD) heuristic method based on utilization values at their respective criticality levels. We determine the energy-efficient speed for each processor based on EDF-VD scheduling, and present our algorithm energy-efficient partitioned scheduling for imprecise mixed-criticality (EEPSIMC) with the CU-WFD heuristic algorithm to minimize system energy consumption. The experimental results show that our proposed algorithm has good performance in terms both schedulability ratio and normalized energy consumption compared to seven comparison baselines. Yiwen Zhang 0002, Rong-Kun Chen, Zonghua Gu 0001 |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 2 |
| 2022 | A survey of energy-aware scheduling in mixed-criticality systems
Yiwen Zhang 0002, Rong-Kun Chen |
J. Syst. Archit. | 2 |