On 06/09/2010 11:08 AM, Roland Dreier wrote:
> Please also pick up the 3-patch set "Least attached vector support"
> from Yevgeny on 2010-5-13? RDS changes depend on these.
It's now post -rc2, so these obviously wait for 2.6.36 at best.
However, I haven't replied to these patches in detail but in general I
don't like this approach of "pick a random vector" since it is
non-deterministic and not likely to end up with an optimal result.
What is the optimal way to do this, if it isn't to spread CQs evenly
across all available vectors? (least attached vector != random.)
I guess we'll just round-robin modulo caps.num_comp_vectors for now, but
I do think this should be up to the hca, not the ulp, since the ULP has
no visibility into other ulp's usage of vectors.
Regards -- Andy
--
To unsubscribe from this list: send the line "unsubscribe linux-rdma" in
the body of a message to [email protected]
More majordomo info at http://vger.kernel.org/majordomo-info.html
