Yes, I ran that example by copying it verbatim, it ran. Don't know why my
MaxFindVertex is not working.

--
thanks and regards,

Apurv Verma
India





On Wed, May 30, 2012 at 11:31 AM, Thomas Jungblut <
[email protected]> wrote:

> Oops, I have read "with aggregator" and not without. I'm sorry Apurv.
> Do you had a look at the mindist search/connected component example in
> example package? It does actually the same but inverted.
>
>
> 2012/5/30 Apurv Verma <[email protected]>
>
> > Isn't an aggregator optional?
> >
> > --
> > thanks and regards,
> >
> > Apurv Verma
> > India
> >
> >
> >
> >
> >
> > On Wed, May 30, 2012 at 11:26 AM, Thomas Jungblut <
> > [email protected]> wrote:
> >
> > > Hi Apurv,
> > >
> > > there is no aggregator defined in your code.
> > >
> > > 2012/5/30 Apurv Verma <[email protected]>
> > >
> > > > Hello,
> > > >  After several attempts I was unable to run the MaxFindVertex without
> > > using
> > > > Aggregators.
> > > >
> > > > Here is the source code. http://pastebin.com/VMTXPtRR. I have
> changed
> > > the
> > > > num of bsp tasks to 1,2 and 3 but still it doesn't work. The input
> > graph
> > > > file is very small.
> > > > Here is the graph file. http://pastebin.com/uAJASSRi
> > > >
> > > > Here are the logs.
> > > >
> > > > These are the task logs.
> > > >
> > > >   1. http://pastebin.com/imMKB6Hs
> > > >   2. http://pastebin.com/xvMZris0
> > > >   3. http://pastebin.com/PkgMrsdx
> > > >
> > > >
> > > > The bsp master log http://pastebin.com/0uQYP03B
> > > >
> > > >
> > > > The groom log  http://pastebin.com/GYY9sUEv
> > > >
> > > > Can you please let me know my mistake.
> > > >
> > > > --
> > > > thanks and regards,
> > > >
> > > > Apurv Verma
> > > > India
> > > >
> > >
> > >
> > >
> > > --
> > > Thomas Jungblut
> > > Berlin <[email protected]>
> > >
> >
>
>
>
> --
> Thomas Jungblut
> Berlin <[email protected]>
>

Reply via email to