Colocating tasks in data centers using a side-effects performance model
From MaRDI portal
Publication:1754339
DOI10.1016/j.ejor.2018.01.046zbMath1403.90356OpenAlexW2792036340MaRDI QIDQ1754339
Fanny Pascual, Krzysztof Rzadca
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.01.046
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- There is no asymptotic PTAS for two-dimensional vector packing
- Revenue management for cloud computing providers: decision models for service admission control under non-probabilistic uncertainty
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing can be solved within 1+epsilon in linear time
- Optimal distributed task scheduling in volunteer clouds
- Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds
- Complexity Classifications of Boolean Constraint Satisfaction Problems
- Optimization of Composite Cloud Service Processing with Virtual Machines
- Optimal Coordination Mechanisms for Unrelated Machine Scheduling
- O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
- The price of anarchy of finite congestion games
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Approximate max-flow min-(multi)cut theorems and their applications
- The Price of Routing Unsplittable Flow
This page was built for publication: Colocating tasks in data centers using a side-effects performance model
