You can find the implementation of red-black trees in the kernel at ./lib/rbtree.c.
您可以在./lib/rbtree.c 中找到 “红-黑”树的这个实现。
It puts the scheduling entity (process) into the red-black tree and increments the nr_running variable.
它将调度实体(进程)放入红黑树中,并对nr_running变量加1。
The Watson allocation policy maintains free space in the heap as nodes in two separate "red-black trees"
Watson分配策略在两个单独的 “红黑树” 中以节点的形式维护堆中的空闲空间
This function simply picks the left-most task from the red-black tree and returns the associated sched_entity.
此函数只是从红黑树中获取最左端的任务并返回相关 sched_entity。
You can find red-black trees used in a variety of applications, including the construction of associative arrays.
“红-黑”树广泛应用于各种应用程序,其中包括关联数组的构造。
Leaves in a red-black tree contain no information, but internal nodes represent one or more tasks that are runnable.
红黑树的叶子不包含信息,但是内部节点代表一个或多个可运行的任务。
The scheduler then, to be fair, picks the left-most node of the red-black tree to schedule next to maintain fairness.
为了公平,调度器然后选取红黑树最左端的节点调度为下一个以便保持公平性。
First, we'll introduce red-black tree technology to show the internal operations of the message queue framework in this article.
首先,我们介绍红黑树(red - black tree)技术以显示本文中消息队列框架的内部操作。
The currently running task (now preempted) is returned to the red-black tree through a call to put_prev_task (via the scheduling class).
当前运行任务(现在被抢占的任务)通过对put _ prev_task调用(通过调度类)返回到红黑树。
But rather than maintain the tasks in a run queue, as has been done in prior Linux schedulers, the CFS maintains a time-ordered red-black tree (see Figure 1).
但是与之前的Linux调度器不同,它没有将任务维护在运行队列中,CFS维护了一个以时间为顺序的红黑树(参见图1)。
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(logn),而以前的调度程序通过具有固定优先级的优先级数组使用 O(1)。
The data structure used is a red-black tree, which is ideal for performance-focused applications (and happens to be available generically as a library within the kernel).
这个数据结构是一个“红-黑”树,对于注重性能的应用程序很理想(且恰好作为内核中的一个库普遍可用)。
The first potential future change would modify the unacknowledged packet list so that it is organized with an index as a red-black tree instead of the current linear list.
第一个可能的未来改变是对未应答的包列表进行修改,因此包列表的组织形式不再是当前的线性列表而是通过索引组织成红-黑树。
Most importantly, the sched_entity contains the vruntime (64-bit field), which indicates the amount of time the task has run and serves as the index for the red-black tree.
最重要的是, sched_entity包含vruntime(64位字段),它表示任务运行的时间量,并作为红黑树的索引。
Dequeue_task: When a task is no longer runnable, this function is called to keep the corresponding scheduling entity out of the red-black tree. It decrements the nr_running variable.
dequeue _ task:当某个任务退出可运行状态时调用该函数,它将从红黑树中去掉对应的调度实体,并从nr_running变量中减1。
Red-black tree is a self-balancing binary search tree.
红黑树是一个自平衡的二叉查找树。
The Red-Black tree is a compromise between space and time.
红黑树在时间和空间之间达成了妥协。
Red, white, black, and gray always go together.
红、白、黑、灰通常混合使用。
Which color would you like, green, red, black or yellow?
你喜欢什么颜色,绿色、红色、黑色,还是黄色?
In preparation for the celebration, a straw mat is placed on the table, along with a candle holder with seven candles, one black, three red, and three green.
在准备庆祝活动时,桌子上放着一张草席,还有一个蜡烛架,上面有七支蜡烛——一支黑的,三支红的,还有三支绿的。
A crowlike Old World bird of the genus Pyrrhocorax has black plumage and red legs.
红嘴山鸦东半球的一种似乌鸦的山鸦属鸟类,有黑色羽毛和红色的腿部。
The original preference for black was changed in the thirteenth and fourteenth centuries, as such colors as red, violet and purple came into fashion.
最初对黑色的偏好在十三、十四世纪改变了,因为红色、紫罗兰色和紫色开始流行。
避免红色和黑色。
Two wires are attached to the magnet, usually red and black.
磁铁上连接着两根电线,通常分别为红色和黑色。
They had no idea how many red or black cards the deck contained.
它们无法知道其中红卡和黑卡的具体数量。
我的书包不是黑色的而是红色的。
He stands at the gate of Kabul University in a red sweater black jeans and tinted prescription glasses.
他站在喀布尔大学的门口,戴着有色的近视眼镜,穿着红色的毛衣、黑色的牛仔裤。
As I said before, black and red for this one.
我在前面说过,这本书是以红色和黑色为主的。
As I said before, black and red for this one.
我在前面说过,这本书是以红色和黑色为主的。
应用推荐