Efficient algorithms for scheduling parallel jobs with interval constraints in clouds

DOI10.1007/978-3-030-92681-6_16OpenAlexW4205622433MaRDI QIDQ2149869FDOQ2149869

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

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

Cited In (2)

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

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)