Leveraging endpoint flexibility in data-intensive clusters
Authors:
Open Access
- 27 August 2013
- journal article
- conference paper
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 43 (4) , 231-242
Abstract
Many applications do not constrain the destinations of their network transfers. New opportunities emerge when such transfers contribute a large amount of network bytes. By choosing the endpoints to avoid congested links, completion times of these transfers as well as that of others without similar flexibility can be improved. In this paper, we focus on leveraging the flexibility in replica placement during writes to cluster file systems (CFSes), which account for almost half of all cross-rack traffic in data-intensive clusters. The replicas of a CFS write can be placed in any subset of machines as long as they are in multiple fault domains and ensure a balanced use of storage throughout the cluster. We study CFS interactions with the cluster network, analyze optimizations for replica placement, and propose Sinbad -- a system that identifies imbalance and adapts replica destinations to navigate around congested links. Experiments on EC2 and trace-driven simulations show that block writes complete 1.3X (respectively, 1.58X) faster as the network becomes more balanced. As a collateral benefit, end-to-end completion times of data-intensive jobs improve as well. Sinbad does so with little impact on the long-term storage balance.Keywords
This publication has 26 references indexed in Scilit:
- XORing elephantsProceedings of the VLDB Endowment, 2013
- Managing data transfers in computer clusters with orchestraACM SIGCOMM Computer Communication Review, 2011
- CoHadoopProceedings of the VLDB Endowment, 2011
- Delay scheduling2010
- PortLandACM SIGCOMM Computer Communication Review, 2009
- DcellACM SIGCOMM Computer Communication Review, 2008
- SCOPEProceedings of the VLDB Endowment, 2008
- Scalable Application-Level Anycast for Highly Dynamic Groups2003
- Approximation algorithms for scheduling unrelated parallel machinesMathematical Programming, 1990
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978