giraph-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Phalguni Mukherjee <phalgunimukherjee1...@gmail.com>
Subject Graph partitioning algorithm
Date Fri, 28 Nov 2014 05:54:40 GMT
Can someone help me out with the algorithm to assign node to the worker, in
Giraph.

I read somewhere that, master selects the number of partition i.e N and
than do a
hash(Vertex_ID)/N on each vertex to know its partition.

will be thankful if someone can explain what this N means and what this
hash function actually is.

Also kindly correct my thought process if my understanding is wrong
regarding the same or provide me some link where I can get the details.



-- 
*Thanks & Regards*
*Phalguni Mukherjee*

Mime
  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message