Scheduling parallelizable jobs online to maximize throughput

DOI10.1007/978-3-319-77404-6_55MaRDI QIDQ2294735zbMATH OpenOpenAlexFDO

Authors Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley

Publication date 12 February 2020

Full work available at URL https://doi.org/10.1007/978-3-319-77404-6_55

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Structural Information and Communication Complexity
• On-line scheduling of parallel jobs
• Online scheduling of malleable parallel jobs
• Scheduling parallel jobs online with convex and concave parallelizability
• Scheduling parallel jobs online with convex and concave parallelizability
• Online scheduling of bounded length jobs to maximize throughput
• Online Scheduling of Bounded Length Jobs to Maximize Throughput
• Online parallel machine scheduling to maximize the number of early jobs
• Online scheduling of moldable parallel tasks

Cited in

(11)

• Scheduling parallel jobs online with convex and concave parallelizability
• Open problems in queueing theory inspired by datacenter computing
• Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models
• Online Scheduling of Bounded Length Jobs to Maximize Throughput
• Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time
• Optimally Handling Commitment Issues in Online Throughput Maximization
• Approximation and Online Algorithms
• A general framework for handling commitment in online throughput maximization
• Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
• Maximizing Throughput in Flow Shop Real-Time Scheduling
• Maximizing throughput for parallel jobs with speed-up curves

This page was built for publication: Scheduling parallelizable jobs online to maximize throughput

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294735)