Competitive mechanisms for energy-efficient cloud computing
From MaRDI portal
Cites work
- A fully polynomial-time approximation scheme for speed scaling with sleep state
- A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
- A near optimal mechanism for energy aware scheduling
- Ancient and new algorithms for load balancing in the \(\ell_p\) norm
- Average rate speed scaling
- Bayesian combinatorial auctions
- Composable and efficient mechanisms
- Designing network protocols for good equilibria
- Dual techniques for scheduling on a machine with varying speed
- Energy-efficient algorithms for flow time minimization
- scientific article; zbMATH DE number 1306870 (Why is no real title available?)
- Improved bounds for speed scaling in devices obeying the cube-root rule
- Incremental cost sharing: Characterization by coalition strategy-proofness
- Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling
- Near-optimal network design with selfish agents
- Nonclairvoyant speed scaling for flow and energy
- On multi-processor speed scaling with migration
- Online speed scaling based on active job count to minimize flow plus energy
- Race to idle: new algorithms for speed scaling with a sleep state
- Scheduling for Speed Bounded Processors
- Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption
- Speed scaling for weighted flow time
- Speed scaling on parallel processors
- Speed scaling to manage energy and temperature
- The price of anarchy of finite congestion games
- The Price of Stability for Network Design with Fair Cost Allocation
- Throughput Maximization in Multiprocessor Speed-Scaling
- Worst-case equilibria
This page was built for publication: Competitive mechanisms for energy-efficient cloud computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6908094)