You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 48 Next »

Aggregators

Description

Quoting from Pregel paper: aggregators are a mechanism for global communication, monitoring, and data. Each vertex can provide a value to an aggregator in superstep S, the system combines those values using a reduction operator, and the resulting value is made available to all vertices in superstep S + 1.

You can think aggregators as a tree, that the leafs (which are the graph vertices) are sending messages to the root (the master aggregator), and then the root is combining all these messages to a value. In the end, this combined values is distributed back to the leafs. Aggregators are useful for statistics (think of an histogram of vertex degrees) or for global controlling.

Introduction

  • No labels