Arlin Davis wrote:
I'm running OFED 1.2.5 and using Chelsio.
From the linux rdma verbs perspective, ibv_create_cq() will create a
cq that is >= the requested depth. The fact that mthca always bumps
the size up to the next power of 2 isn't something udapl can rely on.
It doesn't.
uDAPL pa
I'm running OFED 1.2.5 and using Chelsio.
From the linux rdma verbs perspective, ibv_create_cq() will create a cq
that is >= the requested depth. The fact that mthca always bumps the
size up to the next power of 2 isn't something udapl can rely on.
It doesn't.
uDAPL passes the users reque
Jon Mason wrote:
On Tue, Dec 04, 2007 at 11:40:17AM -0800, Arlin Davis wrote:
Jon Mason wrote:
While working on OMPI udapl btl, I have noticed some "interesting"
behavior. OFA udapl wants the evd queues to be a power of 2 and
then will subtract 1 for book keeping (ie, so that internal head and
On Tue, Dec 04, 2007 at 11:40:17AM -0800, Arlin Davis wrote:
> Jon Mason wrote:
>> While working on OMPI udapl btl, I have noticed some "interesting"
>> behavior. OFA udapl wants the evd queues to be a power of 2 and
>> then will subtract 1 for book keeping (ie, so that internal head and
>> tail p
Jon Mason wrote:
While working on OMPI udapl btl, I have noticed some "interesting"
behavior. OFA udapl wants the evd queues to be a power of 2 and
then will subtract 1 for book keeping (ie, so that internal head and
tail pointers never touch except when the ring is empty). OFA udapl
will repor
