Uploaded image for project: 'Giraph'
  1. Giraph
  2. GIRAPH-252

Detecting Number of Vertices for inputs without an entry for vertices with no out edge

    XMLWordPrintableJSON

    Details

    • Type: Improvement
    • Status: Open
    • Priority: Minor
    • Resolution: Unresolved
    • Affects Version/s: 1.0.0
    • Fix Version/s: 1.0.0
    • Component/s: bsp
    • Labels:
      None

      Description

      When an input is given in the format where

      A A_value B B_value C C_value

      which means that vertex A with value of A_value has an outgoing edge to B and C with edge values of B_value and C_value respectively, currently implementation of Giraph would only detect A at superstep 0, thus getNumVertices() will return 0 at superstep 0.

      Current implementation would create B, C after the messages have been sent to B and C, which then updates getNumVertices() for all supersteps > 0.

      Now the problem with this approach is as follows.

      If there is an algorithm that assumes it does not alter the graph in any way and saves the number of vertices at superstep 0, it will result in a wrong output. (Green-Marl port of Giraph does this...)

      So, the option is to either not allow this kind of input or create all the vertices prior to superstep 0.

      It would be good if I can get some inputs to this.

      Thank you

        Attachments

          Activity

            People

            • Assignee:
              Unassigned
              Reporter:
              yo2seol Sean Choi
            • Votes:
              0 Vote for this issue
              Watchers:
              1 Start watching this issue

              Dates

              • Created:
                Updated:

                Time Tracking

                Estimated:
                Original Estimate - 24h
                24h
                Remaining:
                Remaining Estimate - 24h
                24h
                Logged:
                Time Spent - Not Specified
                Not Specified