跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.15111 · v1

Speedup-Aware Rounding for Scheduling Malleable Tasks with Precedence Constraints

首次提交 2026-11-11 14:40
版本更新 2026-11-11 14:40
雷达观测 2026-11-13 11:11
arXiv ↗PDF ↗

摘要

We study the scheduling of malleable tasks with precedence constraints on mm identical processors to minimize the makespan, assuming that the processing time of a task does not increase and its work does not decrease with the number of processors, and that the work is a convex function of the processing time. The standard two-phase method solves a linear program, rounds the fractional processing times to allotments, caps the allotments at a threshold μμ, and runs list scheduling. We propose \emph{speedup-aware rounding}, which rounds a task to its slower allotment exactly when this allotment is at most a factor aa slower than the fractional processing time. We determine the worst-case increase of the work under this rule exactly and show that no per-task rounding rule with time factor aa does better. With μ=⌈β(a)m⌉μ=\lceilβ(a)m\rceil the algorithm achieves the approximation ratio 13(30+493)/225≈3.016213(30+\sqrt{493})/225\approx3.0162 for every mm, which improves the previous bound 2+2≈3.41422+\sqrt2\approx3.4142; a single task with linear speedup shows that its ratio is at least ≈2.9558\approx2.9558. For concave speedup functions, which include the roofline, communication, Amdahl and power-law models, the ratio becomes ≈2.9739\approx2.9739, which improves the ratio ≈3.2919\approx3.2919 of Jansen and Zhang. We also revisit the strictly decreasing case of our earlier work (Chen and Chu, 2013): the reported ratio 2.95492.9549 relies on an elimination step that is not valid. In this case the algorithm coincides with that of Jansen and Zhang up to its parameters, and with parameters chosen by the corrected analysis it guarantees their ratio ≈3.2919\approx3.2919. Finally, without convexity no per-task rounding improves the known time--work trade-off, and the analysis cannot go below (3+5)/2(3+\sqrt5)/2.

作者备注:31 pages; ancillary files contain the numerical verification programs

AI 论文解读

基于摘要 · 非全文审阅

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

版本差异

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

观测到的版本

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

v1 · 2026-11-11 14:40 · 最新观测版本

Speedup-Aware Rounding for Scheduling Malleable Tasks with Precedence Constraints

We study the scheduling of malleable tasks with precedence constraints on mm identical processors to minimize the makespan, assuming that the processing time of a task does not increase and its work does not decrease with the number of processors, and that the work is a convex function of the processing time. The standard two-phase method solves a linear program, rounds the fractional processing times to allotments, caps the allotments at a threshold μμ, and runs list scheduling. We propose \emph{speedup-aware rounding}, which rounds a task to its slower allotment exactly when this allotment is at most a factor aa slower than the fractional processing time. We determine the worst-case increase of the work under this rule exactly and show that no per-task rounding rule with time factor aa does better. With μ=⌈β(a)m⌉μ=\lceilβ(a)m\rceil the algorithm achieves the approximation ratio 13(30+493)/225≈3.016213(30+\sqrt{493})/225\approx3.0162 for every mm, which improves the previous bound 2+2≈3.41422+\sqrt2\approx3.4142; a single task with linear speedup shows that its ratio is at least ≈2.9558\approx2.9558. For concave speedup functions, which include the roofline, communication, Amdahl and power-law models, the ratio becomes ≈2.9739\approx2.9739, which improves the ratio ≈3.2919\approx3.2919 of Jansen and Zhang. We also revisit the strictly decreasing case of our earlier work (Chen and Chu, 2013): the reported ratio 2.95492.9549 relies on an elimination step that is not valid. In this case the algorithm coincides with that of Jansen and Zhang up to its parameters, and with parameters chosen by the corrected analysis it guarantees their ratio ≈3.2919\approx3.2919. Finally, without convexity no per-task rounding improves the known time--work trade-off, and the analysis cannot go below (3+5)/2(3+\sqrt5)/2.

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