The input array is first divided into N partitions of roughly equal size, where N is the number of logical CPUs.
输入数组首先被大致均等地划分为N个分区,这里N是逻辑CPU的数目。
And how about if the array is size n, and I say bracket n, where am I referring?
如果那个数组的大小为n,那会怎么样,我指明,涉及到了那个地方?
The red-black tree is O(log n) in time for most operations, while the previous scheduler employed O(1), using a priority array with a fixed number of priorities.
对于大多数操作,红黑树的执行时间为 O(log n),而以前的调度程序通过具有固定优先级的优先级数组使用 O(1)。
And how about if the array is size N, and I say bracket N, where am I referring?
如果那个数组的大小为N,那会怎么样,我指明,涉及到了那个地方?
应用推荐