[concurrency-interest] Effort to create a Blocking Queue between Java processes

√iktor Ҡlang viktor.klang at gmail.com
Wed Feb 6 17:16:46 EST 2013


On Wed, Feb 6, 2013 at 10:46 PM, <javamann at cox.net> wrote:

> I was looking at solutions that used MMap but the problem is the
> coordination between the processes. I would really like the situation where
> the consuming thread would block until there was data available vs.
> polling. This would be really cool if it was part of the JVM.
>

There is. It's called InputStream.

Cheers,
√


>
> Thanks
>
> -Pete
>
> ---- Adam Browning <adbrowning at gmail.com> wrote:
>
> =============
> If you're looking for shared memory between processes, you could set
> up something with mmap (assuming you control both sides of the
> communication). It probably wouldn't be as fast as the shared memory
> of threads, but I suspect that it'd probably be faster than going
> through the TCP/IP stack.
>
> Adam
>
> On Wed, Feb 6, 2013 at 3:25 PM,  <javamann at cox.net> wrote:
> > It appears Hazelcast is using IP, I was more interested in using Shared
> Memory.
> >
> > Thanks though, I didn't know about Hazelcast before.
> >
> > -Pete
> >
> > ---- Daniel Yokomizo <daniel.yokomizo at gmail.com> wrote:
> >
> > =============
> > Hi,
> >
> > Hazelcast offers a distributed BlockingQueue implementation. You can
> > check with them to see if they have effort records.
> >
> > http://www.hazelcast.com/docs/2.5/manual/single_html/#Queue
> >
> > Daniel Yokomizo.
> >
> > On Wed, Feb 6, 2013 at 5:39 PM,  <javamann at cox.net> wrote:
> >> Hi all,
> >>     Sorry if this isn't the place to ask this but I was wondering what
> would be the amount of effort to create a framework where you can create a
> Blocking Queue type structure between two (or more) Java Processes?
> >>
> >> Thanks
> >>
> >> -Pete
> >> _______________________________________________
> >> Concurrency-interest mailing list
> >> Concurrency-interest at cs.oswego.edu
> >> http://cs.oswego.edu/mailman/listinfo/concurrency-interest
> >
> > --
> >
> > 1. If a man is standing in the middle of the forest talking, and there
> is no woman around to hear him, is he still wrong?
> >
> > 2. Behind every great woman... Is a man checking out her ass
> >
> > 3. I am not a member of any organized political party. I am a Democrat.*
> >
> > 4. Diplomacy is the art of saying "Nice doggie" until you can find a
> rock.*
> >
> > 5. A process is what you need when all your good people have left.
> >
> >
> > *Will Rogers
> >
> >
> > _______________________________________________
> > Concurrency-interest mailing list
> > Concurrency-interest at cs.oswego.edu
> > http://cs.oswego.edu/mailman/listinfo/concurrency-interest
>
> --
>
> 1. If a man is standing in the middle of the forest talking, and there is
> no woman around to hear him, is he still wrong?
>
> 2. Behind every great woman... Is a man checking out her ass
>
> 3. I am not a member of any organized political party. I am a Democrat.*
>
> 4. Diplomacy is the art of saying "Nice doggie" until you can find a rock.*
>
> 5. A process is what you need when all your good people have left.
>
>
> *Will Rogers
>
>
> _______________________________________________
> Concurrency-interest mailing list
> Concurrency-interest at cs.oswego.edu
> http://cs.oswego.edu/mailman/listinfo/concurrency-interest
>



-- 
*Viktor Klang*
*Director of Engineering*
*
*
Typesafe <http://www.typesafe.com/> - The software stack for applications
that scale
Twitter: @viktorklang
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs.oswego.edu/pipermail/concurrency-interest/attachments/20130206/c7ce4ef2/attachment-0001.html>


More information about the Concurrency-interest mailing list