AbstractAlthough the vertex-centric model originating from Pregel has been well studied, its applications are limited and biased. While PageRank, which can be formalized as a network flow problem, is one of the most common (or overused) applications, the maximum flow problem, which is the most fundamental problem on flow networks, has never been dealt with. In this work, in order to analyze the applicability of the vertex-centric model, we have implemented the push-relabel algorithm for efficiently solving the maximum flow problem on top of Pregel. This paper presents our implementation involving important heuristics, analyzes the applicability of the vertex-centric model, and reports experimental results on our implementation.

中文翻译：

---

在 Pregel 上实现 Push-Relabel 算法

摘要 源自 Pregel 的以顶点为中心的模型虽然得到了很好的研究，但它的应用是有限的和有偏见的。虽然可以形式化为网络流问题的 PageRank 是最常见（或过度使用）的应用程序之一，但最大流问题是流网络中最基本的问题，却从未被处理过。在这项工作中，为了分析以顶点为中心的模型的适用性，我们在 Pregel 之上实现了有效解决最大流问题的 push-relabel 算法。本文介绍了我们涉及重要启发式的实现，分析了以顶点为中心的模型的适用性，并报告了我们实现的实验结果。