Earticle

현재 위치 Home

BiShard Parallel Processor : A Disk-Based Processing Engine for Billion-Scale Graphs

첫 페이지 보기
  • 발행기관
    보안공학연구지원센터(IJMUE) 바로가기
  • 간행물
    International Journal of Multimedia and Ubiquitous Engineering SCOPUS 바로가기
  • 통권
    Vol.9 No.2 (2014.02)바로가기
  • 페이지
    pp.199-212
  • 저자
    Kamran Najeebullah, Kifayat Ullah Khan, Waqas Nawaz, Young-Koo Lee
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A217628

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

원문정보

초록

영어
Processing very large graphs efficiently is a challenging task. Distributed graph processing systems process the billion-scale graphs efficiently but incur overheads of partitioning and distribution of the large graph over a cluster of nodes. In order to overcome these problems a disk-based engine, GraphChi was proposed recently that processes the graph in chunks on a single PC. GraphChi significantly outperformed all the representative distributed processing frameworks. Still, we observe that GraphChi incurs some serious degradation in performance due to 1) high number of non-sequential I/Os for processing every chunk of the graph; and 2) limited parallelism to process the graph. In this paper, we propose a novel engine named BiShard Parallel Processor (BSPP) to efficiently process billions-scale graphs on a single PC. We introduce a new storage structure BiShard. BiShard divides the large graph into subgraphs and maintains the in and out edges separately. This storage mechanism significantly reduces the number of non-sequential I/Os. We implement a new processing model named BiShard Parallel (BSP) on top of Bishard. BSP exploits the properties of Bishard to enable full CPU parallelism for processing the graph. Our experiments on real large graphs show that our solution significantly outperforms GraphChi.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Preliminaries
  3.1. Disk-based processing
  3.2. Vertex-centric approach
  3.3. Parallel Sliding Window
 4. BiShard Parallel Processor
  4.1. Notions
  4.2. BiShard storage structure
  4.3. BiShard Parallel (BSP) processing model
  4.4. I/Os cost analysis
 5. Experimental Evaluation
  5.1. Experiments setup
  5.2. Page rank algorithm
 6. Conclusion
 Acknowledgements
 References

키워드

Graph processing Disk-based processing Parallel processing BiShard Parallel

저자

  • Kamran Najeebullah [ Department of Electronics and Computer Engineering Kyung Hee University, Korea ]
  • Kifayat Ullah Khan [ Department of Electronics and Computer Engineering Kyung Hee University, Korea ]
  • Waqas Nawaz [ Department of Electronics and Computer Engineering Kyung Hee University, Korea ]
  • Young-Koo Lee [ Department of Electronics and Computer Engineering Kyung Hee University, Korea ]

참고문헌

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

간행물 정보

발행기관

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

간행물

  • 간행물명
    International Journal of Multimedia and Ubiquitous Engineering
  • 간기
    월간
  • pISSN
    1975-0080
  • 수록기간
    2008~2016
  • 등재여부
    SCOPUS
  • 십진분류
    KDC 505 DDC 605

이 권호 내 다른 논문 / International Journal of Multimedia and Ubiquitous Engineering Vol.9 No.2

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

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

      페이지 저장