The Community for Technology Leaders
2011 IEEE International Conference on Cluster Computing (2011)
Austin, Texas USA
Sept. 26, 2011 to Sept. 30, 2011
ISBN: 978-0-7695-4516-5
pp: 159-168
Placing data as close as possible to computation is a common practice of data intensive systems, commonly referred to as the data locality problem. By analyzing existing production systems, we confirm the benefit of data locality and find that data have different popularity and varying correlation of accesses. We propose DARE, a distributed adaptive data replication algorithm that aids the scheduler to achieve better data locality. DARE solves two problems, how many replicas to allocate for each file and where to place them, using probabilistic sampling and a competitive aging algorithm independently at each node. It takes advantage of existing remote data accesses in the system and incurs no extra network usage. Using two mixed workload traces from Face book, we show that DARE improves data locality by more than 7 times with the FIFO scheduler in Hadoop and achieves more than 85% data locality for the FAIR scheduler with delay scheduling. Turnaround time and job slowdown are reduced by 19% and 25\%, respectively.
MapReduce, replication, scheduling, locality

R. H. Campbell, C. L. Abad and Y. Lu, "DARE: Adaptive Data Replication for Efficient Cluster Scheduling," 2011 IEEE International Conference on Cluster Computing(CLUSTER), Austin, Texas USA, 2011, pp. 159-168.
97 ms
(Ver 3.3 (11022016))