Mailing-List: contact user-help@zookeeper.apache.org; run by ezmlm
Precedence: bulk
Reply-To: user@zookeeper.apache.org
Date: Wed, 2 Sep 2015 07:51:56 -0700
From: Jordan Zimmerman <jordan@jordanzimmerman.com>
To: Prabhjot Bharaj <prabhbharaj@gmail.com>, user@zookeeper.apache.org
Message-ID: <etPan.55e70d0c.595b182e.217@Jordans-MacBook-Pro.local>
In-Reply-To: 
 <CANXk_5m0rnXDHJRZfkrbGgecRSunmDw1_H2BC=5vUW7Zbm9nSQ@mail.gmail.com>
References: 
 <CANXk_5kRYzsHiXOGPabbi+KcrNx8o3t3eQsPiOiETeHTUCjDLQ@mail.gmail.com>
 <6cd5e356-b8e2-4760-918b-ea4441302781@email.android.com>
 <CANXk_5m0rnXDHJRZfkrbGgecRSunmDw1_H2BC=5vUW7Zbm9nSQ@mail.gmail.com>
Subject: Re: Distributed Task Queue with client node failovers
MIME-Version: 1.0
Content-Type: multipart/alternative; boundary="55e70d0c_5847dcfd_217"

--55e70d0c_5847dcfd_217
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: quoted-printable
Content-Disposition: inline

Please have a look at Nirmata Workflow (which I wrote). Given your descri=
ption, it does what you want. Even if you don=E2=80=99t use it, you can r=
eview it for an example of how to do what you want:=C2=A0http://nirmataos=
s.github.io/workflow/

-Jordan


On September 2, 2015 at 5:14:47 AM, Prabhjot Bharaj (prabhbharaj=40gmail.=
com) wrote:

Hi Adam, =20

I had not gone through the contents of the link you provided =20
But, after reading the Tech Note 4, I can say that my use case is not on =
=20
that scale. =20

Regards, =20
Prabhjot =20

On Wed, Sep 2, 2015 at 4:09 PM, Adam Milne-Smith <adam=40milne-smith.co.u=
k> =20
wrote: =20

> Not an answer to your question but I just wanted to check you've read =20
> https://cwiki.apache.org/confluence/display/CURATOR/TN4 =20
> =20
> On 2 Sep 2015 09:47, Prabhjot Bharaj <prabhbharaj=40gmail.com> wrote: =20
> > =20
> > Hello =46olks, =20
> > =20
> > I am trying to design a distributed queue with Zookeeper. The use cas=
e is =20
> > like this:- =20
> > =20
> > A set of 't' tasks to be executed by 'n' nodes in round-robin fashion=
. =20
> But, =20
> > if any node goes down, the other nodes should take the task. =20
> > =20
> > =46or this purpose, I'm reading about zookeeper Queue recipe. The Que=
ue =20
> > recipe relies on client watcher. =20
> > =20
> > Initially, all clients run their respective tasks. But, after one =20
> > iteration, lets say one client node goes down. =20
> > In this case, that client node itself is unavailable to get a Watch =20
> Event, =20
> > can the task be transferred to another node =3F =20
> > =20
> > The worst case will be - =20
> > All the client nodes, but one, are down. Can this one node still pick=
 up =20
> > all tasks sequentially and execute them =3F =20
> > =20
> > Thanks, =20
> > Prabhjot =20
> =20


-- =20
--------------------------------------------------------- =20
=22There are only 10 types of people in the world: Those who understand =20
binary, and those who don't=22 =20

--55e70d0c_5847dcfd_217--