One question:
The synchronization occurs only when peer.sync() is called?
I think the needToVisit() function might as well need to communicate
with other machine:
for (Integer i : vertex.getAdjacent()) {
if (needToVisit(i, vertex, input.get(e.getKey()))) {
Since the current node might not know the state of Vertex i, it might
need to contact other machine to check the "visited" state. So, is the
synchronization also occur at this step?
Felix Halim
On Wed, Feb 3, 2010 at 2:29 PM, Edward J. Yoon <[email protected]> wrote:
> Hi,
>
> Regarding graph computing, below TP will be helpful for you.
>
> "An Introduction to Bulk Synchronization Parallel on Hadoop"
> http://people.apache.org/~edwardyoon/papers/Apache_HAMA_BSP.pdf
>
> And, there is also a prototype project, a graph computing framework
> based on BSP.
> http://people.apache.org/~edwardyoon/hamburg_poc.zip
>
> On Wed, Feb 3, 2010 at 3:17 PM, Felix Halim <[email protected]> wrote:
>> Hi Edward,
>>
>> I also like to know how Hama's BSP can be used on Graphs.
>> Can you send me some docs about it?
>>
>> Thanks,
>>
>> Felix Halim
>>
>> On Wed, Feb 3, 2010 at 2:11 PM, Edward J. Yoon <[email protected]> wrote:
>>> Sure, I'll share it with you.
>>>
>>> On Wed, Feb 3, 2010 at 2:49 PM, <[email protected]> wrote:
>>>> Hi Edward,
>>>> Could you send me some documentation regarding BSP- Hama
>>>> especially how
>>>> it can be used for performing operations on matrices ?
>>>>
>>>> Best Regards from Buffalo
>>>>
>>>> Abhishek Agrawal
>>>>
>>>> SUNY- Buffalo
>>>> (716-435-7122)
>>>>
>>>>
>>>>
>>>>
>>>
>>>
>>>
>>> --
>>> Best Regards, Edward J. Yoon @ NHN, corp.
>>> [email protected]
>>> http://blog.udanax.org
>>>
>>
>
>
>
> --
> Best Regards, Edward J. Yoon @ NHN, corp.
> [email protected]
> http://blog.udanax.org
>
