Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Constraint Logic Programming using Eclipse
Constraint Logic Programming using Eclipse
A scalable, commodity data center network architecture
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Declarative Infrastructure Configuration Synthesis and Debugging
Journal of Network and Systems Management
Towards systematic design of enterprise networks
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Antfarm: efficient content distribution with managed swarms
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Rhizoma: a runtime for self-deploying, self-managing overlays
Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware
Kodkod: a relational model finder
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Resource allocation algorithms for virtualized service hosting platforms
Journal of Parallel and Distributed Computing
PacketShader: a GPU-accelerated software router
Proceedings of the ACM SIGCOMM 2010 conference
Topology-aware resource allocation for data-intensive workloads
Proceedings of the first ACM asia-pacific workshop on Workshop on systems
SPAIN: COTS data-center Ethernet for multipathing over arbitrary topologies
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
SecondNet: a data center network virtualization architecture with bandwidth guarantees
Proceedings of the 6th International COnference
SSLShader: cheap SSL acceleration with commodity processors
Proceedings of the 8th USENIX conference on Networked systems design and implementation
Towards predictable datacenter networks
Proceedings of the ACM SIGCOMM 2011 conference
CloudNaaS: a cloud networking platform for enterprise applications
Proceedings of the 2nd ACM Symposium on Cloud Computing
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Cologne: a declarative distributed constraint optimization platform
Proceedings of the VLDB Endowment
ClouDiA: a deployment advisor for public clouds
Proceedings of the VLDB Endowment
Chatty tenants and the cloud network sharing problem
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
TCNet: cross-node virtual machine communication acceleration
Proceedings of the ACM International Conference on Computing Frontiers
Autonomic resource provisioning in cloud systems with availability goals
Proceedings of the 2013 ACM Cloud and Autonomic Computing Conference
Proceedings of the 5th ACM/SPEC international conference on Performance engineering
Hi-index | 0.00 |
Resource allocation is an integral, evolving part of many data center management problems such as virtual machine placement in data centers, network virtualization, and multi-path network routing. Since the problems are inherently NP-Hard, most existing systems use custom-designed heuristics to find a suitable solution. However, such heuristics are often rigid, making it difficult to extend them as requirements change. In this paper, we present a novel approach to resource allocation that permits the problem specification to evolve with ease. We have built Wrasse, a generic and extensible tool that cloud environments can use to solve their specific allocation problem. Wrasse provides a simple yet expressive specification language that captures a wide range of resource allocation problems. At the back-end, it leverages the power of GPUs to provide solutions to the allocation problems in a fast and timely manner. We show the extensibility of Wrasse by expressing several allocation problems in its specification language. Our experiments show that Wrasse's solution quality is as good as with heuristics, and sometimes even better, while maintaining good performance. In one case, Wrasse packed 71% more instances than a custom heuristic.