¹Science School, Beijing University of Civil Engineering and Architecture, Beijing, China
²Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun, China
³School of Electronics and Information Engineering, Beijing Jiaotong University, Beijing, China

---

Abstract—The replication of the non-structure data from one data center to another is an urgent task in HBase. The paper studies the priority growth probability of the priority replication queue and proposed a dynamic priority replication task queue algorithm based on the earliest deadline first algorithm (EDF). The experiment results show that the proposed algorithm can balance the replication overhead between the high and low priority tasks and avoid the low priority task starving to death as well as ensure the high priority task’s interests.

Index Terms—Non-structure data, HBsase, replication queue, earliest deadline first algorithm (EDF).

[PDF]

Cite: Changlun Zhang, Kaixuan Wang, Haibing Mu, "A Priority Queue Algorithm for the Replication Task in HBase," Journal of Software vol. 8, no. 7, pp. 1765-1769, 2013.