Efficient algorithms for scheduling parallel jobs with interval constraints in clouds

DOI10.1007/978-3-030-92681-6_16MaRDI QIDQ2149869zbMATH OpenOpenAlexFDO

Authors Xuanming Xu, Longkun Guo

Publication date 29 June 2022

Full work available at URL https://doi.org/10.1007/978-3-030-92681-6_16

zbMATH Keywords

optimalityparallel processingintegral polyhedronmachine minimization

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cites work

• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 1559529 (Why is no real title available?)
• scientific article; zbMATH DE number 2163021 (Why is no real title available?)
• A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
• An \(\mathcal O(\log m)\)-competitive algorithm for online machine minimization
• An improved algorithm for online machine minimization
• Combinatorial optimization. Theory and algorithms.
• Competitive design and analysis for machine-minimizing job scheduling problem
• Online machine minimization with lookahead
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Renting a cloud
• Some simple scheduling algorithms
• Two-Processor Scheduling with Start-Times and Deadlines

Cited in

(2)

• Scheduling parallel jobs using migration and consolidation in the cloud
• Efficient scientific workflow scheduling for deadline-constrained parallel tasks in cloud computing environments

This page was built for publication: Efficient algorithms for scheduling parallel jobs with interval constraints in clouds

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