Hi Sagi- On Apr 17, 2014, at 3:11 PM, Sagi Grimberg <sagig@xxxxxxxxxxxxxxxxxx> wrote: > On 4/17/2014 5:34 PM, Steve Wise wrote: > > <SNIP> >> You could use a small array combined with a loop and a budget count. So the code would >> grab, say, 4 at a time, and keep looping polling up to 4 until the CQ is empty or the >> desired budget is reached... > > Bingo... couldn't agree more. > > Poll Arrays are a nice optimization, Typically, a provider's poll_cq implementation takes the CQ lock using spin_lock_irqsave(). My goal of using a poll array is to reduce the number of times the completion handler invokes spin_lock_irqsave / spin_unlock_irqsave pairs when draining a large queue. > but large arrays will just burden the stack (and might even make things worse in high workloads...) My prototype moves the poll array off the stack and into allocated storage. Making that array as large as a single page would be sufficient for 50 or more ib_wc structures on a platform with 4KB pages and 64-bit addresses. The xprtrdma completion handler polls twice: 1. Drain the CQ completely 2. Re-arm 3. Drain the CQ completely again So between steps 1. and 3. a single notification could handle over 100 WCs, if we were to budget by draining just a single array's worth during each step. (Btw, I'm not opposed to looping while polling arrays. This is just an example for discussion). As for budgeting itself, I wonder if there is a possibility of losing notifications. The purpose of re-arming and then draining again is to ensure that any items queued after step 1. and before step 2. are captured, as by themselves they would never generate an upcall notification, IIUC. When the handler hits its budget and returns, xprtrdma needs to be invoked again to finish draining the completion queue. How is that guaranteed? -- Chuck Lever chuck[dot]lever[at]oracle[dot]com -- To unsubscribe from this list: send the line "unsubscribe linux-nfs" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
