Online Workload Scheduling for Social Welfare Maximization in the Computing Continuum
IEEE Transactions on Services Computing · 2025-07 · 18 (4) · 2267-2280
DOI: 10.1109/tsc.2025.3570845 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Services Computing, 2025-07. Verfasst von Hailiang Zhao und 7 weiteren Autor:innen. Die Arbeit wurde bisher 12-mal zitiert (Crossref) und nennt 48 Literaturangaben. Gefördert von: National Key Research and Development Program of China, National Natural Science Foundation of Zhejiang, National Natural Science Foundation of China.
Abstract (Originalsprache)
Computing ecosystems are shifting toward a computing continuum paradigm designed to handle the diverse and dynamic nature of computing resources spread across various locations. It demonstrates significant potential in providing high-bandwidth and low-latency services for users. However, as a large number of users request services from distributed computing continuum systems, it is critical to schedule numerous delay-sensitive, fractional workloads and maximum parallelism-bound jobs to appropriate backend resources, e.g., cloud container instances. In addition, the scheduling strategy also needs to maximize the social welfare that incorporates the utilities of jobs and the revenue of service providers. However, current workload scheduling algorithms are based on simple heuristics and lack performance guarantees. Due to the unpredictability of online requests, the distribution of requests should not be assumed. Therefore, designing an online workload scheduling strategy without assumptions on request distributions is essential for balancing the online workload. This work first establishes a spatiotemporal integrated resource pool to reflect the computational resources provided by distributed computing continuum systems. Then, several pseudo-social welfare functions and marginal cost functions are constructed, where the latter is used to estimate the marginal cost of provisioning services to each newly arrived job based on the current resource surplus. We propose an online workload scheduling strategy named OnSocMax to solve the above problems. It operates by following the solutions to several convex pseudo-social welfare maximization problems and is proven to be $\alpha$ α -competitive for some $\alpha$ α with a value of at least 2. The evaluation results demonstrate that OnSocMax outperforms several benchmark strategies in maximizing social welfare.
Förderung
- National Key Research and Development Program of China
- National Natural Science Foundation of Zhejiang
- National Natural Science Foundation of China
- Ningbo Yongjiang Talent Programme
- Zhejiang University Education Foundation Qizhen Scholar Foundation
Zitieren
APA
Zhao, H., Wang, Z., Cheng, G., Qian, W., Chen, P., Yin, J., Dustdar, S., & Deng, S. (2025). Online Workload Scheduling for Social Welfare Maximization in the Computing Continuum. IEEE Transactions on Services Computing, 18(4), 2267-2280. https://doi.org/10.1109/tsc.2025.3570845
Vancouver
Zhao H, Wang Z, Cheng G, Qian W, Chen P, Yin J, et al. Online Workload Scheduling for Social Welfare Maximization in the Computing Continuum. IEEE Transactions on Services Computing. 2025;18(4):2267-2280. doi:10.1109/tsc.2025.3570845
BibTeX
@article{Zhao2025,
author = {Zhao, Hailiang and Wang, Ziqi and Cheng, Guanjie and Qian, Wenzhuo and Chen, Peng and Yin, Jianwei and Dustdar, Schahram and Deng, Shuiguang},
title = {Online Workload Scheduling for Social Welfare Maximization in the Computing Continuum},
journal = {IEEE Transactions on Services Computing},
year = {2025},
volume = {18},
number = {4},
pages = {2267--2280},
doi = {10.1109/tsc.2025.3570845}
}
EUVIMED