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

Shujia Niu

dblp:423/0733 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0009-2839-3209ORCID · reported

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

Systems, architecture and hardware · 2 · 2 first-author · 2 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 networks
1 paper
Edge and fog computing · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Edge and fog computing
task scheduling
1.012026
TACS: Decentralized Per-Task Micro-Slicing for Deadline-Aware Provisioning in Distributed Computing Continuum Systems · IEEE Trans. Parallel Distributed Syst. 2026
Cloud and datacenter computing › resource provisioning
deadline-aware provisioning
0.312026
TACS: Decentralized Per-Task Micro-Slicing for Deadline-Aware Provisioning in Distributed Computing Continuum Systems · IEEE Trans. Parallel Distributed Syst. 2026
Cloud and datacenter computing
resource provisioning
0.312026
TACS: Decentralized Per-Task Micro-Slicing for Deadline-Aware Provisioning in Distributed Computing Continuum Systems · IEEE Trans. Parallel Distributed Syst. 2026

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

simulation · 2.0decentralized scheduling · 2.0closed-form rules · 2.0
YearPublicationVenuePosition
2026 TACS: Decentralized Per-Task Micro-Slicing for Deadline-Aware Provisioning in Distributed Computing Continuum Systems
abstract
Distributed Computing Continuum Systems (DCCS) unify cloud, fog, edge, and Internet of Things (IoT) into a single execution fabric. At scale, heterogeneity and bursty arrivals make it hard to meet per task deadlines. Prior approaches based on learning, optimization, market mechanisms, or class level slicing depend on global state or iterative coordination. Decisions lag arrivals, isolation is scoped to coarse classes rather than individual tasks, and the deadline violation ratio (DVR) rises. We present Task-level Adaptive Computing Slicing (TACS), a fine grained slicing paradigm that delivers task aligned resource governance through autonomous shard management. For each arriving task, TACS executes decentralized scheduling at the shard level to instantiate an ephemeral micro-slice governed by an autonomous shard formed exactly by the task's participants. Within the shard, participants apply closed form rules to make local resource allocation decisions. This design achieves strict task level isolation and precise, scalable matching between supply and demand without global coordination or model retraining. In simulations with 100 to 1000 heterogeneous nodes and a range of loads and heterogeneity levels, TACS maintains DVRs below 1% and provides steadier, higher throughput than advanced baselines. Under adverse conditions, representative baselines exceed 20% DVR and in several cases require retraining when device populations change.
Shujia Niu, Zhenli He, Jixian Zhang 0003, Cheng Xie 0001, Keqin Li 0001
IEEE Trans. Parallel Distributed Syst.1
2025 Carbon-Aware Task Scheduling in Distributed Computing Continuum: A Lyapunov-Guided Reinforcement Learning Approach
Shujia Niu, Zhenli He, Yuanfei Xiao, Yuxaun Nie, Bingning Liu
NPC (1)1