Apache Hama

Apache Hama is a distributed computing framework based on bulk synchronous parallel computing techniques for massive scientific computations e.g., matrix, graph and network algorithms.[1] It is a Top Level Project under the Apache Software Foundation. It was created by Edward J. Yoon,[2] who named it (short for "Hadoop Matrix") and was inspired by Google's Pregel large-scale graph computing framework described in 2010.[3] Hama also means hippopotamus in Korean language (하마),[4] following the trend of naming Apache projects after animals and zoology (such as Apache Pig).

Apache Hama
Developer(s)Apache Software Foundation
Preview release
0.7.1 / March 14, 2016 (2016-03-14)
RepositoryHama Repository
Written inJava
Operating systemCross-platform
TypeDistributed computing, bulk synchronous parallel
LicenseApache License 2.0


Hama consists of three major components: BSPMaster, GroomServers and Zookeeper.[5]


BSPMaster is responsible for:

  • Maintaining groom server status
  • Controlling super steps in a cluster
  • Maintaining job progress information
  • Scheduling jobs and assigning tasks to groom servers
  • Disseminating execution class across groom servers
  • Controlling fault
  • Providing users with the cluster control interface.

A BSP Master and multiple grooms are started by the script. Then, the bsp master starts up with a RPC server for groom servers. Groom servers starts up with a BSPPeer instance and a RPC proxy to contact the bsp master. After started, each groom periodically sends a heartbeat message that encloses its groom server status, including maximum task capacity, unused memory, and so on.

Each time the BSP master receives a heartbeat message, it brings up-to-date groom server status - the bsp master makes use of groom servers' status in order to effectively assign tasks to idle groom servers - and returns a heartbeat response that contains assigned tasks and others actions that a groom server has to do. For now, we have a FIFO job scheduler and very simple task assignment algorithms.


A groom server (shortly referred to as groom) is a process that performs BSP tasks assigned by BSPMaster. Each groom contacts the BSPMaster, and it takes assigned tasks and reports its status by means of periodical piggybacks with BSPMaster. Each groom is designed to run with HDFS or other distributed storages. Basically, a groom server and a data node should be run on one physical node.


A Zookeeper is used to manage the efficient barrier synchronisation of the BSPPeers.

See also


  1. "Apache Hama". Project web site. Retrieved September 20, 2013.
  2. Apache Hama Proposal
  3. Grzegorz Malewicz; Matthew H. Austern; Aart J.C Bik; James C. Dehnert; Ilan Horn; Naty Leiser; Grzegorz Czajkowski (2010). "Pregel: a system for large-scale graph processing". Proceedings of the 2010 ACM SIGMOD International Conference on Management of data. pp. 135–146. doi:10.1145/1807167.1807184. ISBN 9781450300322.
  4. "하마 - 위키낱말사전". ko.wiktionary.org (in Korean). Retrieved 2019-02-21.
  5. Apache Hama Architecture
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.