Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jiping Zheng 0002

dblp:53/2404-2 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%
Computer networks
1 paper
Edge and fog computing · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Edge and fog computing
edge-cloud computing
0.912025
Real-Time Task and Resource Co-Optimization in Edge-Cloud Computing for Networked Control Systems via Logic-Based Benders Decomposition · IEEE Trans. Serv. Comput. 2025
Embedded and real-time systems
networked control systems
0.912025
Real-Time Task and Resource Co-Optimization in Edge-Cloud Computing for Networked Control Systems via Logic-Based Benders Decomposition · IEEE Trans. Serv. Comput. 2025
Embedded and real-time systems
real-time scheduling
0.912025
Real-Time Task and Resource Co-Optimization in Edge-Cloud Computing for Networked Control Systems via Logic-Based Benders Decomposition · IEEE Trans. Serv. Comput. 2025

Methods — techniques the papers use, named apart from their topics

logic-based benders decomposition · 2.6
YearPublicationVenuePosition
2025 Message and Task Co-Scheduling with End-to-End Deadlines in Industrial Internet of Things
abstract
Ensuring end-to-end delays meet deadlines is a key challenge in Industrial Internet of Things (IIoT), as it directly affects control performance. To reduce end-to-end delays, traditional methods focus on message scheduling under the Time Division Multiple Access (TDMA) protocol. However, with the increasing adoption of complex control algorithms in industry, neglecting task scheduling on the controller can lead to missed deadlines for control applications. This paper investigates the co-scheduling problem of messages and tasks, aiming to satisfy the end-to-end deadline constraints of all control applications in IIoT. Since the preemptive controller introduces an unknown number of task scheduling decision variables, the Early Deadline First (EDF) strategy is employed to generate task schedules. To generate message schedules aligned with task schedules, we reformulate the co-scheduling problem, making it solvable by numerical solvers. Moreover, we propose a heuristic algorithm, SECDS, for efficient scheduling in large-scale IIoT. Simulation results show the superior applicability and performance of the proposed methods compared to baseline algorithms.
Menghua Chen, Jiping Zheng 0002, Shanying Zhu
INDIN3
2025 Real-Time Task and Resource Co-Optimization in Edge-Cloud Computing for Networked Control Systems via Logic-Based Benders Decomposition
Menghua Chen, Yonghui Liang, Jiping Zheng 0002, Shanying Zhu, Xin-Ping Guan
IEEE Trans. Serv. Comput.4