Hi devs, As you know, many people reports OOM problems with graph algorithms. It is about handling messages. I roughly think that every vertex can send or receive as many messages as the number of outgoing or incoming links. For example, you know, Barack Obama has an 26,000,000+ followers.
I believe the issue of message queue will be fixed by adding spilling queue. Another issue is the grouping messages by vertex ID[1]. To solve this issue, I'm thinking about two ways: 1) Support grouping function of key-value pair messages in BSP framework (like Map/Reduce). 2) Write messages and Sort by vertex ID on local disk (external merge sort). If you have any ideas or suggestions, Pls let me know. 1. https://issues.apache.org/jira/browse/HAMA-704 -- Best Regards, Edward J. Yoon @eddieyoon
