Scheduling firm real-time applications on the edge with single-bit execution time prediction
The edge computing paradigm brings the capabilities of the cloud such as on-demand
resource availability to the edge for applications with low-latency and real-time …
resource availability to the edge for applications with low-latency and real-time …
Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines
G Karakostas, SG Kolliopoulos - … and Combinatorial Optimization …, 2023 - drops.dagstuhl.de
We study the classic weighted maximum throughput problem on unrelated machines. We
give a (1-1/e-ε)-approximation algorithm for the preemptive case. To our knowledge this is …
give a (1-1/e-ε)-approximation algorithm for the preemptive case. To our knowledge this is …
O (1/ε) Is the Answer in Online Weighted Throughput Maximization
F Eberle - 41st International Symposium on Theoretical Aspects …, 2024 - drops.dagstuhl.de
We study a fundamental online scheduling problem where jobs with processing times,
weights, and deadlines arrive online over time at their release dates. The task is to …
weights, and deadlines arrive online over time at their release dates. The task is to …
is the answer in online weighted throughput maximization
F Eberle - arXiv preprint arXiv:2310.16697, 2023 - arxiv.org
We study a fundamental online scheduling problem where jobs with processing times,
weights, and deadlines arrive online over time at their release dates. The task is to …
weights, and deadlines arrive online over time at their release dates. The task is to …