Scalable Facility Location for Massive Graphs on Pregel-like Systems

TL;DR

This paper introduces a scalable parallel algorithm for the facility location problem on massive graphs, optimized for Pregel-like systems, enabling efficient solutions for web and social media graph applications.

Contribution

The authors develop a novel parallel algorithm tailored for Pregel-like architectures, leveraging graph sketches and maximal independent set algorithms for scalable facility location solutions.

Findings

Scales to graphs with billions of edges

Achieves competitive objective function values

Operates efficiently on Apache Giraph

Abstract

We propose a new scalable algorithm for facility location. Facility location is a classic problem, where the goal is to select a subset of facilities to open, from a set of candidate facilities F , in order to serve a set of clients C. The objective is to minimize the total cost of opening facilities plus the cost of serving each client from the facility it is assigned to. In this work, we are interested in the graph setting, where the cost of serving a client from a facility is represented by the shortest-path distance on the graph. This setting allows to model natural problems arising in the Web and in social media applications. It also allows to leverage the inherent sparsity of such graphs, as the input is much smaller than the full pairwise distances between all vertices. To obtain truly scalable performance, we design a parallel algorithm that operates on clusters of shared-nothing machines. In particular, we target modern Pregel-like architectures, and we implement our algorithm on Apache Giraph. Our solution makes use of a recent result to build sketches for massive graphs, and of a fast parallel algorithm to find maximal independent sets, as building blocks. In so doing, we show how these problems can be solved on a Pregel-like architecture, and we investigate the properties of these algorithms. Extensive experimental results show that our algorithm scales gracefully to graphs with billions of edges, while obtaining values of the objective function that are competitive with a state-of-the-art sequential algorithm.