A Robust Distributed Clustering of Large Data Sets on a Grid of Commodity Machines

• Main Authors: Salah Taamneh, Mo’taz Al-Hami, Hani Bani-Salameh, Alaa E. Abdallah
• Format: Article
• Language: English
• Published: MDPI AG 2021-07-01
• Series: Data
• Subjects: k-means clustering; distributed k-means algorithm; actor model; active replication; passive replication; peer-to-peer network
• Online Access: https://www.mdpi.com/2306-5729/6/7/73

Distributed clustering algorithms have proven to be effective in dramatically reducing execution time. However, distributed environments are characterized by a high rate of failure. Nodes can easily become unreachable. Furthermore, it is not guaranteed that messages are delivered to their destination. As a result, fault tolerance mechanisms are of paramount importance to achieve resiliency and guarantee continuous progress. In this paper, a fault-tolerant distributed k-means algorithm is proposed on a grid of commodity machines. Machines in such an environment are connected in a peer-to-peer fashion and managed by a gossip protocol with the actor model used as the concurrency model. The fact that no synchronization is needed makes it a good fit for parallel processing. Using the passive replication technique for the leader node and the active replication technique for the workers, the system exhibited robustness against failures. The results showed that the distributed k-means algorithm with no fault-tolerant mechanisms achieved up to a 34% improvement over the Hadoop-based k-means algorithm, while the robust one achieved up to a 12% improvement. The experiments also showed that the overhead, using such techniques, was negligible. Moreover, the results indicated that losing up to 10% of the messages had no real impact on the overall performance.