Apache Hama: An Emerging Bulk Synchronous Parallel Computing Framework for Big Data Applicationsopen access
- Authors
- Siddique, Kamran; Akhtar, Zahid; Yoon, Edward J.; Jeong, Young-Sik; Dasgupta, Dipankar; Kim, Yangwoo
- Issue Date
- 2016
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Apache Hama; big data; BSP; bulk synchronous parallel; distributed computing; Giraph; Hadoop; MapReduce; Spark
- Citation
- IEEE ACCESS, v.4, pp 8879 - 8887
- Pages
- 9
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE ACCESS
- Volume
- 4
- Start Page
- 8879
- End Page
- 8887
- URI
- https://scholarworks.dongguk.edu/handle/sw.dongguk/18995
- DOI
- 10.1109/ACCESS.2016.2631549
- ISSN
- 2169-3536
- Abstract
- In today's highly intertwined network society, the demand for big data processing frameworks is continuously growing. The widely adopted model to process big data is parallel and distributed computing. This paper documents the significant progress achieved in the field of distributed computing frameworks, particularly Apache Hama, a top level project under the Apache Software Foundation, based on bulk synchronous parallel processing. The comparative studies and empirical evaluations performed in this paper reveal Hama's potential and efficacy in big data applications. In particular, we present a benchmark evaluation of Hama's graph package and Apache Giraph using PageRank algorithm. The results show that the performance of Hama is better than Giraph in terms of scalability and computational speed. However, despite great progress, a number of challenging issues continue to inhibit the full potential of Hama to be used at large scale. This paper also describes these challenges, analyzes solutions proposed to overcome them, and highlights research opportunities.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > Department of Information and Communication Engineering > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.