Reliable MapReduce computing on opportunistic resources

被引:0
作者
Heshan Lin
Xiaosong Ma
Wu-chun Feng
机构
[1] Virginia Tech,Oak Ridge National Laboratory
[2] North Carolina State University,undefined
来源
Cluster Computing | 2012年 / 15卷
关键词
MapReduce; Cloud computing; Volunteer computing;
D O I
暂无
中图分类号
学科分类号
摘要
MapReduce offers an ease-of-use programming paradigm for processing large data sets, making it an attractive model for opportunistic compute resources. However, unlike dedicated resources, where MapReduce has mostly been deployed, opportunistic resources have significantly higher rates of node volatility. As a consequence, the data and task replication scheme adopted by existing MapReduce implementations is woefully inadequate on such volatile resources.
引用
收藏
页码:145 / 161
页数:16
相关论文
共 9 条
  • [1] Chien A.(2003)Entropia: Architecture and performance of an enterprise desktop grid system J. Parallel Distrib. Comput. 63 597-610
  • [2] Calder B.(2008)Mapreduce: simplified data processing on large clusters Commun. ACM 51 107-113
  • [3] Elbert S.(2008)Replication degree customization for high availability SIGOPS Oper. Syst. Rev. 42 55-68
  • [4] Bhatia K.(undefined)undefined undefined undefined undefined-undefined
  • [5] Dean J.(undefined)undefined undefined undefined undefined-undefined
  • [6] Ghemawat S.(undefined)undefined undefined undefined undefined-undefined
  • [7] Zhong M.(undefined)undefined undefined undefined undefined-undefined
  • [8] Shen K.(undefined)undefined undefined undefined undefined-undefined
  • [9] Seiferas J.(undefined)undefined undefined undefined undefined-undefined