
260 Large Scale and Big Data
the adjacency matrix representation of a graph, and therefore we are going to assume
in the following that m = n, unless otherwise noticed.
There are three types of operations in the previous formula:
1. combine2: multiply m
i,j
and v
j
.
2. combineAll: sum n multiplication results for node i.
3. assign: overwrite the previous value of v
i
with the new result to make
i
.
We introduce an abstraction of the basic matrix–vector multiplication, called
generalized iterative matrix–vector multiplication. The corresponding programming
primitive is the GIM-V primitive on which PEGASUS is based. The “Iterative” in
GIM-V denotes ...