Roch - PAE wrote:
> Do I get this right also that the need to yield the CPU is
> only present on single CPU systems (a rare thing these
> days).
I believe the dynamics is not about yielding the CPU
(btw, what is the facility in kernel to cause the
current running thread to yield?) If Adi is reading
this, he can explain the dynamics in details. But
how I understand it is that the reason is actually
similar to the rationale behind Nagle algorithm. Nagle
is there to minimize the chance of sending very small TCP
segment over the network unnecessarily. The implementation
is very simple. TCP won't send small segment if there
is unacknowledged data.
Apply this idea to the fusion case and you will get
something like the current algorithm. The difference
to the TCP over real network case is that although TCP
will not send anything, it will continue to buffer data.
But the fusion case will make the sender block instead.
*IF* the sender is clever and does its own buffering so
that when it is unblocked, it can send a huge chunk of
data, it will be a win.
How to make the above work smoothly is the question
to answer.
--
K. Poon.
[EMAIL PROTECTED]
_______________________________________________
networking-discuss mailing list
[email protected]
