The COMFORT automatic tuning project
Information Systems
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
IEEE/ACM Transactions on Networking (TON)
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
The Paderborn University BSP (PUB) library
Parallel Computing
Isomorphism testing for graphs of bounded genus
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Performance Evaluation of the VF Graph Matching Algorithm
ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
Efficient Barrier Synchronization Mechanism for the BSP Model on Message-Passing Architectures
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
A solver for the network testbed mapping problem
ACM SIGCOMM Computer Communication Review
Constraint satisfaction algorithms for graph pattern matching
Mathematical Structures in Computer Science
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Network-Aware Operator Placement for Stream-Processing Systems
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
A Conversation with Werner Vogels
Queue - AI
Extensible optimization in overlay dissemination trees
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Overlay Node Placement: Analysis, Algorithms and Impact on Applications
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Data access patterns in the Amazon.com technology platform
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Rethinking virtual network embedding: substrate support for path splitting and migration
ACM SIGCOMM Computer Communication Review
On the treeness of internet latency and bandwidth
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
RPC chains: efficient client-server communication in geodistributed systems
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
PortLand: a scalable fault-tolerant layer 2 data center network fabric
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Quincy: fair scheduling for distributed computing clusters
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Scalability of dynamic traffic assignment
Scalability of dynamic traffic assignment
Cassandra: a decentralized structured storage system
ACM SIGOPS Operating Systems Review
Defining future platform requirements for e-Science clouds
Proceedings of the 1st ACM symposium on Cloud computing
Towards automatic optimization of MapReduce programs
Proceedings of the 1st ACM symposium on Cloud computing
The impact of virtualization on network performance of amazon EC2 data center
INFOCOM'10 Proceedings of the 29th conference on Information communications
CloudViews: communal data sharing in public clouds
HotCloud'09 Proceedings of the 2009 conference on Hot topics in cloud computing
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
Improving MapReduce performance in heterogeneous environments
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
Network traffic characteristics of data centers in the wild
IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
Runtime measurements in the cloud: observing, analyzing, and reducing variance
Proceedings of the VLDB Endowment
Behavioral simulations in MapReduce
Proceedings of the VLDB Endowment
SecondNet: a data center network virtualization architecture with bandwidth guarantees
Proceedings of the 6th International COnference
Topology-aware resource allocation for data-intensive workloads
ACM SIGCOMM Computer Communication Review
Virtual network embedding through topology-aware node ranking
ACM SIGCOMM Computer Communication Review
Automatic optimization for MapReduce programs
Proceedings of the VLDB Endowment
Managing data transfers in computer clusters with orchestra
Proceedings of the ACM SIGCOMM 2011 conference
Towards predictable datacenter networks
Proceedings of the ACM SIGCOMM 2011 conference
Making time-stepped applications tick in the cloud
Proceedings of the 2nd ACM Symposium on Cloud Computing
Evaluation of Network Topology Inference in Opaque Compute Clouds through End-to-End Measurements
CLOUD '11 Proceedings of the 2011 IEEE 4th International Conference on Cloud Computing
Purlieus: locality-aware resource allocation for MapReduce in a cloud
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
Orchestrating the deployment of computations in the cloud with conductor
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
Generalized resource allocation for the cloud
Proceedings of the Third ACM Symposium on Cloud Computing
More for your money: exploiting performance heterogeneity in public clouds
Proceedings of the Third ACM Symposium on Cloud Computing
Green cloud virtual network provisioning based ant colony optimization
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
An increasing number of distributed data-driven applications are moving into shared public clouds. By sharing resources and operating at scale, public clouds promise higher utilization and lower costs than private clusters. To achieve high utilization, however, cloud providers inevitably allocate virtual machine instances noncontiguously, i.e., instances of a given application may end up in physically distant machines in the cloud. This allocation strategy can lead to large differences in average latency between instances. For a large class of applications, this difference can result in significant performance degradation, unless care is taken in how application components are mapped to instances. In this paper, we propose ClouDiA, a general deployment advisor that selects application node deployments minimizing either (i) the largest latency between application nodes, or (ii) the longest critical path among all application nodes. ClouDiA employs mixed-integer programming and constraint programming techniques to efficiently search the space of possible mappings of application nodes to instances. Through experiments with synthetic and real applications in Amazon EC2, we show that our techniques yield a 15% to 55% reduction in time-to-solution or service response time, without any need for modifying application code.