@article{ART003305987},
author={Taehun Yang and Cheonyong Kim},
title={Task Scheduling Scheme for Maintaining Freshness in Digital Twin Systems},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2026},
volume={31},
number={2},
pages={183-189},
doi={10.9708/jksci.2026.31.02.183}
TY - JOUR
AU - Taehun Yang
AU - Cheonyong Kim
TI - Task Scheduling Scheme for Maintaining Freshness in Digital Twin Systems
JO - Journal of The Korea Society of Computer and Information
PY - 2026
VL - 31
IS - 2
PB - The Korean Society Of Computer And Information
SP - 183
EP - 189
SN - 1598-849X
AB - In digital twin systems, maintaining a high level of freshness for cyber twins is essential for accurate inference and real‑time decision making. However, update tasks and inference tasks are processed under limited computing resources, causing a trade-off between task throughput and digital twin freshness.
Existing scheduling methods prioritize task throughput, resulting in degraded digital twin freshness under a high traffic arrival rate. To address this issue, we propose an expected-freshness–based scheduling scheme that dynamically determines the execution timing of update tasks by predicting the expected number of inference tasks within each update interval. By estimating the maximum achievable freshness and scheduling update tasks when degradation is expected, the proposed scheme ensures the required digital twin freshness level. Simulation results show that our scheme maintains digital twin freshness even under increasing task arrival rates, while incurring only moderate task rejection. The proposed scheduling scheme is suitable for applications where freshness is more critical than task throughput.
KW - Digital Twin System;Freshness;Real-time Scheduling;Update–Inference Trade-off;Task Prioritization
DO - 10.9708/jksci.2026.31.02.183
ER -
Taehun Yang and Cheonyong Kim. (2026). Task Scheduling Scheme for Maintaining Freshness in Digital Twin Systems. Journal of The Korea Society of Computer and Information, 31(2), 183-189.
Taehun Yang and Cheonyong Kim. 2026, "Task Scheduling Scheme for Maintaining Freshness in Digital Twin Systems", Journal of The Korea Society of Computer and Information, vol.31, no.2 pp.183-189. Available from: doi:10.9708/jksci.2026.31.02.183
Taehun Yang, Cheonyong Kim "Task Scheduling Scheme for Maintaining Freshness in Digital Twin Systems" Journal of The Korea Society of Computer and Information 31.2 pp.183-189 (2026) : 183.
Taehun Yang, Cheonyong Kim. Task Scheduling Scheme for Maintaining Freshness in Digital Twin Systems. 2026; 31(2), 183-189. Available from: doi:10.9708/jksci.2026.31.02.183
Taehun Yang and Cheonyong Kim. "Task Scheduling Scheme for Maintaining Freshness in Digital Twin Systems" Journal of The Korea Society of Computer and Information 31, no.2 (2026) : 183-189.doi: 10.9708/jksci.2026.31.02.183
Taehun Yang; Cheonyong Kim. Task Scheduling Scheme for Maintaining Freshness in Digital Twin Systems. Journal of The Korea Society of Computer and Information, 31(2), 183-189. doi: 10.9708/jksci.2026.31.02.183
Taehun Yang; Cheonyong Kim. Task Scheduling Scheme for Maintaining Freshness in Digital Twin Systems. Journal of The Korea Society of Computer and Information. 2026; 31(2) 183-189. doi: 10.9708/jksci.2026.31.02.183
Taehun Yang, Cheonyong Kim. Task Scheduling Scheme for Maintaining Freshness in Digital Twin Systems. 2026; 31(2), 183-189. Available from: doi:10.9708/jksci.2026.31.02.183
Taehun Yang and Cheonyong Kim. "Task Scheduling Scheme for Maintaining Freshness in Digital Twin Systems" Journal of The Korea Society of Computer and Information 31, no.2 (2026) : 183-189.doi: 10.9708/jksci.2026.31.02.183
