For a non-hash partitioning, how does a worker know which destination worker to send a remote message to?
In the Pregel paper, with hash partitioning, a worker can know the destination worker just by hashing the destination vertex ID But for any non-trivial partitioning, how does a worker know where to send a remote message? Welcome any references to the literature. Thank you
