Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time

DOI10.1137/1.9781611974331.ch14zbMath1410.68064OpenAlexW4250695509MaRDI QIDQ4575590

Jing Li, Kefu Lu, Benjamin Moseley, Kunal Agrawal

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2d2781a42725ba1f5216b629eedea17d3d36a549

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Energy-efficient scheduling and routing via randomized rounding ⋮ Unnamed Item ⋮ Open problems in queueing theory inspired by datacenter computing ⋮ Non-Clairvoyant Precedence Constrained Scheduling. ⋮ Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models

This page was built for publication: Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time