Earticle

현재 위치 Home

Adaptive Preshuffling in Hadoop Clusters

첫 페이지 보기
  • 발행기관
    보안공학연구지원센터(IJGDC) 바로가기
  • 간행물
    International Journal of Grid and Distributed Computing 바로가기
  • 통권
    Vol.6 No.2 (2013.04)바로가기
  • 페이지
    pp.79-92
  • 저자
    Jiong Xie, FanJun Meng, HaiLong Wang, JinHong Cheng, Hongfang Pan, Xiao Qin
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A208102

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

원문정보

초록

영어
MapReduce has become an important distributed processing model for large-scale data-intensive applications like data mining and web indexing. Hadoop–an open-source implementation of MapReduce is widely used for short jobs requiring low response time. In this paper, we proposed a new preshuffling strategy in Hadoop to reduce high network loads imposed by shuffle-intensive applications. Designing new shuffling strategies is very appealing for Hadoop clusters where network interconnects are performance bottleneck when the clusters are shared among a large number of applications. The network interconnects are likely to become scarce resource when many shuffle-intensive applications are sharing a Hadoop cluster. We implemented the push model along with the preshuffling scheme in the Hadoop system, where the 2-stage pipeline was incorporated with the preshuffling scheme. We implemented the push model and a pipeline along with the preshuffling scheme in the Hadoop system. Using two Hadoop benchmarks running on the 10-node cluster, we conducted experiments to show that preshuffling-enabled Hadoop clusters are faster than native Hadoop clusters. For example, the push model and the preshuffling scheme powered by the 2-stage pipeline can shorten the execution times of the WordCount and Sort Hadoop applications by an average of 10% and 14%, respectively.

목차

Abstract
 1. Introduction
  1.1. Shuffle-Intensive Hadoop Applications
  1.2. Alleviate Network Load in the Shuffle Phase
  1.3. Benefits and Challenges of the Preshuffling Scheme
  1.4. Organization
 2. Background
  2.1. MapReduce Overview
  2.2. Hadoop Distributed File System
 3. Design Issues
  3.1. Push Model of the Shuffle Phase
  3.2. A Pipeline in Preshuffling
  3.3. In-memory Buffer
 4. Implementation
 5. Evaluation Performance
  5.1. Experimental Environment
  5.2. In Cluster
  5.3. Large Blocks vs. Small Blocks
 6. Related work
 7. Conclusion
 Acknowledgments
 References

키워드

MapReduce Hadoop Shuffle Schedule

저자

  • Jiong Xie [ Inner Mongolia electric power information and communication center, China, Department of Computer Science and Software Engineering, Auburn University ]
  • FanJun Meng [ Computer & Information Engineering College, Inner Mongolia Normal University ]
  • HaiLong Wang [ Computer & Information Engineering College, Inner Mongolia Normal University ]
  • JinHong Cheng [ Inner Mongolia electric power information and communication center, China ]
  • Hongfang Pan [ Inner Mongolia electric power information and communication center, China ]
  • Xiao Qin [ Department of Computer Science and Software Engineering, Auburn University ]

참고문헌

자료제공 : 네이버학술정보

간행물 정보

발행기관

  • 발행기관명
    보안공학연구지원센터(IJGDC) [Science & Engineering Research Support Center, Republic of Korea(IJGDC)]
  • 설립연도
    2006
  • 분야
    공학>컴퓨터학
  • 소개
    1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업

간행물

  • 간행물명
    International Journal of Grid and Distributed Computing
  • 간기
    격월간
  • pISSN
    2005-4262
  • 수록기간
    2008~2016
  • 십진분류
    KDC 505 DDC 605

이 권호 내 다른 논문 / International Journal of Grid and Distributed Computing Vol.6 No.2

    피인용수 : 0(자료제공 : 네이버학술정보)

    함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.

      페이지 저장