跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.25953 · v1

Below Three: A 2.8027-Approximation for Moldable Precedence Scheduling

首次提交 2026-11-19 19:41
版本更新 2026-11-19 19:41
雷达观测 2026-11-20 16:53
arXiv ↗PDF ↗

摘要

We study makespan minimisation for nonpreemptive moldable jobs with arbitrary precedence constraints on identical processors. Each job runs on a chosen number of processors that remains fixed throughout its execution. Allocating more processors to a job can shorten its execution, but may increase total work and delay other jobs. We assume nonincreasing processing times, nondecreasing work, and a convex duration--work relation after dominated allocations are removed. This model includes jobs with concave speedup, for which Jansen and Zhang obtained a 3.291919…3.291919\ldots-approximation. Independently and concurrently with our work, Chen obtained a 3.016208…3.016208\ldots-approximation for the full convex model and a 2.973912…2.973912\ldots-approximation for concave speedup. We give a deterministic polynomial-time 2.80272.8027-approximation for the full convex model and every number of processors. Our result breaks the factor-three barrier for this model and also improves the approximation guarantee for concave speedup.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-19 19:41 · 最新观测版本

Below Three: A 2.8027-Approximation for Moldable Precedence Scheduling

We study makespan minimisation for nonpreemptive moldable jobs with arbitrary precedence constraints on identical processors. Each job runs on a chosen number of processors that remains fixed throughout its execution. Allocating more processors to a job can shorten its execution, but may increase total work and delay other jobs. We assume nonincreasing processing times, nondecreasing work, and a convex duration--work relation after dominated allocations are removed. This model includes jobs with concave speedup, for which Jansen and Zhang obtained a 3.291919…3.291919\ldots-approximation. Independently and concurrently with our work, Chen obtained a 3.016208…3.016208\ldots-approximation for the full convex model and a 2.973912…2.973912\ldots-approximation for concave speedup. We give a deterministic polynomial-time 2.80272.8027-approximation for the full convex model and every number of processors. Our result breaks the factor-three barrier for this model and also improves the approximation guarantee for concave speedup.

查看此版本解读 →查看此版本原文 ↗