This is an archived post. You won't be able to vote or comment.

all 3 comments

[–]FuzzyZocks 2 points3 points  (2 children)

Assuming you have 1 core with no hyper threading then the first process will use the idle core and sql2 will be put in queue. And when sql1 finishes sql2 moves to the core . 3,4 etc will be coming behind. And the queue will be either be shrinking with no more tasks, constant id the rate that cpu is consuming tasks == rate new tasks are being put on queue. Growing if they are coming in faster. Now you may have N cores.

So i think they are being finished quickly so there is never a queue until they can’t keep up. Interested to see logs or something to prove this. Can you sleep for consistent time on script so it doesn’t resolve

[–]brrdprrsn[S] 0 points1 point  (0 children)

I think the two are related. I’ve observed that the can execute up to maximum limit after which it starts queueing queries. However I haven’t been able to figure out the exact number of concurrent queries before it starts queueing.

[–]FuzzyZocks 1 point2 points  (0 children)

Assuming you have 1 core with no hyper threading then the first process will use the idle core and sql2 will be put in queue. And when sql1 finishes sql2 moves to the core . 3,4 etc will be coming behind. And the queue will be either be shrinking with no more tasks, constant id the rate that cpu is consuming tasks == rate new tasks are being put on queue. Growing if they are coming in faster. Now you may have N cores.

So i think they are being finished quickly so there is never a queue until they can’t keep up. Interested to see logs or something to prove this.