Renting a cloud

DOI10.4230/LIPICS.FSTTCS.2013.437MaRDI QIDQ2963933zbMATH OpenFDO

Authors Barna Saha

Publication date 21 February 2017

zbMATH Keywords

approximation algorithmonline algorithmscheduling algorithm

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• Efficient Online Strategies for Renting Servers in the Cloud
• Stochastic and robust scheduling in the cloud
• Competitive algorithm for scheduling of sharing machines with rental discount

Cited in

(14)

• Online scheduling of time-critical tasks to minimize the number of calibrations
• Stochastic and robust scheduling in the cloud
• Renting servers in the cloud: the case of equal duration jobs
• Non-preemptive scheduling in a smart grid model and its implications on machine minimization
• Server cloud scheduling
• An improved algorithm for online machine minimization
• A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
• Interval scheduling with economies of scale
• Efficient Online Strategies for Renting Servers in the Cloud
• Server cloud scheduling
• Efficient algorithms for scheduling parallel jobs with interval constraints in clouds
• An \(\mathcal O(\log m)\)-competitive algorithm for online machine minimization
• Competitive algorithm for scheduling of sharing machines with rental discount
• Online machine minimization with lookahead

This page was built for publication: Renting a cloud

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