In this way, only one send queue is needed for each job(process), and we
don't need to track the location of each other job(which is on which
node).
from a job point of view, either self, or others, all others are
"equal"...
--CQ
> -Original Message-
> From: Michael S. Tsirkin [mailto:
> Quoting Tang, Changqing <[EMAIL PROTECTED]>:
> Subject: RE: Scalable reliable connection
>
>
> A send queue can only serve max J jobs within a node. Is it possible to
> make a single send queue to serve all jobs on all nodes ?
How do you propose to do this?
--
MST
___
> Quoting Gleb Natapov <[EMAIL PROTECTED]>:
> Subject: Re: Scalable reliable connection
>
> On Mon, Jul 30, 2007 at 03:50:54PM +0300, Michael S. Tsirkin wrote:
> > With SRC:
> > O(N ^ 2 * J)
> >
> > This is achived by using a single send queue (per job, out of O(N * J)
> > jobs)
On Mon, Jul 30, 2007 at 03:50:54PM +0300, Michael S. Tsirkin wrote:
> With SRC:
> O(N ^ 2 * J)
>
> This is achived by using a single send queue (per job, out of O(N * J)
> jobs)
> to send data to all J jobs running on a specific node (out of O(N)
> nodes).
> Hardw
