apache.org"
Sent: Monday, January 19, 2015 2:08 PM
Subject: Re: GraphX vertex partition/location strategy
No - the vertices are hash-partitioned onto workers independently of the edges.
It would be nice for each vertex to be on the worker with the most adjacent
edges, but we haven&
No - the vertices are hash-partitioned onto workers independently of the
edges. It would be nice for each vertex to be on the worker with the most
adjacent edges, but we haven't done this yet since it would add a lot of
complexity to avoid load imbalance while reducing the overall communication
by
