> > 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.) Since there is no way to know whether a given vector has a bunch of CQs that generate very few events or maybe a single CQ that generates a heavy load of events, the number of attached CQs is really pretty useless as a basis to decide. I think it's much better to try and attach your CQ to a vector that is directed at the CPU where you want to process the work. - R. -- Roland Dreier <[email protected]> || For corporate legal information go to: http://www.cisco.com/web/about/doing_business/legal/cri/index.html -- 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
