PreprintarXiv licencearXiv
Optimal Dynamic Resource Allocation for Multicore Real-time Systems
Abstract
We formulate a novel optimal control problem for data-driven dynamic resource allocation in multicore real-time systems. The proposed formulation accounts for hard deadline constraints and resource bounds. Under mild assumptions, we prove several results on the feasibility and existence of optimal solution for the proposed formulation. Building on these analyses, we design an algorithm to solve the multi-core dynamic resource allocation problem. We demonstrate the practical use of this new algorithm by experimentally evaluating it on a real multicore platform using four benchmarks from the literature.
Related
- Distributed Stochastic Extremum Seeking for Optimal Resource Allocation over Networks with Time Delays
- Joint Flexible Beamforming, Resource Allocation, and Task Buffering for Movable-Antenna Enabled MEC Systems
- CRB-Guided Sensing and Resource Allocation for Human Pose Prediction in Integrated Sensing, Communication, and Computation Systems
- A Resource Allocation Tournament
- Multi-view Semantic-aware Resource Allocation for Edge AI
BibTeX
@misc{bondar2026optimal,
title = {{Optimal Dynamic Resource Allocation for Multicore Real-time Systems}},
author = {Georgiy A. Bondar and Abigail Eisenklam and Ripon C. Sarker and Linh Thi Xuan Phan and Abhishek Halder},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.05530},
eprint = {2610.05530},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.05530},
}
RIS
TY - UNPB
TI - Optimal Dynamic Resource Allocation for Multicore Real-time Systems
AU - Georgiy A. Bondar
AU - Abigail Eisenklam
AU - Ripon C. Sarker
AU - Linh Thi Xuan Phan
AU - Abhishek Halder
PY - 2026
DA - 2026/10/04
PB - arXiv
DO - 10.48550/arxiv.2610.05530
UR - https://arxiv.org/abs/2610.05530
AB - We formulate a novel optimal control problem for data-driven dynamic resource allocation in multicore real-time systems. The proposed formulation accounts for hard deadline constraints and resource bounds. Under mild assumptions, we prove several results on the feasibility and existence of optimal solution for the proposed formulation. Building on these analyses, we design an algorithm to solve the multi-core dynamic resource allocation problem. We demonstrate the practical use of this new algorithm by experimentally evaluating it on a real multicore platform using four benchmarks from the literature.
ER -